Fast asynchronous Byzantine agreement and leader election with full information

Authors:
Bruce M. Kapron;David Kempe;Valerie King;Jared Saia;Vishal Sanwalani
Affiliations:
University of Victoria, BC, Canada;University of Southern California, Los Angeles, CA;University of Victoria, BC, Canada;University of New Mexico, Albuquerque, NM;University of New Mexico, Albuquerque, NM
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2010

Citing 22
Cited 7

A robust noncrytographic protocol for collective coin flipping

SIAM Journal on Discrete Mathematics
Simple constant-time consensus protocols in realistic failure models

Journal of the ACM (JACM)
Fast asynchronous Byzantine agreement with optimal resilience

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Simple and efficient leader election in the full information model

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Lower bounds for distributed coin-flipping and randomized consensus

Journal of the ACM (JACM)
Randomness-optimal oblivious sampling

Proceedings of the workshop on Randomized algorithms and computation
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
A Threshold Pseudorandom Function Construction and Its Applications

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Perfect Information Leader Election in log^* n + O(1) Rounds

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Noncryptographic Selection Protocols

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
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
Randomized Byzantine Agreements

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Resilient-optimal interactive consistency in constant time

Distributed Computing
Scalable leader election

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
Tight bounds for asynchronous randomized consensus

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Lower bounds for randomized consensus under a weak adversary

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Random selection with an adversarial majority

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology

Breaking the O(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary

Journal of the ACM (JACM)
The contest between simplicity and efficiency in asynchronous byzantine agreement

DISC'11 Proceedings of the 25th international conference on Distributed computing
Towards robust and efficient computation in dynamic peer-to-peer networks

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On the complexity of asynchronous agreement against powerful adversaries

Proceedings of the 2013 ACM symposium on Principles of distributed computing
Fast byzantine agreement in dynamic networks

Proceedings of the 2013 ACM symposium on Principles of distributed computing
Storage and search in dynamic peer-to-peer networks

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Byzantine agreement in polynomial expected time: [extended abstract]

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full information model with a nonadaptive malicious adversary. All past protocols for asynchronous Byzantine agreement had been exponential, and no protocol for asynchronous leader election had been known. Our protocols tolerate up to (1/3 − &epsis;) ⋅ n faulty processors, for any positive constant &epsis;. They are Monte Carlo, succeeding with probability 1 − o(1) for Byzantine agreement, and constant probability for leader election. A key technical contribution of our article is a new approach for emulating Feige's lightest bin protocol, even with adversarial message scheduling.