An almost-surely terminating polynomial protocol for asynchronous Byzantine agreement with optimal resilience

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2008, Pages 405-414

  Abraham, Ittai ^a   Dolev, Danny ^a   Halpern, Joseph Y ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b Department of Molecular Biology and Genetics

Author keywords

Byzantine agreement; Distributed computing; Secret sharing

Indexed keywords

POLYNOMIALS;

ASYNCHRONOUS SYSTEM; BYZANTINE AGREEMENT; MEMORY CONSUMPTION; NON-FAULTY PROCESS; OPTIMAL RESILIENCE; PRIVATE CHANNELS; SECRET SHARING; VERIFIABLE SECRET SHARING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 57549095453     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1400751.1400804     Document Type: Conference Paper

References (14)

1. M. Ben-Or. Another advantage of free choice (extended abstract): Completely asynchronous agreement protocols. In Proc. 2nd ACM Symposium on Principles of Distributed Computing, pages 27-30, 1983.
2. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. 20th ACM Symp. Theory of Computing, pages 1-10, 1988.
3. G. Bracha. An asynchronous [(n - 1)/3]-resilient consensus protocol. In Proc. 3rd ACM Symp. Principles of Distributed Computing, pages 154-162, 1984.
4. R. Canetti and T. Rabin. Fast asynchronous Byzantine agreement with optimal resilience. In Proc. 25th ACM Symp. Theory of Computing, pages 42-51, 1993.
5. R. Canetti and T. Rabin. Fast asynchronous Byzantine agreement with optimal resilience, 1993. http://people.csail.mit.edu/canetti/materials/cr93.ps.
6. R. Canetti. Studies in secure multiparty computation and applications, 1996. http://people.csail.mit.edu/canetti/materials/thesis.ps.
7. T. D. Chandra, V. Hadzilacos, and S. Toueg. The weakest failure detector for solving consensus. Journal of the ACM, 43:685-722, 1996.
8. D. Dolev. The Byzantine generals strike again. Journal of Algorithms, 3:14-30, 1982.
9. P. Feldman and S. Micali. Optimal algorithms for Byzantine agreement. In Proc. 20th ACM Symp. Theory of Computing, pages 148-161, 1988.
10. P. Feldman and S. Micali. An optimal probabilistic protocol for synchronous Byzantine agreement. SIAM J. Comput., 26(4):873-933, 1997.
11. M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty processor. Journal of the ACM, 32(2):374-382, 1985.
12. J. Katz and C.-Y. Koo. On expected constant-round protocols for Byzantine agreement. In Cynthia Dwork, editor, CRYPTO, volume 4117 of Lecture Notes in Computer Science, pages 445-462. Springer, 2006.
13. M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. J. of the ACM, 27(2):228-234, 1980.
14. T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proc. 21st ACM Symp. Theory of Computing, pages 73-85, 1989.