Brief announcement: communication efficient asynchronous byzantine agreement

Authors:
Arpita Patra;C. Pandu Rangan
Affiliations:
IIT Madras, Chennai, India;IIT Madras, Chennai, India
Venue:
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Year:
2010

Citing 8
Cited 2

Optimal algorithms for Byzantine agreement

STOC '88 Proceedings of the twentieth 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)
Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
An asynchronous [(n - 1)/3]-resilient consensus protocol

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Simple and efficient asynchronous byzantine agreement with optimal resilience

Proceedings of the 28th ACM symposium on Principles of distributed computing
Communication efficient perfectly secure VSS and MPC in asynchronous networks with optimal resilience

AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa

Scalable byzantine computation

ACM SIGACT News
Fast byzantine agreement

Proceedings of the 2013 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In [7], the authors presented a novel perfect (i.e error-free Asynchronous Verifiable Secret Sharing (AVSS) protocol and using the AVSS, they designed a perfect Asynchronous Multiparty Computation (AMPC) protocol that provides the best known communication complexity in the literature. In this paper, we show another important application of the AVSS in [7] by applying it to design an efficient Asynchronous Byzantine Agreement (ABA) protocol with n = 4t + 1, where n denotes the number of parties involved in the execution ABA and t denotes the maximum number of parties that can be corrupted by an active unbounded powerful adversary. Our ABA protocol attains a communication complexity that is significantly better than that of the only known existing ABA of [4] with n = 4t + 1, while keeping all other properties in place.