Modular construction of an efficient 1-bit Byzantine agreement protocol

DOI10.1007/BF01187076zbMATH Open0766.68005OpenAlexW1975556964MaRDI QIDQ4031323FDOQ4031323

Authors: Brian A. Coan, Jennifer L. 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

Recommendations

• Modular construction of a Byzantine agreement protocol with optimal message bit complexity
• Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
• Optimal time Byzantine agreement for \(t<n/8\) with linear-messages
• Synchronous Byzantine agreement with nearly a cubic number of communication bits, synchronous Byzantine agreement with nearly a cubic number of communication bits
• Efficient agreement using fault diagnosis.

zbMATH Keywords

distributed computingByzantine relay protocol

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• The Byzantine generals strike again
• A lower bound for the time to assure interactive consistency
• Easy impossibility proofs for distributed consensus problems
• Consensus algorithms with one-bit messages
• Bounds on information exchange for Byzantine agreement
• Message-optimal protocols for Byzantine Agreement
• Modular construction of a Byzantine agreement protocol with optimal message bit complexity

Cited In (9)

• Synchronous Byzantine agreement with nearly a cubic number of communication bits, synchronous Byzantine agreement with nearly a cubic number of communication bits
• Consensus algorithms with one-bit messages
• On the message complexity of binary Byzantine agreement under crash failures
• A faster P solution for the Byzantine agreement problem
• A flexible formal framework for masking/demasking faults
• Structural Information and Communication Complexity
• Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
• Efficient agreement using fault diagnosis.
• Optimal time Byzantine agreement for \(t<n/8\) with linear-messages

This page was built for publication: Modular construction of an efficient 1-bit Byzantine agreement protocol

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4031323)