Fast asynchronous byzantine agreement and leader election with full information

ACM Transactions on Algorithms

Volumn 6, Issue 4, 2010, Pages

  Kapron, Bruce M ^a   Kempe, David ^b   King, Valerie ^a   Saia, Jared ^c   Sanwalani, Vishal ^d  

^a UNIVERSITY OF VICTORIA   (Canada)

^b University of Southern California ^*  (United States)

^c University of New Mexico   (United States)

^d UNIVERSITY OF NEW MEXICO   (United States)

Author keywords

Asynchronous communication; Byzantine agreement; Distributed algorithms; Monte Carlo algorithms; Probabilistic method

Indexed keywords

ASYNCHRONOUS COMMUNICATION; BYZANTINE AGREEMENT; DISTRIBUTED ALGORITHM; MONTE CARLO ALGORITHMS; PROBABILISTIC METHODS;

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS;

MONTE CARLO METHODS;

EID: 77956543874     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1824777.1824788     Document Type: Conference Paper

References (29)

1. AJTAI, M. AND LINIAL, N. 1993. The influence of large coalitions. Combinatorica 13, 2, 129-145.
2. ASPNES, J. 1998. Lower bounds for distributed coin-flipping and randomized consensus. J. ACM 45, 3, 415-150.
3. ATTIYA, H. AND CENSOR, K. 2007. Tight bounds for asynchronous randomized consensus. In Proceedings of the 38th ACM Symposium on Theory of Computing. ACM Press, New York, NY, USA, 155-164.
4. ATTIYA, H. AND CENSOR, K. 2008. Lower bounds for randomized consensus under a weak adversary. In Proceedings of the 27th ACM Symposium on Principles of Distributed Computing. 315-324.
5. BEN-OR, M. 1983. Another advantage of free choice: Completely asynchronous agreement prototols. In Proceedings ofthe 2nd ACM Symposium on Principles ofDistributed Computing. 27-30.
6. BEN-OR, M. AND EL-YANIV, R. 2003. Resilient-Optimal interactive consistency in constant time. Distrib. Comput. 16, 4, 249-262.
7. BEN-OR, M. AND LINIAL, N. 1989. Collective coin flipping. In Advances in Computing Research 5: Randomness and Computation, S. Micali, Ed. JAI Press, 91-115.
8. BEN-OR, M. , PAVLOV, E., AND VAIKUNTANATHAN, V. 2006. Byzantine agreement in the full-information model in o(log n) rounds. In Proceedings of the 37th ACM Symposium on Theory of Computing. 179-186.
9. BERMAN, P. AND GARAY, J. A. 1993. Randomized distributed agreement revisited. In Digest of Papers: FTCS-23, the 23rd Annual International Symposium on Fault-Tolerant Computing. 412-419.
10. BRACHA, G. 1984. An asynchronous [(n - 1)/3]-resilient consensus protocol. In Proceedings of the 3rd ACM Symposium on Principles ofDistributed Computing. 154-162.
11. CACHIN, C., KURSAWE, K., AND SHOUP, V. 2005. Random oracles in constantinople: Practical asynchronous byzantine agreement using cryptography. J. Cryptol. 18, 3, 219-246.
12. CANETTI, R.AND RABIN, T. 1993. Fast asynchronous byzantine agreement with optimal resilience. In Proceedings ofthe 25th ACM Symposium on Theory of Computing. 42-51.
13. CHOR, B. AND DWORK, C. 1989. Randomization in Byzantine agreement. In Advances in Computing Research 5: Randomness and Computation, S. Micali, Ed. JAI Press, 443-497.
14. CHOR, B., MERRITT, M., AND SHMOYS, D. B. 1989. Simple constant-time consensus protocols in realistic failure models. J. ACM 36, 3, 591-614.
15. FEIGE, U. 1999. Noncryptographic selection protocols. In Proceedings of the 40th IEEE Symposium on Foundations ofComputer Science. 142-153.
16. FISCHER, M.J., LYNCH, N.A., AND PATERSON, M. 1983. Impossibility of distributed consensus with one faulty process. In Proceedings ofthe 2nd ACM Symposium on Principles of Database Systems. 1-7.
17. GOLDWASSER, S., PAVLOV, E., AND VAIKUNTANATHAN, V. 2006. Fault-Tolerant distributed computing in full-information networks. In Proceedings of the 47th IEEE Symposium on Foundations of Computer Science. 15-26.
18. GRADWOHL, R., VADHAN, S.P., AND ZUCKERMAN, D. 2006. Random selection with an adversarial majority. In Proceedings of the 26th International Cryptology Conference (CRYPTO). 409-426.
19. KING, V., SAIA, J., SANWALANI, V., AND VEE, E. 2006a. Scalable leader election. In Proceedings of the 17th ACM Symposium on Discrete Algorithms. 990-999.
20. KING, V., SAIA, J., SANWALANI, V., AND VEE, E. 2006b. Towards secure and scalable computation in peer-to-peer networks. In Proceedings of the 47th IEEE Symposium on Foundations of Computer Science. 87-98.
21. MCDIARMID, C. 1998. Concentration. In Probabilistic Methods for Algorithmic Discrete Mathematics, M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed, Eds. Springer, 195-247.
22. NIELSEN, J. B. 2002. A threshold pseudorandom function construction and its applications. In Proceedings of the 22nd International Cryptology Conference (CRYPTO). 401-416.
23. OSTROVSKY, R., RAJAGOPLAN, S., AND VAZIRANI, U. 1994. Simple and efficient leader election in the full information model. In Proceedings of the 26th ACM Symposium on Theory of Computing. 234-242.
24. PEASE, M.C., SHOSTAK, R.E., AND LAMPORT, L. 1980. Reaching agreement in the presence of faults. J. ACM 27, 2, 228-234.
25. RUSSELL, A. AND ZUCKERMAN, D. 1998. Perfect information leader election in log* n + o(1) rounds. In Proceedings of the 39th IEEE Symposium on Foundations of Computer Science. 576-583.
26. SAKS, M. 1989. A robust noncryptographic protocol for collective coin flipping. SIAM J. Discr. Math. 2, 2, 240-244.
27. TOUEG, S. 1984. Randomized byzantine agreements. In Proceedings of the 3rd ACM Symposium on Principles ofDistributed Computing. 163-178.
28. TURPIN, R. AND COAN, B. A. 1984. Extending binary byzantine agreement to multivalued byzantine agreement. Inform. Process. Lett. 18, 2, 73-76.
29. ZUCKERMAN, D. 1997. Randomness-optimal oblivious sampling. Random Struct. Algor. 11, 4, 345-367. (Pubitemid 127345393)