Sublinear-round Byzantine agreement under corrupt majority
From MaRDI portal
Publication:2055693
DOI10.1007/978-3-030-45388-6_9zbMath1482.94044OpenAlexW3022867264MaRDI QIDQ2055693
T.-H. Hubert Chan, Elaine Shi, Rafael Pass
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45388-6_9
Related Items (7)
Round-optimal Byzantine agreement ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Gossiping for communication-efficient broadcast ⋮ Efficient adaptively-secure Byzantine agreement for long messages ⋮ Completeness theorems for adaptively secure broadcast ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ Sublinear-round Byzantine agreement under corrupt majority
Cites Work
- Unnamed Item
- On expected constant-round protocols for Byzantine agreement
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- Sublinear-round Byzantine agreement under corrupt majority
- Algorand: a secure and efficient distributed ledger
- Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
- Probabilistic Termination and Composability of Cryptographic Protocols
- Adaptively secure broadcast, revisited
- Authenticated Algorithms for Byzantine Agreement
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Adaptively Secure Broadcast
- Scalable leader election
- 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
- Communication Complexity of Byzantine Agreement, Revisited
- Fast byzantine agreement
- Breaking the O ( n 2 ) bit barrier
- New Techniques for Noninteractive Zero-Knowledge
This page was built for publication: Sublinear-round Byzantine agreement under corrupt majority
