Byzantine agreement in polynomial expected time

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2013, Pages 401-410

  King, Valerie ^a   Saia, Jared ^b  

^a UNIVERSITY OF VICTORIA   (Canada)

^b University of New Mexico   (United States)

Author keywords

Byzantine agreement; Consensus; Distributed computing; Randomized algorithms

Indexed keywords

BYZANTINE AGREEMENT; CONSENSUS; EXPECTED TIME; FULL INFORMATIONS; RANDOMIZED ALGORITHMS; RUNNING TIME;

COMMUNICATION; COMPUTATION THEORY; DISTRIBUTED COMPUTER SYSTEMS; MESSAGE PASSING;

ALGORITHMS;

EID: 84879805064     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2488608.2488658     Document Type: Conference Paper

References (20)

1. J. Aspnes. Lower bounds for distributed coin-flipping and randomized consensus. Journal of the ACM, 45(3):415-450, 1998.
2. J. Aspnes. Randomized protocols for asynchronous consensus. Journal of Distributed Computing, 16:165-175, 2003.
3. J. Aspnes and M. Herlihy. Fast randomized consensus using shared memory. Journal of Algorithms, 11(3):441-461, 1990.
4. H. Attiya and K. Censor. Lower bounds for randomized consensus under a weak adversary. In Principles of Distributed Computing (PODC), pages 315-324, 2008.
5. H. Attiya and K. Censor. Tight bounds for asynchronous randomized consensus. Journal of the ACM, 55(5), 2008.
6. H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics (2nd edition), page 14. John Wiley Interscience, March 2004.
7. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In ACM Conference on Computer and Communications Security, pages 62-73, 1993.
8. M. Ben-Or. Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols. In Principles of Distributed Computing (PODC), pages 27-30, 1983.
9. M. Ben-Or, E. Pavlov, and V. Vaikuntanathan. Byzantine agreement in the full-information model in o (log n) rounds. In Proceedings of the ACM Symposium on Theory of Computing (STOC), 2006.
10. G. Bracha. Asynchronous byzantine agreement protocols. Journal of Information and Computation, 75(2):130-143, 1987.
11. R. Canetti and T. Rabin. Fast asynchronous Byzantine agreement with optimal resilience. In ACM Symposium on Theory of Computing (STOC), 1993.
12. B. Chor and C. Dwork. Randomization in Byzantine agreement. Advances in Computing Research, 5:443-498, 1989.
13. P. Feldman and S. Micali. Byzantine agreement in constant expected time (and trusting no one). In Foundations of Computer Science (FOCS), pages 267-276, 1985.
14. M. Fischer, N. Lynch, and M. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374-382, 1985.
15. B. Kapron, D. Kempe, V. King, J. Saia, and V. Sanwalani. Scalable algorithms for byzantine agreement and leader election with full information. ACM Transactions on Algorithms(TALG), 2009.
16. A. Karlin and A. Yao. Probabilistic lower bounds for byzantine agreement and clock synchronization. Unpublished manuscript.
17. 2) bit barrier: Scalable byzantine agreement with an adaptive adversary. In Principles of Distributed Computing (PODC), 2010.
18. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems (TOPLAS), 4(3):401, 1982.
19. A. Lewko. The contest between simplicity and efficiency in asynchronous byzantine agreement. Distributed Computing, pages 348-362, 2011.
20. M. Rabin. Randomized Byzantine generals. In Foundations of Computer Science (FOCS), pages 403-409, 1983.