Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
The round complexity of secure protocols
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Fast asynchronous Byzantine agreement with optimal resilience
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
SIAM Journal on Computing
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Fast asynchronous Byzantine agreement (extended abstract)
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
Collective Coin Tossing Without Assumptions nor Broadcasting
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
An asynchronous [(n - 1)/3]-resilient consensus protocol
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Efficient player-optimal protocols for strong and differential consensus
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Simultaneous broadcast revisited
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Round-Efficient Secure Computation in Point-to-Point Networks
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
On expected constant-round protocols for Byzantine agreement
Journal of Computer and System Sciences
Fast asynchronous Byzantine agreement and leader election with full information
ACM Transactions on Algorithms (TALG)
Universally composable simultaneous broadcast
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
On expected constant-round protocols for byzantine agreement
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
| Hi-index | 0.00 |
For a complete network of n processors within which communication lines are private, we show how to achieve concurrently many Byzantine Agreements within constant expected time both on synchronous and asynchronous networks. As an immediate consequence, this provides a solution to the Interactive Consistency problem. Our algorithms tolerate up to (n - 1)/3 faulty processors in both the synchronous and asynchronous cases and are therefore resilient-optimal.In terms of time complexity, our results improve a time bound of O(log n) (for n concurrent agreements) which is immediately implied by the constant expected time Byzantine Agreement of Feldman and Micali (synchronous systems) and of Canetti and Rabin (asynchronous systems). In terms of resiliency, our results improve the resiliency bound of the constant time, O(4√n)-resilient algorithm of Ben-Or.An immediate application of our protocols is a constant expected time simulation of simultaneous broadcast channels over a network with private lines.