On the message complexity of binary Byzantine agreement under crash failures
From MaRDI portal
Recommendations
- Message-optimal protocols for Byzantine Agreement
- Modular construction of an efficient 1-bit Byzantine agreement protocol
- Bounds on information exchange for Byzantine agreement
- Optimally efficient multi-valued byzantine agreement
- Synchronous Byzantine agreement with nearly a cubic number of communication bits, synchronous Byzantine agreement with nearly a cubic number of communication bits
Cites work
- scientific article; zbMATH DE number 3819094 (Why is no real title available?)
- scientific article; zbMATH DE number 4121395 (Why is no real title available?)
- A lower bound for the time to assure interactive consistency
- Authenticated Algorithms for Byzantine Agreement
- Bounds on information exchange for Byzantine agreement
- Knowledge and common knowledge in a Byzantine environment: Crash failures
- Message-optimal protocols for Byzantine Agreement
- Reaching Agreement in the Presence of Faults
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
Cited in
(9)- Robust gossiping with an application to consensus
- Message-optimal protocols for Byzantine Agreement
- Hundreds of impossibility results for distributed computing
- Optimistically tuning synchronous Byzantine consensus: another win for null messages
- Bounds on information exchange for Byzantine agreement
- Are Byzantine failures really different from crash failures?
- The Failure Discovery problem
- Brief Announcement: Improved Consensus in Quantum Networks
- Communication Complexity of Wait-Free Computability in Dynamic Networks
This page was built for publication: On the message complexity of binary Byzantine agreement under crash failures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1189856)
