Asymptotically Optimal Validated Asynchronous Byzantine Agreement
From MaRDI portal
Publication:5145231
Recommendations
- Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
- Asynchronous Byzantine agreement with optimal resilience
- Simple and efficient asynchronous Byzantine agreement with optimal resilience
- Communication optimal multi-valued asynchronous Byzantine agreement with optimal resilience
- Optimally efficient multi-valued byzantine agreement
Cited in
(30)- Aggregatable distributed key generation
- Revisiting asynchronous fault tolerant computation with optimal resilience
- ADAPTIVE AND DOUBLY-EXPEDITED ONE-STEP CONSENSUS IN BYZANTINE ASYNCHRONOUS SYSTEMS
- Random oracles in constantipole
- Optimally efficient multi-valued byzantine agreement
- Brief Announcement: Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP
- Jolteon and Ditto: network-adaptive efficient consensus with asynchronous fallback
- Quick order fairness
- scientific article; zbMATH DE number 7774289 (Why is no real title available?)
- Expected linear round synchronization: the missing link for linear Byzantine SMR
- Building blocks of sharding blockchain systems: concepts, approaches, and open problems
- On the Validity of Consensus
- Not a COINcidence: sub-quadratic asynchronous Byzantine agreement WHP
- Expected linear round synchronization: the missing link for linear Byzantine SMR
- Improved extension protocols for Byzantine broadcast and agreement
- Brief announcement: Byzantine agreement, broadcast and state machine replication with optimal good-case latency
- Player-replaceability and forensic support are two sides of the same (crypto) coin
- Proof of availability and retrieval in a modular blockchain architecture
- Byzantine consensus is \(\Theta(n^2)\): the Dolev-Reischuk bound is tight even in partial synchrony!
- Zombies and ghosts: optimal Byzantine agreement in the presence of omission faults
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
- Simplex consensus: a simple and fast consensus protocol
- Adaptively secure BLS threshold signatures from DDH and co-CDH
- Information theoretic HotStuff
- Asymptotically optimal adaptive asynchronous common coin and DKG with silent setup
- Asynchronous agreement on a core set in constant expected time and more efficient asynchronous VSS and MPC
- Swiper: a new paradigm for efficient weighted distributed protocols
- All Byzantine agreement problems are expensive
- DARE to agree: Byzantine agreement with optimal resilience and adaptive communication
- Synchronous distributed key generation without broadcasts
This page was built for publication: Asymptotically Optimal Validated Asynchronous Byzantine Agreement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145231)
