Reaching consensus for asynchronous distributed key generation

DOI10.1145/3465084.3467914MaRDI QIDQ6830485zbMATH OpenFDO

Authors Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, Alin Tomescu

Publication date 26 March 2024

Published in Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://discovery.ucl.ac.uk/id/eprint/10133255/1/2102.09041v3.pdf

zbMATH Keywords

Byzantine fault toleranceconsensuscryptographic protocolsdistributed algorithmsdistributed key generationleader election

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Cryptography (94A60)

Cited in

(7)

• Asymptotically optimal adaptive asynchronous common coin and DKG with silent setup
• Asynchronous agreement on a core set in constant expected time and more efficient asynchronous VSS and MPC
• HARTS: high-threshold, adaptively secure, and robust threshold Schnorr signatures
• Swiper: a new paradigm for efficient weighted distributed protocols
• All Byzantine agreement problems are expensive
• Optimal Byzantine agreement in the presence of message drops
• Synchronous distributed key generation without broadcasts

This page was built for publication: Reaching consensus for asynchronous distributed key generation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6830485)