Corpus ID: 231951556

Reaching Consensus for Asynchronous Distributed Key Generation

@article{Abraham2021ReachingCF,
  title={Reaching Consensus for Asynchronous Distributed Key Generation},
  author={I. Abraham and Philipp Jovanovic and M. Maller and S. Meiklejohn and Gilad Stern and Alin Tomescu},
  journal={ArXiv},
  year={2021},
  volume={abs/2102.09041}
}
We give a protocol for Asynchronous Distributed Key Generation (A-DKG) that is optimally resilient (can withstand 5 < =3 faulty parties), has a constant expected number of rounds, has $̃ (=3) expected communication complexity, and assumes only the existence of a PKI. Prior to our work, the best A-DKG protocols required Ω (=) expected number of rounds, and Ω (=4) expected communication. Our A-DKG protocol relies on several building blocks that are of independent interest. We define and design a… Expand
Efficient Asynchronous Byzantine Agreement without Private Setups
  • Yingzi Gao, Yuan Lu, Zhenliang Lu, Qiang Tang, Jing Xu, Zhenfeng Zhang
  • Computer Science
  • 2021
Asynchronous Data Dissemination and its Applications

References

SHOWING 1-10 OF 37 REFERENCES
Distributed Key Generation in the Wild
An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited
Asynchronous Byzantine Agreement Protocols
Aggregatable Distributed Key Generation
...
1
2
3
4
...