Modular construction of an efficient 1-bit Byzantine agreement protocol

DOI10.1007/BF01187076zbMath0766.68005OpenAlexW1975556964MaRDI QIDQ4031323

Brian A. Coan, Jennifer Lundelius Welch

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/bf01187076

zbMATH Keywords

distributed computingByzantine relay protocol

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items

Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds, A flexible formal framework for masking/demasking faults, Efficient agreement using fault diagnosis.

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
• Modular construction of a Byzantine agreement protocol with optimal message bit complexity
• Bounds on information exchange for Byzantine agreement
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• The Byzantine generals strike again
• Message-optimal protocols for Byzantine Agreement