Message-optimal protocols for Byzantine Agreement

DOI10.1007/BF01187074zbMath0766.68007OpenAlexW1974680066MaRDI QIDQ4031321

Vassos Hadzilacos, Joseph Y. Halpern

Publication date: 1 April 1993

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01187074

zbMATH Keywords

distributed systemByzantine agreementprotocolsomission failuresfailure-free

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, The Failure Discovery problem, Modular construction of an efficient 1-bit Byzantine agreement protocol, Brief Announcement: Improved Consensus in Quantum Networks, Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication, Hundreds of impossibility results for distributed computing, Using counterfactuals in knowledge-based programming, On the message complexity of binary Byzantine agreement under crash failures, 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
• On the message complexity of binary Byzantine agreement under crash failures
• Authenticated Algorithms for Byzantine Agreement
• Knowledge and common knowledge in a distributed environment
• Automatically increasing the fault-tolerance of distributed algorithms
• Early stopping in Byzantine agreement
• Bounds on information exchange for Byzantine agreement
• Impossibility of distributed consensus with one faulty process
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• The Failure Discovery problem
• Are wait-free algorithms fast?
• Unnamed Item
• Unnamed Item
• Unnamed Item