Asynchronous Byzantine agreement with optimal resilience

DOI10.1007/S00446-013-0200-5zbMath1291.68056OpenAlexW2120349876MaRDI QIDQ2251153

Ashish Choudhury, Arpita Patra, C. Pandu Rangan

Publication date: 11 July 2014

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://eprint.iacr.org/2008/424

zbMATH Keywords

secret sharingByzantine agreementcommon coincomputationally unbounded

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (5)

Perfectly-secure asynchronous MPC for general adversaries (extended abstract) ⋮ Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries ⋮ Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience ⋮ On the communication efficiency of statistically secure asynchronous MPC with optimal resilience ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Secure distributed key generation for discrete-log based cryptosystems
• How to share a secret
• The Round Complexity of Verifiable Secret Sharing Revisited
• Improving the Round Complexity of VSS in Point-to-Point Networks
• Impossibility of distributed consensus with one faulty process
• Privacy Amplification by Public Discussion
• Reaching Agreement in the Presence of Faults
• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
• Generalized privacy amplification
• Simple and efficient asynchronous byzantine agreement with optimal resilience
• The round complexity of verifiable secret sharing and secure multicast
• Fast asynchronous Byzantine agreement with optimal resilience
• Brief announcement
• Theory of Cryptography

This page was built for publication: Asynchronous Byzantine agreement with optimal resilience