From almost everywhere to everywhere: Byzantine agreement with Õ (n3/2) bits

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

Volumn 5805 LNCS, Issue , 2009, Pages 464-478

  King, Valerie ^a   Saia, Jared ^b  

^a UNIVERSITY OF VICTORIA   (Canada)

^b University of New Mexico   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALL-TO-ALL COMMUNICATION; BYZANTINE AGREEMENT; BYZANTINE FAULT; DISTRIBUTED ALGORITHM; HIGH PROBABILITY; LARGE-SCALE NETWORK; LEADER ELECTION; POLYLOGARITHMIC TIME; PRIVATE CHANNELS; RANDOM BITS; SYNCHRONOUS MODELS;

MESSAGE PASSING;

EID: 76649119750     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04355-0_47     Document Type: Conference Paper

References (14)

1. Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edn. John Wiley Interscience, Chichester (2004)
2. 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)
3. Bortnikov, E., Gurevich, M., Keidar, I., Kliot, G., Shraer, A.: Brahms: Byzantine resilient random membership sampling. In: PODC 2008: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, Toronto, Canada, pp. 145-154. ACM, New York (2008)
4. Dolev, D., Reischuk, R.: Bounds on information exchange for byzantine agreement. J. ACM 32(1), 191-204 (1985)
5. Feige, U.: Noncryptographic selection protocols. In: FOCS 1999: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, p. 142. IEEE Computer Society, Washington (1999)
6. Garay, J.A., Ostrovsky, R.: Almost-everywhere secure computation. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 307-323. Springer, Heidelberg (2008)
7. Georgiou, C., Gilbert, S., Guerraoui, R., Kowalski, D.R.: On the complexity of asynchronous gossip. In: Proceedings of the ACM symposium on Principles of distributed computing (PODC), pp. 135-144 (2008)
8. Goldwasser, S., Pavlov, E., Vaikuntanathan, V.: Fault-tolerant distributed computing in full-information networks. In: FOCS, pp. 15-26 (2006)
9. Gradwohl, R., Vadhan, S.P., Zuckerman, D.: Random selection with an adversarial majority. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 409-426. Springer, Heidelberg (2006)
10. Holtby, D., Kapron, B.M., King, V.: Lower bound for scalable byzantine agreement. Distributed Computing 21(4), 239-248 (2008)
11. 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)
12. King, V., Saia, J., Sanwalani, V., Vee, E.: Scalable leader election. In: SODA 2006: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp. 990-999. ACM Press, New York (2006)
13. King, V., Saia, J., Sanwalani, V., Vee, E.: Towards secure and scalable computation in peer-to-peer networks. In: FOCS 2006: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 87-98. IEEE Computer Society, Washington (2006)
14. Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.: Zyzzyva: speculative byzantine fault tolerance. SIGOPS Oper. Syst. Rev. 41(6), 45-58 (2007)