The contest between simplicity and efficiency in asynchronous Byzantine agreement

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6950 LNCS, Issue , 2011, Pages 348-362

  Lewko, Allison ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BYZANTINE AGREEMENT; BYZANTINE FAILURES; CONSENSUS PROTOCOLS; EFFICIENT ALGORITHM; EXPONENTIAL RUNNING TIME; IMPOSSIBILITY RESULTS; INFORMATION MODELS; LAS VEGAS; LAS VEGAS ALGORITHMS; MONTE CARLO; OPTIMAL RESILIENCE; POLYLOGARITHMIC TIME; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; ROUND STRUCTURE; RUNNING TIME; RUNNING-IN; SIMPLE STRUCTURES;

DISTRIBUTED COMPUTER SYSTEMS; INFORMATION THEORY; POLYNOMIAL APPROXIMATION;

ALGORITHMS;

EID: 80055052212     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-24100-0_35     Document Type: Conference Paper

References (18)

1. Attiya, H., Censor, K.: Lower bounds for randomized consensus under a weak adversary. In: PODC, pp. 315-324 (2008)
2. Bar-Joseph, Z., Ben-Or, M.: A tight lower bound for randomized synchronous consensus. In: PODC, pp. 193-199 (1998)
3. Ben-Or, M.: Another advantage of free choice: Completely asynchronous agreement protocols. In: PODC, pp. 27-30 (1983)
4. Ben-Or, M., Pavlov, E., Vaikuntanathan, V.: Byzantine agreement in the full-information model in o(log n) rounds. In: STOC, pp. 179-186 (2006)
5. Bracha, G.: An asynchronous [(n-1)/3]-resilient consensus protocol. In: PODC, pp. 154-162 (1984)
6. Bracha, G.: An O(lg n) expected rounds randomized byzantine generals protocol. In: STOC, pp. 316-326 (1985)
7. Chor, B., Dwork, C.: Randomization in Byzantine Agreement. In: Advances in Computing Research, vol. 5, pp. 443-497. JAI Press, Greenwich (1989)
8. Dolev, D., Strong, R.: Polynomial algorithms for byzatine agreement. In: STOC, pp. 401-407 (1982)
9. Feige, U.: Noncryptographic selection protocols. In: FOCS, pp. 142-153 (1999)
10. Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. In: PODS, pp. 1-7 (1983)
11. Goldwasser, S., Pavlov, E., Vaikuntanathan, V.: Fault-tolerant distributed computing in full-information networks. In: FOCS, pp. 15-26 (2006)
12. Kapron, B.M., Kempe, D., King, V., Saia, J., Sanwalani, V.: Fast asynchronous byzantine agreement and leader election with full information. In: SODA, pp. 1038-1047 (2008)
13. Kapron, B.M., Kempe, D., King, V., Saia, J., Sanwalani, V.: Fast asynchronous byzantine agreement and leader election with full information. ACM Transactions on Algorithms 6(4) (2010)
14. 3/2) bits. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 464-478. Springer, Heidelberg (2009)
15. 2) bit barrier: scalable byzantine agreement with an adaptive adversary. In: PODC, pp. 420-429 (2010)
16. King, V., Saia, J., Sanwalani, V., Vee, E.: Scalable leader election. In: SODA, pp. 990-999 (2006)
17. King, V., Saia, J., Sanwalani, V., Vee, E.: Towards secure and scalable computation in peer-to-peer networks. In: FOCS, pp. 87-98 (2006)
18. Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM 27(2), 228-234 (1980)