Sublinear-round Byzantine agreement under corrupt majority
From MaRDI portal
Publication:2055693
DOI10.1007/978-3-030-45388-6_9zbMATH Open1482.94044OpenAlexW3022867264MaRDI QIDQ2055693FDOQ2055693
Authors: T.-H. Hubert Chan, Rafael Pass, Elaine Shi 
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45388-6_9
Recommendations
Cites Work
- Authenticated Algorithms for Byzantine Agreement
- The Byzantine Generals Problem
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- On expected constant-round protocols for Byzantine agreement
- New Techniques for Noninteractive Zero-Knowledge
- Simple constant-time consensus protocols in realistic failure models
- Adaptively secure broadcast, revisited
- Scalable leader election
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- Fast byzantine agreement
- Probabilistic Termination and Composability of Cryptographic Protocols
- Adaptively secure broadcast
- On the round complexity of randomized Byzantine agreement
- 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
- Fast asynchronous Byzantine agreement and leader election with full information
- On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
- Communication Complexity of Byzantine Agreement, Revisited
- Breaking the O ( n 2 ) bit barrier
Cited In (12)
- Efficient adaptively-secure Byzantine agreement for long messages
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
- Expected constant round Byzantine broadcast under dishonest majority
- Completeness theorems for adaptively secure broadcast
- Network-agnostic security comes (almost) for free in DKG and MPC
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
- Sublinear-round Byzantine agreement under corrupt majority
- Early stopping for any number of corruptions
- Round-optimal Byzantine agreement
- Title not available (Why is that?)
- Efficient Byzantine Agreement with Faulty Minority
- Gossiping for communication-efficient broadcast
This page was built for publication: Sublinear-round Byzantine agreement under corrupt majority
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2055693)
