Byzantine Agreement in Expected Polynomial Time
From MaRDI portal
Publication:3177770
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
Cited in
(14)- On the round complexity of randomized Byzantine agreement
- On the round complexity of randomized Byzantine agreement
- From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits
- Byzantine agreement in polynomial expected time (extended abstract)
- Flipping Persuasively in Constant Time
- Fault-tolerant graph realizations in the congested clique
- Expected constant round Byzantine broadcast under dishonest majority
- Algorand: a secure and efficient distributed ledger
- Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems
- Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
- A characterization of eventual Byzantine agreement
- Byzantine preferential voting
- Quantum Byzantine agreement with tripartite entangled states
- Faster agreement via a spectral method for detecting malicious behavior
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)
