Modular construction of an efficient 1-bit Byzantine agreement protocol
From MaRDI portal
Publication:4031323
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.
Cites work
- A lower bound for the time to assure interactive consistency
- Bounds on information exchange for Byzantine agreement
- Consensus algorithms with one-bit messages
- Easy impossibility proofs for distributed consensus problems
- Message-optimal protocols for Byzantine Agreement
- Modular construction of a Byzantine agreement protocol with optimal message bit complexity
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- The Byzantine generals strike again
Cited in
(9)- Efficient agreement using fault diagnosis.
- Synchronous Byzantine agreement with nearly a cubic number of communication bits, synchronous Byzantine agreement with nearly a cubic number of communication bits
- A flexible formal framework for masking/demasking faults
- Optimal time Byzantine agreement for \(t<n/8\) with linear-messages
- Consensus algorithms with one-bit messages
- A faster P solution for the Byzantine agreement problem
- Structural Information and Communication Complexity
- On the message complexity of binary Byzantine agreement under crash failures
- Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
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)
