On the message complexity of binary Byzantine agreement under crash failures

DOI10.1007/BF02277665zbMath0744.68032MaRDI QIDQ1189856

Samuel M. Weber, Vassos Hadzilacos, Eugene S. Amdur

Publication date: 27 September 1992

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

zbMATH Keywords

fault-tolerancedistributed systemagreementprotocols

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)

Related Items

Robust gossiping with an application to consensus, Communication Complexity of Wait-Free Computability in Dynamic Networks, Message-optimal protocols for Byzantine Agreement, The Failure Discovery problem, Brief Announcement: Improved Consensus in Quantum Networks, Hundreds of impossibility results for distributed computing, Optimistically tuning synchronous Byzantine consensus: another win for null messages

Cites Work

• Knowledge and common knowledge in a Byzantine environment: Crash failures
• A lower bound for the time to assure interactive consistency
• Authenticated Algorithms for Byzantine Agreement
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• Bounds on information exchange for Byzantine agreement
• Reaching Agreement in the Presence of Faults
• Message-optimal protocols for Byzantine Agreement
• Unnamed Item
• Unnamed Item