Byzantine Agreement in Expected Polynomial Time
From MaRDI portal
Publication:3177770
DOI10.1145/2837019zbMATH Open1426.68024OpenAlexW2311002194MaRDI QIDQ3177770FDOQ3177770
Publication date: 2 August 2018
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2837019
Recommendations
- Byzantine agreement in polynomial expected time (extended abstract)
- Byzantine agreement in polynomial time with near-optimal resilience
- Byzantine agreement with optimal early stopping, optimal resilience and polynomial complexity
- Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
- On expected constant-round protocols for Byzantine agreement
- On Expected Constant-Round Protocols for Byzantine Agreement
- On Optimal Probabilistic Asynchronous Byzantine Agreement
- Byzantine approximate agreement on graphs
- On the round complexity of randomized Byzantine agreement
Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Distributed systems (68M14)
Cited In (12)
- Quantum Byzantine agreement with tripartite entangled states
- Flipping Persuasively in Constant Time
- From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits
- On the round complexity of randomized Byzantine agreement
- Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
- A characterization of eventual Byzantine agreement
- Expected constant round Byzantine broadcast under dishonest majority
- Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems
- On the round complexity of randomized Byzantine agreement
- Algorand: a secure and efficient distributed ledger
- Byzantine preferential voting
- Fault-tolerant graph realizations in the congested clique
This page was built for publication: Byzantine Agreement in Expected Polynomial Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177770)
