Sublinear-round Byzantine agreement under corrupt majority
From MaRDI portal
Publication:2055693
Recommendations
Cites work
- Adaptively secure broadcast
- Adaptively secure broadcast, revisited
- Algorand: a secure and efficient distributed ledger
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Authenticated Algorithms for Byzantine Agreement
- Breaking the \(O(n^2)\) bit barrier, scalable Byzantine agreement with an adaptive adversary
- Communication Complexity of Byzantine Agreement, Revisited
- Fast Byzantine agreement
- Fast asynchronous Byzantine agreement and leader election with full information
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- New techniques for noninteractive zero-knowledge
- On expected constant-round protocols for Byzantine agreement
- On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
- On the round complexity of randomized Byzantine agreement
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- Probabilistic Termination and Composability of Cryptographic Protocols
- Scalable leader election
- Simple constant-time consensus protocols in realistic failure models
- Sublinear-round Byzantine agreement under corrupt majority
- Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
- The Byzantine Generals Problem
Cited in
(21)- Efficient adaptively-secure Byzantine agreement for long messages
- All Byzantine agreement problems are expensive
- DARE to agree: Byzantine agreement with optimal resilience and adaptive communication
- Communication lower bounds for cryptographic broadcast protocols
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
- Zombies and ghosts: optimal Byzantine agreement in the presence of omission faults
- 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
- Nearly optimal parallel broadcast in the plain public key model
- Round-optimal Byzantine agreement
- Early stopping for any number of corruptions
- Sublinear message bounds of authenticated implicit Byzantine agreement
- scientific article; zbMATH DE number 176512 (Why is no real title available?)
- Byzantine agreement in the full-information model in O( n) rounds
- Expected constant round Byzantine broadcast under dishonest majority
- Efficient Byzantine Agreement with Faulty Minority
- Gossiping for communication-efficient broadcast
- How Byzantine is a send corruption?
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)
