Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Optimal algorithms for Byzantine agreement
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first 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
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
SIAM Journal on Computing
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
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
On expected constant-round protocols for byzantine agreement
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Simple and efficient asynchronous byzantine agreement with optimal resilience
Proceedings of the 28th ACM symposium on Principles of distributed computing
Brief announcement: communication efficient asynchronous byzantine agreement
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Efficient statistical asynchronous verifiable secret sharing with optimal resilience
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
Fast asynchronous consensus with optimal resilience
DISC'10 Proceedings of the 24th international conference on Distributed computing
Secure message transmission in asynchronous networks
Journal of Parallel and Distributed Computing
Communication optimal multi-valued asynchronous byzantine agreement with optimal resilience
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Error-free multi-valued broadcast and byzantine agreement with optimal communication complexity
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Asynchronous computational VSS with reduced communication complexity
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
Hi-index | 0.00 |
Consider an asynchronous system with private channels and n processes, up to t of which may be faulty. We settle a longstanding open question by providing a Byzantine agreement protocol that simultaneously achieves three properties: (optimal) resilience: it works as long as n3t;(almost-sure) termination: with probability one, all nonfaulty processes terminate;(polynomial) efficiency: the expected computation time, memory consumption, message size, and number of messages sent are all polynomial in n. Earlier protocols have achieved only two of these three properties. In particular, the protocol of Bracha is not polynomially efficient, the protocol of Feldman and Micali is not optimally resilient, and the protocol of Canetti and Rabin does not have almost-sure termination. Our protocol utilizes a new primitive called shunning (asynchronous) verifiable secret sharing (SVSS), which ensures, roughly speaking, that either a secret is successfully shared or a new faulty process is ignored from this point onwards by some nonfaulty process.