Modular construction of a Byzantine agreement protocol with optimal message bit complexity

DOI10.1016/0890-5401(92)90004-YzbMath0753.68009OpenAlexW1968010535MaRDI QIDQ1186809

Brian A. Coan, Jennifer Lundelius Welch

Publication date: 28 June 1992

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(92)90004-y

zbMATH Keywords

fault-tolerancedistributed computingquality measureagreement protocolsprotocol transformation

Mathematics Subject Classification ID

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

Related Items

Broadcast from Minicast Secure Against General Adversaries, Optimal extension protocols for Byzantine broadcast and agreement, Modular construction of an efficient 1-bit Byzantine agreement protocol, Distributed CONGEST Algorithms against Mobile Adversaries, Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links, Efficient perfectly secure computation with optimal resilience, Efficient perfectly secure computation with optimal resilience, Efficient agreement using fault diagnosis., Fast consensus in networks of bounded degree.

Cites Work

• Consensus algorithms with one-bit messages
• Easy impossibility proofs for distributed consensus problems
• A lower bound for the time to assure interactive consistency
• Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
• Efficient agreement using fault diagnosis.
• Early stopping in Byzantine agreement
• Bounds on information exchange for Byzantine agreement
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• The Byzantine generals strike again
• Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
• An efficient algorithm for byzantine agreement without authentication