Fast asynchronous Byzantine agreement and leader election with full information

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 1038-1047

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

^a UNIVERSITY OF VICTORIA   (Canada)

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

^c University of New Mexico   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BYZANTINE AGREEMENT (BA); INFORMATION MODELLING; LEADER ELECTION; MESSAGE SCHEDULING; MONTE CARLO (MC); NEW APPROACHES; OPEN PROBLEMS; POSITIVE CONSTANTS;

EID: 57949113684     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. Miklós Ajtai and Nathan Linial. The influence of large coalitions. Combinatorica, 13(2):129-145, 1993.
2. Hagit Attiya. Personal communication, 2007.
3. Ziv Bar-Joseph and Michael Ben-Or. A tight lower bound for randomized synchronous consensus. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 193199, 1998.
4. Michael Ben-Or. Another advantage of free choice: Completely asynchronous agreement prototols. In Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 27-30, 1983.
5. Michael Ben-Or and Nathan Linial. Collective coin flipping. In Silvio Micali, editor, Advances in Computing Research 5: Randomness and Computation, pages 91-115. JAI Press, 1989.
6. Michael Ben-Or, Elan Pavlov, and Vinod Vaikuntanathan. Byzantine agreement in the full-information model in 0(log n) rounds. In Proceedings of the 38th Annual ACM Symposium on Theory of Computin (STOC), pages 179-186, 2006.
7. Piotr Berman and Juan A. Garay. Randomized distributed agreement revisited. In Digest of Papers: FTCS-23, The 23rd Annual International Symposium on Fault-Tolerant Computing, pages 412-419, 1993.
8. Gabriel Bracha. An asynchronous [(n - l)/3]-resilient consensus protocol. In Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 154-162, 1984.
9. Christian Cachin, Klaus Kursawe, and Victor Shoup. Random oracles in Constantinople: Practical asynchronous byzantine agreement using cryptography. J. Cryptology, 18(3):219-246, 2005.
10. Ran Canetti and Tal Rabin. Fast asynchronous byzantine agreement with optimal resilience. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC), pages 42-51, 1993.
11. Benny Chor and Cynthia Dwork. Randomization in Byzantine agreement. In Silvio Micali, editor, Advances in Computing Research 5: Randomness and Computation, pages 443-497. JAI Press, 1989.
12. Benny Chor, Michael Merritt, and David B. Shmoys. Simple constant-time consensus protocols in realistic failure models. J. ACM, 36(3):591-614, 1989.
13. Uriel Feige. Noncryptographic selection protocols. In Proceedings of 40th IEEE Symposium on Foundations of Computer Science (FOCS), pages 142-153, 1999.
14. Michael J. Fischer, Nancy A. Lynch, and Mike Paterson. Impossibility of distributed consensus with one faulty process. In Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database System (PODS), pages 1-7, 1983.
15. Shafi Goldwasser, Elan Pavlov, and Vinod Vaikuntanathan. Fault-tolerant distributed computing in fullinformation networks. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 15-26, 2006.
16. Ronen Gradwohl, Salil P. Vadhan, and David Zuckerman. Random selection with an adversarial majority. In Advances in Cryptology - CRYPTO 2006, 26th Annual International Cryptology Conference, volume 4117 of Lecture Notes in Computer Science, pages 409-426. Springer, 2006.
17. Valerie King, Jared Saia, Vishal Sanwalani, and Erik Vee. Scalable leader election. In Proceedings of 27th A CM-SI AM Symposium on Discrete Algorithms(SODA), pages 990-999, 2006.
18. Valerie King, Jared Saia, Vishal Sanwalani, and Erik Vee. Towards secure and scalable computation in peerto-peer networks. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 87-98, 2006.
19. Jesper Buus Nielsen. A threshold pseudorandom function construction and its applications. In Advances in Cryptology - CRYPTO 2002, 22nd Annual International Cryptology Conference, Santa Barbara, California, USA, August 18-22, 2002, Proceedings, volume 2442 of Lecture Notes in Computer Science, pages 401-416. Springer, 2002.
20. R. Ostrovsky, S. Rajagoplan, and U. Vazirani. Simple and efficient leader election in the full information model. In Proceedings of the Twenty-Sixth Annual ACM Syposium on Theory of Computing (STOC), pages 234-242, 1994.
21. *n + O(1) rounds. In Proceedings of 39th Annual Symposium on Foundations of Computer Science(FOCS), 1998.
22. Michael Saks. A robust noncryptographic protocol for collective coin flipping. SIAM Journal of Discrete Mathematics, pages 240-244, 1989.
23. Sam Toueg. Randomized byzantine agreements. In Proceedings of the Third Annual ACM Symposium on Princiles of Distributed Computing (PODC), pages 163-178, 1984.
24. David Zuckerman. Randomness-optimal oblivious sampling. Random Struct. Algorithms, 11 (4)-.345-367, 1997.
25. David Zuckerman. Personal communication, 2006.