Synchronous Byzantine agreement with expected O(1) rounds, expected O(n^2) communication, and optimal resilience
From MaRDI portal
Publication:2656912
Recommendations
- On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
- On expected constant-round protocols for Byzantine agreement
- Optimally efficient multi-valued byzantine agreement
- Byzantine agreement in the full-information model in O( n) rounds
- Synchronous Byzantine agreement with nearly a cubic number of communication bits, synchronous Byzantine agreement with nearly a cubic number of communication bits
Cited in
(42)- On expected constant-round protocols for Byzantine agreement
- Sublinear-round Byzantine agreement under corrupt majority
- How Byzantine is a send corruption?
- Making Byzantine consensus live
- On the round complexity of randomized Byzantine agreement
- Round-optimal Byzantine agreement
- Synchronous consensus with optimal asynchronous fallback guarantees
- Communication complexity of Byzantine agreement, revisited
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
- On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
- From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits
- scientific article; zbMATH DE number 1256649 (Why is no real title available?)
- Optimal time Byzantine agreement for \(t<n/8\) with linear-messages
- Resilient-optimal interactive consistency in constant time
- Asymptotically Optimal Validated Asynchronous Byzantine Agreement
- Synchronous Byzantine agreement with nearly a cubic number of communication bits, synchronous Byzantine agreement with nearly a cubic number of communication bits
- On Expected Constant-Round Protocols for Byzantine Agreement
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
- Optimal communication complexity of authenticated Byzantine agreement
- Asymptotically free broadcast in constant expected time via packed VSS
- Expected linear round synchronization: the missing link for linear Byzantine SMR
- Efficient adaptively-secure Byzantine agreement for long messages
- State machine replication under changing network conditions
- \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions
- Permissionless clock synchronization with public setup
- Completeness theorems for adaptively secure broadcast
- Expected linear round synchronization: the missing link for linear Byzantine SMR
- Brief announcement: Byzantine agreement, broadcast and state machine replication with optimal good-case latency
- The unique chain rule and its applications
- Player-replaceability and forensic support are two sides of the same (crypto) coin
- On the round complexity of fully secure solitary MPC with honest majority
- Sublinear message bounds of authenticated implicit Byzantine agreement
- Round efficient Byzantine agreement from VDFs
- \textsf{Juggernaut}: efficient crypto-agnostic Byzantine agreement
- Asymptotically free broadcast in constant expected time via packed VSS
- Expected constant round Byzantine broadcast under dishonest majority
- Nearly-optimal consensus tolerating adaptive omissions: why a lot of randomness is needed?
- All Byzantine agreement problems are expensive
- Efficient agreement over Byzantine gossip
- Optimal Byzantine agreement in the presence of message drops
- Round-optimal Byzantine agreement without trusted setup
- Synchronous distributed key generation without broadcasts
This page was built for publication: Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656912)
