Reaching Consensus for Asynchronous Distributed Key Generation

  title={Reaching Consensus for Asynchronous Distributed Key Generation},
  author={Ittai Abraham and Philipp Jovanovic and Mary Maller and Sarah Meiklejohn and Gilad Stern and Alin Tomescu},
  journal={Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing},
We give a protocol for Asynchronous Distributed Key Generation (A-DKG) that is optimally resilient (can withstand f < n over 3 faulty parties), has a constant expected number of rounds, has Õ (n3) expected communication complexity, and assumes only the existence of a PKI. Prior to our work, the best A-DKG protocols required Ω(n) expected number of rounds, and Ω(n4) expected communication. Our A-DKG protocol relies on several building blocks that are of independent interest. We define and design… 

Efficient Asynchronous Byzantine Agreement without Private Setups

This work presents a systematic treatment of reasonably fair common randomness protocols in the asynchronous network, and gives a reasonably fair random leader election protocol with expected O ( λn 3 ) communication and expected constant rounds.

Asynchronous Data Dissemination and its Applications

The problem of Asynchronous Data Dissemination is introduced and a simple and efficient ADD protocol for n parties is designed that is information-theoretically secure, tolerates up to one-third malicious nodes, and has a communication cost of O(n|M|+n2) for disseminating a message M.

Practical and Improved Byzantine Reliable Broadcast and Asynchronous Verifiable Information Dispersal from Hash Functions

A hash-based BRB protocol is provided that improves concretely on DXR BRB, having low constants and avoiding using online error correction on bulk data and the first setup-free AVID protocol achieving O(L+ kn) communication is provided.

Practical Asynchronous Distributed Key Generation

This paper presents a simple and concretely efficient asynchronous DKG (ADKG) protocol, which produces a field element as the secret and is thus compatible with off-the-shelf threshold cryptosystems.

Synchronous Distributed Key Generation without Broadcasts

This work designs and implements the first synchronous DKG protocol for discrete log-based cryptosystems with O(κn) communication complexity that tolerates t < n/2 Byzantine faults among n parties and shows two variants of the protocol.

Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement

A new abstraction based on crusader agreement called Binding Crusader Agreement (BCA) for solving binary consensus in the asynchronous setting against an adaptive adversary and improves the expected time to terminate in the computational setting with threshold signatures, and matches the state of the art in the information theoretic setting.

Dumbo-NG: Fast Asynchronous BFT Consensus with Throughput-Oblivious Latency

Dumbo - NG , a novel asynchronous BFT consensus (atomic broadcast) to solve the remaining practical issues and bring about two benefits: the throughput-latency tension is resolved to approach peak throughput with minimal increase in latency and the transactions broadcasted by any honest node can be agreed to output, thus conquering the censorship threat with no extra cost.

WaterBear: Asynchronous BFT with Information-Theoretic Security and Quantum Security

WaterBear is designed and implemented, a family of new asynchronous BFT protocols that are information-theoretically secure or quantum secure and built more efficient asynchronous binary agreement protocols from local coins and their reproposable ABA counterparts.

Long Live The Honey Badger: Robust Asynchronous DPSS and its Applications

This work introduces the first high-threshold DPSS, which offers favorable characteristics relative to prior non-synchronous works in the presence of faults while simultaneously supporting higher privacy thresholds, and batch-amortizes this scheme along with a parallel non-high-th threshold scheme which achieves optimal bandwidth characteristics.



Distributed Key Generation in the Wild

This work proposes a practical system model for the Internet and defines an efficient verifiable secret sharing (VSS) scheme in it and designs a provably secure DKG protocol, which is implemented and establishes its efficiency and reliability by extensively testing it on the PlanetLab platform.

Asymptotically Optimal Validated Asynchronous Byzantine Agreement

A new protocol for Validated Asynchronous Byzantine Agreement in the authenticated setting with optimal resilience of ƒ < n/3 Byzantine failures and asymptotically optimal expected O(1) running time to reach agreement.

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 cryptographic keys with a

An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience

A Byzantine agreement protocol that simultaneously achieves three properties: (optimal) resilience: it works as long as n>3t; (almost-sure) termination: with probability one, all nonfaulty processes terminate; (polynomial) efficiency: the expected computation time, memory consumption, message size, and number of messages sent are all polynomial in n.

Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography

A new protocol for Byzantine agreement in a completely asynchronous network is presented that makes use of new cryptographic protocols, specifically protocols for threshold signatures and coin-tossing based on the Diffie-Hellman problem.

An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement

This paper exhibits a protocol that, in probabilistic polynomial time and without relying on any external trusted party, reaches Byzantine agreement in an expected constant number of rounds and in the worst natural fault model.

Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited

This paper presents two asynchronous almost-surely terminating Byzantine Agreement protocols built on a variant of AVSS that is termed as shunning, and follows the traditional route of building BA via common coin protocol that in turn reduces to asynchronous verifiable secretsharing (AVSS).

Asynchronous Byzantine Agreement Protocols

Aggregatable Distributed Key Generation

This paper introduces a distributed key generation (DKG) protocol with aggregatable and publicly-verifiable transcripts and proves the security of the aggregatable DKG as well as that of several existing DKGs, including the popular Pedersen variant.

Asynchronous Computational VSS with Reduced Communication Complexity

This work considers the communication complexity of asynchronous VSS in the computational setting for the optimal resilience of n=3t+1 and presents two protocols with O( n2) message complexity and O(κn2) communication complexity, which satisfies the standard VSS definition.