Reaching Consensus for Asynchronous Distributed Key Generation
Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, Alin Tomescu
Abstract
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.
Topics & Concepts
Asynchronous communicationComputer scienceKey (lock)Constant (computer programming)Distributed computingProtocol (science)Computer networkConsensusPublic key infrastructurePublic-key cryptographyComputer securityMulti-agent systemArtificial intelligenceMedicineEncryptionProgramming languageAlternative medicinePathologyDistributed systems and fault toleranceCryptography and Data SecurityDNA and Biological Computing