论文信息 - Brief announcement: communication efficient asynchronous byzantine agreement

Brief announcement: communication efficient asynchronous byzantine agreement

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.

C. Pandu Rangan | Arpita Patra

[1] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[2] Ran Canetti,et al. Fast asynchronous Byzantine agreement with optimal resilience , 1993, STOC.

[3] Silvio Micali,et al. An Optimal Algorithm for Synchronous Byzantine Agreement , 1997 .

[4] Danny Dolev,et al. An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience , 2008, PODC '08.

[5] Gabriel Bracha,et al. An asynchronous [(n - 1)/3]-resilient consensus protocol , 1984, PODC '84.

[6] Silvio Micali,et al. Optimal algorithms for Byzantine agreement , 1988, STOC '88.

[7] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1985, JACM.

[8] C. Pandu Rangan,et al. Simple and efficient asynchronous byzantine agreement with optimal resilience , 2009, PODC '09.

[9] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.

[10] C. Pandu Rangan,et al. Efficient Asynchronous Byzantine Agreement with Optimal Resilience , 2008, IACR Cryptol. ePrint Arch..

[11] C. Pandu Rangan,et al. Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience , 2010, AFRICACRYPT.