Modular construction of an efficient 1-bit Byzantine agreement protocol
From MaRDI portal
Publication:4031323
DOI10.1007/BF01187076zbMath0766.68005MaRDI 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
68M10: Network design and communication in computer systems
Related Items
Efficient agreement using fault diagnosis., A flexible formal framework for masking/demasking faults, Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
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