Completeness theorems for non-cryptographic fault-tolerant distributed computation
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)
An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
SIAM Journal on Computing
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The round complexity of verifiable secret sharing and secure multicast
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Distributed Algorithms
An asynchronous [(n - 1)/3]-resilient consensus protocol
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Efficient multiparty computations secure against an adaptive adversary
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Round-Optimal and efficient verifiable secret sharing
TCC'06 Proceedings of the Third conference on Theory of Cryptography
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
Communication efficient statistical asynchronous multiparty computation with optimal resilience
Inscrypt'09 Proceedings of the 5th international conference on Information security and cryptology
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
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Computational verifiable secret sharing revisited
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Brief announcement: efficient optimally resilient statistical AVSS and its applications
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
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 a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power actively controls at most t = ([n/3] − 1) out of n parties in Byzantine fashion. In this setting, we say that π is a t-resilient, (1 − ε)-terminating Asynchronous Byzantine Agreement (ABA) protocol, if π satisfies all the properties of Byzantine Agreement (BA) in asynchronous settings tolerating At and terminates (i.e every honest party terminates π with probability at least (1 − ε). In this work, we present a new t-resilient, (1 − ε)-terminating ABA protocol which privately communicates O(Cn6 κ) bits and A-casts1 O(Cn6 κ) bits, where ε = 2−Ω(κ) and C is the expected running time of the protocol. Moreover, conditioned on the event that our ABA protocol terminates, it does so in constant expected time; i.e., C = O(1). Our ABA protocol is to be compared with the only known t-resilient, (1 − ε)-terminating ABA protocol of [5] in the same settings, which privately communicates O(Cn11 κ4) bits and A-casts O(Cn11 κ2 log(n)) bits, where ε = 2−Ω(κ) and C = O(1). So our ABA achieves a huge gain in communication complexity in comparison to the ABA of [5], while keeping all other properties in place. In another landmark work, in PODC 2008, Abraham et. al [1] proposed a t-resilient, 1-terminating (called as almost-surely terminating in [1]) ABA protocol which privately communicates O(Cn6 log n) bits and A-casts O(Cn6 log n) bits. But ABA protocol of Abraham et. al. takes polynomial (C = O(n2)) expected time to terminate. Hence the merits of our ABA protocol over the ABA of Abraham et. al. are: (i) For any κ n2 log n, our ABA is better in terms of communication complexity (ii) conditioned on the event that our ABA protocol terminates, it does so in constant expected time (the constant is independent of n, t and κ), whereas ABA of Abraham et. al. takes polynomial expected time. Summing up, in a practical scenario where a faster and communication efficient ABA protocol is required, our ABA fits the bill better than ABA protocols of [5, 1]. For designing our ABA protocol, we present a novel and simple asynchronous verifiable secret sharing (AVSS) protocol which significantly improves the communication complexity of the only known AVSS protocol of [5] in the same settings. We believe that our AVSS can be used in many other applications for improving communication complexity and hence is of independent interest.