Byzantine consensus is \(\Theta(n^2)\): the Dolev-Reischuk bound is tight even in partial synchrony!
From MaRDI portal
Publication:6579852
DOI10.1007/S00446-023-00458-WMaRDI QIDQ6579852
Seth Gilbert, Author name not available (Why is that?), Author name not available (Why is that?), Muhammad Ayaz Dzulfikar, Author name not available (Why is that?), Vincent Gramoli, Rachid Guerraoui
Publication date: 26 July 2024
Published in: Distributed Computing (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
- Asynchronous byzantine agreement protocols
- Thunderella: blockchains with optimistic instant confirmation
- Bootstrapping the blockchain, with applications to consensus and fast PKI setup
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
- Authenticated Algorithms for Byzantine Agreement
- Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time
- PoW-Based Distributed Cryptography with No Trusted Setup
- Bounds on information exchange for Byzantine agreement
- Impossibility of distributed consensus with one faulty process
- The Byzantine Generals Problem
- Dynamic fault-tolerant clock synchronization
- Unreliable failure detectors for reliable distributed systems
- Byzantine Fault Detectors for Solving Consensus
- Communication Complexity of Byzantine Agreement, Revisited
- Asymptotically Optimal Validated Asynchronous Byzantine Agreement
- HotStuff
- Timeliness, failure-detectors, and consensus performance
- The weakest failure detector for solving consensus
- Breaking the O ( n 2 ) bit barrier
- Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, Revisited
- Brief Announcement: Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP
- Reaching consensus for asynchronous distributed key generation
- Revisiting Optimal Resilience of Fast Byzantine Consensus
- Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement
- Making Byzantine consensus live
- Expected linear round synchronization: the missing link for linear Byzantine SMR
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)
