Round-optimal Byzantine agreement
From MaRDI portal
Publication:2169994
DOI10.1007/978-3-031-06944-4_4zbMath1497.94091OpenAlexW4285227787MaRDI QIDQ2169994
Chen-Da Liu-Zhang, Vipul Goyal, Diana Ghinea
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-06944-4_4
Related Items (2)
Cites Work
- Sublinear-round Byzantine agreement under corrupt majority
- Expected constant round Byzantine broadcast under dishonest majority
- Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions
- On the round complexity of randomized Byzantine agreement
- Algorand: a secure and efficient distributed ledger
- Byzantine agreement given partial broadcast
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
- Probabilistic Termination and Composability of Cryptographic Protocols
- Born and raised distributively
- Efficient player-optimal protocols for strong and differential consensus
- Authenticated Algorithms for Byzantine Agreement
- On the composition of authenticated Byzantine Agreement
- On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
- Simple constant-time consensus protocols in realistic failure models
- The Byzantine Generals Problem
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols
- Lower Bounds for Randomized Consensus under a Weak Adversary
- On Expected Constant-Round Protocols for Byzantine Agreement
This page was built for publication: Round-optimal Byzantine agreement
