An O(lg n) expected rounds randomized Byzantine generals protocol
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A tight lower bound for randomized synchronous consensus
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Noncryptographic Selection Protocols
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Polynomial algorithms for multiple processor agreement
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
An asynchronous [(n - 1)/3]-resilient consensus protocol
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Byzantine agreement in the full-information model in O(log n) rounds
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Fault-Tolerant Distributed Computing in Full-Information Networks
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Towards Secure and Scalable Computation in Peer-to-Peer Networks
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Fast asynchronous byzantine agreement and leader election with full information
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for randomized consensus under a weak adversary
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
From almost everywhere to everywhere: byzantine agreement with Õ(n³/²) bits
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Fast asynchronous Byzantine agreement and leader election with full information
ACM Transactions on Algorithms (TALG)
Breaking the O(n2) bit barrier: scalable byzantine agreement with an adaptive adversary
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Byzantine agreement in polynomial expected time: [extended abstract]
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
In the wake of the decisive impossibility result of Fischer, Lynch, and Paterson for deterministic consensus protocols in the aynchronous model with just one failure, Ben-Or and Bracha demonstrated that the problem could be solved with randomness, even for Byzantine failures. Both protocols are natural and intuitive to verify, and Bracha's achieves optimal resilience. However, the expected running time of these protocols is exponential in general. Recently, Kapron, Kempe, King, Saia, and Sanwalani presented the first efficient Byzantine agreement algorithm in the asynchronous, full information model, running in polylogarithmic time. Their algorithm is Monte Carlo and drastically departs from the simple structure of Ben-Or and Bracha's Las Vegas algorithms. In this paper, we begin an investigation of the question: to what extent is this departure necessary? Might there be a much simpler and intuitive Las Vegas protocol that runs in expected polynomial time? We will show that the exponential running time of Ben-Or and Bracha's algorithms is no mere accident of their specific details, but rather an unavoidable consequence of their general symmetry and round structure. We view our result as a step toward identifying the level of complexity required for a polynomial-time algorithm in this setting, and also as a guide in the search for new efficient algorithms.