Byzantine consensus is (n^2): the Dolev-Reischuk bound is tight even in partial synchrony!
From MaRDI portal
Publication:6579852
Cites work
- scientific article; zbMATH DE number 7774289 (Why is no real title available?)
- Asymptotically Optimal Validated Asynchronous Byzantine Agreement
- Asynchronous byzantine agreement protocols
- Authenticated Algorithms for Byzantine Agreement
- Bootstrapping the blockchain, with applications to consensus and fast PKI setup
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
- Bounds on information exchange for Byzantine agreement
- Breaking the \(O(n^2)\) bit barrier, scalable Byzantine agreement with an adaptive adversary
- Brief Announcement: Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP
- Byzantine Fault Detectors for Solving Consensus
- Communication Complexity of Byzantine Agreement, Revisited
- Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, Revisited
- Dynamic fault-tolerant clock synchronization
- Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement
- Expected linear round synchronization: the missing link for linear Byzantine SMR
- HotStuff
- Impossibility of distributed consensus with one faulty process
- Making Byzantine consensus live
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- Optimal communication complexity of authenticated Byzantine agreement
- PoW-based distributed cryptography with no trusted setup
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- Revisiting Optimal Resilience of Fast Byzantine Consensus
- Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
- Signature-free asynchronous binary Byzantine consensus with \(t<n/3\), \(O(n^2)\) messages, and \(O(1)\) expected time
- The Byzantine Generals Problem
- The weakest failure detector for solving consensus
- Thunderella: blockchains with optimistic instant confirmation
- Timeliness, failure-detectors, and consensus performance
- Unreliable failure detectors for reliable distributed systems
This page was built for publication: Byzantine consensus is \(\Theta(n^2)\): the Dolev-Reischuk bound is tight even in partial synchrony!
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579852)
