A tight lower bound for randomized synchronous consensus
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
A Protocol to Achieve Independence in Constant Rounds
IEEE Transactions on Parallel and Distributed Systems
Detectable byzantine agreement secure against faulty majorities
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Sequential composition of protocols without simultaneous termination
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Lower Bounds in Distributed Computing
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Secure Computation without Agreement
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Parallel Reducibility for Information-Theoretically Secure Computation
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
On 2-Round Secure Multiparty Computation
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Introduction to Secure Computation
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
Efficient player-optimal protocols for strong and differential consensus
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Randomized protocols for asynchronous consensus
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Cryptography and cryptographic protocols
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
A certificate revocation scheme for wireless ad hoc networks
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
Collaboration of untrusting peers with changing interests
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Fast quantum byzantine agreement
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Resilient-optimal interactive consistency in constant time
Distributed Computing
Byzantine agreement in the full-information model in O(log n) rounds
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Lower bound for scalable Byzantine Agreement
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Secure multi-party computation made simple
Discrete Applied Mathematics - Special issue: Coding and cryptography
Proceedings of the twenty-seventh 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
Improving the Round Complexity of VSS in Point-to-Point Networks
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
On expected constant-round protocols for Byzantine agreement
Journal of Computer and System Sciences
Fault Tolerance in Distributed Mechanism Design
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Improving the round complexity of VSS in point-to-point networks
Information and Computation
Simple and efficient asynchronous byzantine agreement with optimal resilience
Proceedings of the 28th ACM symposium on Principles of distributed computing
Fast scalable deterministic consensus for crash failures
Proceedings of the 28th ACM symposium on Principles of distributed computing
Locally scalable randomized consensus for synchronous crash failures
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Secure multi-party computation made simple
Discrete Applied Mathematics - Special issue: Coding and cryptography
Distributed Pseudo-random functions and KDCs
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Two-threshold broadcast and detectable multi-party computation
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Secure multi-party computation made simple
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Universally-composable two-party computation in two rounds
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
On the number of synchronous rounds sufficient for authenticated byzantine agreement
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Fast asynchronous consensus with optimal resilience
DISC'10 Proceedings of the 24th international conference on Distributed computing
Stabilizing consensus with the power of two choices
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Communication optimal multi-valued asynchronous byzantine agreement with optimal resilience
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Secure message transmission by public discussion: a brief survey
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Perfectly-secure multiplication for any t n/3
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Gate evaluation secret sharing and secure one-round two-party computation
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Constant-round multiparty computation using a black-box pseudorandom generator
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Distributed computing with imperfect randomness
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Secure message transmission with small public discussion
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
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
Scalable secure multiparty computation
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Secure computation with partial message loss
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Accurate byzantine agreement with feedback
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Communications of the ACM
Scalable byzantine agreement with a random beacon
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
| Hi-index | 0.02 |
Broadcasting guarantees the recipient of a message that everyone else has received the same message. This guarantee no longer exists in a setting in which all communication is person-to-person and some of the people involved are untrustworthy: though he may claim to send the same message to everyone, an untrustworthy sender may send different messages to different people. In such a setting, Byzantine agreement offers the "best alternative" to broadcasting. Thus far, however, reaching Byzantine agreement has required either many rounds of communication (i.e., messages had to be sent back and forth a number of times that grew with the size of the network) or the help of some external trusted party.In this paper, for the standard communication model of synchronous networks in which each pair of processors is connected by a private communication line, we exhibit a protocol that, in probabilistic polynomial time and without relying on any external trusted party, reaches Byzantine agreement in an expected constant number of rounds and in the worst natural fault model. In fact, our protocol successfully tolerates that up to 1/3 of the processors in the network may deviate from their prescribed instructions in an arbitrary way, cooperate with each other, and perform arbitrarily long computations.Our protocol effectively demonstrates the power of randomization and zero-knowledge computation against errors. Indeed, it proves that "privacy" (a fundamental ingredient of one of our primitives), even when is not a desired goal in itself (as for the Byzantine agreement problem), can be a crucial tool for achieving correctness.Our protocol also introduces three new primitives---graded broadcast, graded verifiable secret sharing, and oblivious common coin---that are of independent interest, and may be effectively used in more practical protocols than ours.