On the round complexity of randomized Byzantine agreement
From MaRDI portal
Publication:2121502
DOI10.1007/s00145-022-09421-7zbMath1489.94092arXiv1907.11329OpenAlexW4214936143MaRDI QIDQ2121502
Alex Samorodnitsky, Matan Orland, Iftach Haitner, Nikolaos Makriyannis, Ran Cohen
Publication date: 4 April 2022
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.11329
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of asynchronous agreement against powerful adversaries
- Easy impossibility proofs for distributed consensus problems
- A lower bound for the time to assure interactive consistency
- Boolean functions with low average sensitivity depend on few coordinates
- Thunderella: blockchains with optimistic instant confirmation
- On reverse hypercontractivity
- Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality
- Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
- A tight lower bound for randomized synchronous consensus
- Verifiable Random Functions from Standard Assumptions
- Probabilistic Termination and Composability of Cryptographic Protocols
- Byzantine agreement in the full-information model in O(log n) rounds
- Efficient player-optimal protocols for strong and differential consensus
- Authenticated Algorithms for Byzantine Agreement
- The Contest between Simplicity and Efficiency in Asynchronous Byzantine Agreement
- Adaptively Secure Coin-Flipping, Revisited
- Tight bounds for asynchronous randomized consensus
- On the composition of authenticated Byzantine Agreement
- Automatically increasing the fault-tolerance of distributed algorithms
- Early stopping in Byzantine agreement
- On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Simple constant-time consensus protocols in realistic failure models
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Fault-tolerant Computation in the Full Information Model
- Unconditional Byzantine agreement for any number of faulty processors
- Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols
- Communication Complexity of Byzantine Agreement, Revisited
- Analysis of Boolean Functions
- Fully polynomial Byzantine agreement in t + 1 rounds
- Lower Bounds for Randomized Consensus under a Weak Adversary
- New Techniques for Noninteractive Zero-Knowledge
- Byzantine agreement in polynomial expected time
- On Expected Constant-Round Protocols for Byzantine Agreement
