Not a COINcidence: sub-quadratic asynchronous Byzantine agreement WHP

DOI10.4230/lipics.disc.2020.25zbMath1540.68032MaRDI QIDQ6535024

Shir Cohen, Idit Keidar, Alexander Spiegelman

Publication date: 2 November 2023

zbMATH Keywords

Byzantine agreementshared coinsub-quadratic consensus protocolVRF

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Asynchronous byzantine agreement protocols
• Ordered and delayed adversaries and how to work against them on a shared channel
• Asynchronous Byzantine agreement with subquadratic communication
• The cost of global broadcast in dynamic radio networks
• Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
• How to share a secret
• Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time
• A Denial-of-Service Resistant DHT
• Bounds on information exchange for Byzantine agreement
• Impossibility of distributed consensus with one faulty process
• The Byzantine Generals Problem
• Time, clocks, and the ordering of events in a distributed system
• Communication Complexity of Byzantine Agreement, Revisited
• Asymptotically Optimal Validated Asynchronous Byzantine Agreement
• Fast asynchronous Byzantine agreement with optimal resilience
• Breaking the O ( n ² ) bit barrier
• Byzantine agreement in polynomial expected time
• Public Key Cryptography - PKC 2005
• Unique Ring Signatures: A Practical Construction

This page was built for publication: Not a COINcidence: sub-quadratic asynchronous Byzantine agreement WHP