Byzantine agreement in the full-information model in O (log n) rounds

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 179-186

  Ben Or, Michael ^a,d   Pavlov, Elan ^b   Vaikuntanathan, Vinod ^c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d Department of Computer Science ^*  (Israel)

Author keywords

Byzantine Agreement; Full Information Model

Indexed keywords

COMPUTATIONAL METHODS; INFORMATION THEORY; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PROBLEM SOLVING;

BYZANTINE AGREEMENT; FULL-INFORMATION MODEL; ROUND-COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 33748112587     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132543     Document Type: Conference Paper

References (22)

1. Miklós Ajtai and Nathan Linial. The influence of large coalitions. Combinatorica, 13(2):129-145, 1993.
2. Ziv BarJoseph and Michael BenOr. A tight lower bound for randomized synchronous consensus. In PODC, pages 193-199, 1998.
3. Michael BenOr. Another advantage of free choice: Completely asynchronous agreement protocols (extended abstract). In PODC, pages 27-30, 1983.
4. Michael BenOr and Nathan Linial. Collective coin flipping, robust voting schemes and minima of banzhaf values. In FOCS, pages 408-416, 1985.
5. Piotr Berman and Juan A. Garay. Asymptotically optimal distributed consensus (extended abstract). In ICALP, pages 80-94, 1989.
6. Piotr Berman, Juan A. Garay, and Kenneth J. Perry. Optimal early stopping in distributed consensus (extended abstract). In WDAG, pages 221-237, 1992.
7. Gabriel Bracha. An asynchronous [(n-1)/3]-resilient consensus protocol. In PODC, pages 154-162, 1984.
8. Gabriel Bracha. An O(log n) expected rounds randomized byzantine generals protocol. J. ACM, 34(4):910-920, 1987.
9. Benny Chor and Brian A. Coan. A simple and efficient randomized byzantine agreement algorithm. IEEE Trans. Software Eng., 11(6):531-539, 1985.
10. Benny Chor and Cynthia Dwork. Randomization in byzantine agreement. Advances in Computing Research, 5:443-497, 1989.
11. Cynthia Dwork, David B. Shmoys, and Larry J. Stockmeyer. Flipping persuasively in constant time. SI AM J. Comput., 19(3):472-499, 1990.
12. Uriel Feige. Noncryptographic selection protocols. In FOCS, pages 142-153, 1999.
13. Pesech Feldman and Silvio Micali. An optimal probabilistic protocol for synchronous byzantine agreement. SI AM J. Comput, 26(4):873-933, 1997.
14. Michael J. Fischer and Nancy A. Lynch. A lower bound for the time to assure interactive consistency. Inf. Process. Lett, 14(4):183-186, 1982.
15. Juan A. Garay and Yoram Moses. Fully polynomial byzantine agreement for n > 3t processors in t + 1 rounds. SIAM J. Comput., 27(1):247-290, 1998.
16. Oded Goldreich, Shafi Goldwasser, and Nathan Linial. Fault-tolerant computation in the full information model. SIAM J. Comput., 27(2):506-544, 1998.
17. Shafi Goldwasser, Elan Pavlov, and Vinod Vaikuntanathan. Better byzantine agreement protocols in the full-information model. Manuscript, 2006.
18. Jeff Kahn, Gil Kalai, and Nathan Linial. The influence of variables on boolean functions. In Proc. 29-th Annual Symposium on Foundations of Computer Science, pages 68-80, 1988.
19. Anna Karlin and Andrew Chi-Chih Yao. Probabilistic lower bounds for byzantine agreement. Manuscript, 1986.
20. M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM., 27:228-234, 1980.
21. Michael O. Rabin. Randomized byzantine generals. FOCS, pages 403-409, 1983.
22. Alexander Russell and David Zuckerman. Perfect information leader election in log* n + O(1) rounds. J. Comput. Syst. Sci., 63(4):612-626, 2001.