Brief announcement: Communication efficient Asynchronous Byzantine Agreement

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2010, Pages 243-244

  Patra, Arpita ^a   Rangan, C Pandu ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

Asynchronous; Information theoretic security

Indexed keywords

ASYNCHRONOUS; BYZANTINE AGREEMENT; COMMUNICATION COMPLEXITY; INFORMATION-THEORETIC SECURITY; MULTIPARTY COMPUTATION; VERIFIABLE SECRET SHARING;

INFORMATION THEORY;

SECURITY OF DATA;

EID: 77956245092     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1835698.1835756     Document Type: Conference Paper

References (8)

1. I. Abraham, D. Dolev, and J. Y. Halpern. An Almost-surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience. In PODC, pages 405-414, ACM Press, 2008.
2. G. Bracha. An Asynchronous ⌊(n - 1)/3⌋-resilient Consensus Protocol. In PODC, pages 154 - 162, ACM Press, 1984.
3. R. Canetti and T. Rabin. Fast Asynchronous Byzantine Agreement with Optimal Resilience. In STOC, pages 42-51, ACM Press, 1993.
4. P. Feldman and S. Micali. An Optimal Algorithm for Synchronous Byzantine Agreemet. In STOC, pages 639-648, ACM Press, 1988.
5. M. J. Fischer, N. A. Lynch, and M. Paterson. Impossibility of Distributed Consensus with One Faulty Process. JACM, 32(2):374-382, 1985.
6. A. Patra, A. Choudhary, and C. Pandu Rangan. Efficient Asynchronous Byzantine Agreement with Optimal Resilience. Cryptology ePrint Archive, Report 2008/424. Also in PODC, pages 92-101, 2009 .
7. A. Patra, A. Choudhary, and C. Pandu Rangan. Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience. Cryptology ePrint Archive, Report 2010/007. Also in AFRICACRYPT, LNCS 6055, pages 184-202, Springer, 2010.
8. M. Pease, R. E. Shostak, and L. Lamport. Reaching Agreement in the Presence of Faults. JACM, 27(2):228-234, 1980.