On the complexity of asynchronous agreement against powerful adversaries
From MaRDI portal
Publication:901869
DOI10.1007/s00446-014-0224-5zbMath1347.68030arXiv1301.3223OpenAlexW2029519900MaRDI QIDQ901869
Publication date: 6 January 2016
Published in: Distributed Computing, Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.3223
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Randomized algorithms (68W20) Network protocols (68M12) Distributed algorithms (68W15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Concentration of measure and isoperimetric inequalities in product spaces
- The correctness proof of Ben-Or's randomized consensus algorithm
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- A tight lower bound for randomized synchronous consensus
- Byzantine agreement in the full-information model in O(log n) rounds
- The Contest between Simplicity and Efficiency in Asynchronous Byzantine Agreement
- Lower bounds for distributed coin-flipping and randomized consensus
- Tight bounds for asynchronous randomized consensus
- Scalable leader election
- From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- Breaking the O ( n 2 ) bit barrier
- Fast asynchronous Byzantine agreement with optimal resilience
- Lower Bounds for Randomized Consensus under a Weak Adversary
- Byzantine agreement in polynomial expected time
