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
A tight lower bound for randomized synchronous consensus
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Randomness-optimal oblivious sampling
Proceedings of the workshop on Randomized algorithms and computation
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
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
Random selection with an adversarial majority
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Lower bounds for randomized consensus under a weak adversary
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Tight bounds for asynchronous randomized consensus
Journal of the ACM (JACM)
Proceedings of the 28th ACM symposium on Principles of distributed computing
HICCUPS: health information collaborative collection using privacy and security
Proceedings of the first ACM workshop on Security and privacy in medical and home-care systems
From almost everywhere to everywhere: byzantine agreement with Õ(n³/²) bits
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Scalable byzantine computation
ACM SIGACT News
Distributed agreement with optimal communication complexity
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
How efficient can gossip be? (on the cost of resilient information exchange)
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Load balanced scalable Byzantine agreement through quorum building, with full information
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Stabilizing consensus with the power of two choices
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
The contest between simplicity and efficiency in asynchronous byzantine agreement
DISC'11 Proceedings of the 25th international conference on Distributed computing
Lower Bounds for Randomized Consensus under a Weak Adversary
SIAM Journal on Computing
On the complexity of asynchronous agreement against powerful adversaries
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
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 non-adaptive 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 n/6+ε faulty processors, for any positive constant ε. 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 paper is a new approach for emulating Feige's lightest bin protocol, even with adversarial message scheduling.