Lower bound for scalable Byzantine agreement
From MaRDI portal
Publication:2377258
Recommendations
- Lower bound for scalable Byzantine agreement
- Breaking the \(O(n^2)\) bit barrier, scalable Byzantine agreement with an adaptive adversary
- Breaking the \(O(n^2)\) bit barrier, scalable Byzantine agreement with an adaptive adversary
- From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits
- Byzantine agreement in the full-information model in O( n) rounds
Cites work
- A lower bound for the time to assure interactive consistency
- A tight lower bound for randomized synchronous consensus
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Fault Tolerance in Networks of Bounded Degree
- Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model
- Perfect information leader election in \(\log^*n+O(1)\) rounds
- Scalable leader election
- The Byzantine Generals Problem
Cited in
(8)- Lower bound on the step complexity of anonymous binary consensus
- scientific article; zbMATH DE number 1950667 (Why is no real title available?)
- Breaking the \(O(n^2)\) bit barrier, scalable Byzantine agreement with an adaptive adversary
- Lower bound for scalable Byzantine agreement
- Breaking the \(O(n^2)\) bit barrier, scalable Byzantine agreement with an adaptive adversary
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
- Scalable agreement protocols with optimal optimistic efficiency
- Scalable distributed agreement from LWE: Byzantine agreement, broadcast, and leader election
This page was built for publication: Lower bound for scalable Byzantine agreement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2377258)
