Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures.
In this paper, we present the first Asynchronous Distributed Key Generation (ADKG)
algorithm which is also the first distributed key generation algorithm that can generate …
algorithm which is also the first distributed key generation algorithm that can generate …
Round efficient byzantine agreement from VDFs
Byzantine agreement (BA) is a fundamental primitive in distributed systems and has
received huge interest as an important building block for blockchain systems. Classical …
received huge interest as an important building block for blockchain systems. Classical …
Resource burning for permissionless systems
Proof-of-work puzzles and CAPTCHAS consume enormous amounts of energy and time.
These techniques are examples of resource burning: verifiable consumption of resources …
These techniques are examples of resource burning: verifiable consumption of resources …
Bankrupting Sybil despite churn
A Sybil attack occurs when an adversary controls multiple system identifiers (IDs). Limiting
the number of Sybil (bad) IDs to a minority is critical for tolerating malicious behavior. A …
the number of Sybil (bad) IDs to a minority is critical for tolerating malicious behavior. A …
Randomized view reconciliation in permissionless distributed systems
In a sybil attack, an adversary creates many fake identities/nodes and have them join the
system. Computational puzzles have long been investigated as a possible sybil defense …
system. Computational puzzles have long been investigated as a possible sybil defense …
Sybil defense using efficient resource burning
D Gupta - 2020 - search.proquest.com
Abstract In 1993, Dwork and Naor proposed using computational puzzles, a resource
burning mechanism, to combat spam email. In the ensuing three decades, resource burning …
burning mechanism, to combat spam email. In the ensuing three decades, resource burning …