Fault-tolerant distributed computing in full-information networks

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 15-26

  Goldwasser, Shaft ^a   Pavlov, Elan ^b   Vaikuntanathan, Vinod ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FAULT TOLERANCE; INFORMATION SYSTEMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PROBLEM SOLVING;

BYZANTINE AGREEMENT (BA); FULL-INFORMATION MODEL; RANDOM-SELECTION PROTOCOLS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 38749153587     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.30     Document Type: Conference Paper

References (28)

1. Miklós Ajtai and Nathan Linial. The influence of large coalitions. Combinatorica, 13(2):129-145, 1993.
2. Michael Ben-Or. Another advantage of free choice: Completely asynchronous agreement protocols (extended abstract). In PODC, pages 27-30, 1983.
3. Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In STOC, pages 1-10, 1988.
4. Michael Ben-Or and Nathan Linial. Collective coin flipping, robust voting schemes and minima of banzhaf values. In FOCS, pages 408-416, 1985.
5. Michael Ben-Or, Elan Pavlov, and Vinod Vaikuntanathan. Byzantine agreement in the full-information model in O(log n) rounds. In STOC, 2006.
6. Manuel Blum. Coin flipping by telephone. In CRYPTO, pages 11-15, 1981.
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. 5:443-497, 1989.
11. Benny Chor, Michael Merritt, and David B. Shmoys. Simple constanttime consensus protocols in realistic failure models. J. ACM, 36(3):591-614, 1989.
12. Benny Chor and Michael O. Rabin. Achieving independence in logarithmic number of rounds. In PODC, pages 260-268, 1987.
13. Cynthia Dwork, David B. Shmoys, and Larry J. Stockmeyer. Flipping persuasively in constant time. SIAM J. Comput., 19(3):472-499, 1990.
14. Uriel Feige. Noncryptographic selection protocols. In FOCS, pages 142-153, 1999.
15. Pesech Feldman and Silvio Micali. An optimal probabilistic protocol for synchronous byzantine agreement. SIAM J. Comput., 26(4):873-933, 1997.
16. 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.
17. Oded Goldreich, Shafi Goldwasser, and Nathan Linial. Fault-tolerant computation in the full information model. SIAM J. Comput., 27(2):506-544, 1998.
18. Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In STOC, pages 218-229, 1987.
19. Shafi Goldwasser and Silvio Micali. Probabilistic encryption and how to play mental poker keeping secret all partial information. In STOC, pages 365-377, 1982.
20. Ronen Gradwohl, Salil Vadhan, and David Zuckerman. Random selection with an adversarial majority. ECCC Report TR06-026, 2006.
21. Vassos Hadzilacos. Byzantine agreement under restricted types of failures. Technical Report 18-83, Department of Computer Science, Harvard University, 1983.
22. Anna Karlin and Andrew Chi-Chih Yao. Probabilistic lower bounds for byzantine agreement. Manuscript, 1986.
23. Jonathan Katz and Chiu-Yuen Koo. On expected constant-round protocols for byzantine agreement. ECCC Report TR06-028, 2006.
24. Gil Neiger and Sam Toueg. Automatically increasing the fault-tolerance of distributed algorithms. J. Algorithms, 11(3):374-419, 1990.
25. M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM., 27:228-234, 1980.
26. Michael O. Rabin. Randomized byzantine generals. FOCS, pages 403-409, 1983.
27. Alexander Russell and David Zuckerman. Perfect information leader election in log* n + O(1) rounds. JCSS, 63(4):612-626, 2001.
28. M. Santha and U. V. Vazirani. Generating quasi-random sequences from slightly-random sources. In FOCS, pages 434-440, Singer Island, 1984.