Reaching consensus for asynchronous distributed key generation
From MaRDI portal
Publication:6096032
DOI10.1007/s00446-022-00436-8arXiv2102.09041MaRDI QIDQ6096032
Alin Tomescu, Mary Maller, Philipp Jovanovic, Ittai Abraham, Gilad Stern, Sarah Meiklejohn
Publication date: 11 September 2023
Published in: Distributed Computing, Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.09041
distributed computingdistributed algorithmsconsensuscryptographic protocolsleader electionasynchronydistributed key generationByzantine adversaryByzantine fault tolerance
Related Items (2)
\textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation ⋮ Network-agnostic security comes (almost) for free in DKG and MPC
Cites Work
- Unnamed Item
- Asynchronous byzantine agreement protocols
- Aggregatable distributed key generation
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- Asynchronous Multi-Party Computation with Quadratic Communication
- Bounds on information exchange for Byzantine agreement
- Impossibility of distributed consensus with one faulty process
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Asynchronous Computational VSS with Reduced Communication Complexity
- Asymptotically Optimal Validated Asynchronous Byzantine Agreement
- HotStuff
- Simple and efficient asynchronous byzantine agreement with optimal resilience
- Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited
- Fast asynchronous Byzantine agreement with optimal resilience
- Asynchronous secure computation
- Asynchronous secure computations with optimal resilience (extended abstract)
- Principles of Distributed Systems
- On Expected Constant-Round Protocols for Byzantine Agreement
- Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, Revisited
This page was built for publication: Reaching consensus for asynchronous distributed key generation