Load balanced scalable byzantine agreement through quorum building, with full information

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

Volumn 6522 LNCS, Issue , 2011, Pages 203-214

  King, Valerie ^a   Lonargan, Steven ^a   Saia, Jared ^b   Trehan, Amitabh ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

^b MSC01 1070   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; MESSAGE PASSING;

ASYNCHRONOUS MODELS; BYZANTINE AGREEMENT; BYZANTINE FAULT; FULL INFORMATIONS; LARGE-SCALE NETWORK; LOAD-BALANCED; POLYLOGARITHMIC TIME; SYNCHRONOUS ALGORITHMS;

MESSAGE PASSING; DISTRIBUTED COMPUTER SYSTEMS;

EID: 78751674305     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17679-1_18     Document Type: Conference Paper

References (18)

1. Aspnes, J., Shah, G.: Skip graphs. In: SODA, pp. 384-393 (2003)
2. Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics. John Wiley & Sons, Chichester (2004)
3. Awerbuch, B., Scheideler, C.: Provably secure distributed name service. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, Springer, Heidelberg (2009)
4. Awerbuch, B., Scheideler, C.: Robust distributed name service. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 237-249. Springer, Heidelberg (2005)
5. Awerbuch, B., Scheideler, C.: Towards a Scalable and Robust DHT. In: SPAA, pp. 318-327 (2006)
6. Awerbuch, B., Scheideler, C.: Towards a scalable and robust DHT. Theory Comput. Syst. 45(2), 234-260 (2009)
7. Dwork, C., Peleg, D., Pippenger, N., Upfal, E.: Fault tolerance in networks of bounded degree. In: STOC, pp. 370-379 (1986)
8. Fiat, A., Saia, J., Young, M.: Making chord robust to byzantine attacks. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 803-814. Springer, Heidelberg (2005)
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. 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)
11. King, V., Saia, J.: From almost everywhere to everywhere: Byzantine agreement with ∼O(n3/2) bits. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 464-478. Springer, Heidelberg (2009)
12. King, V., Saia, J.: Breaking the O(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary. In: PODC, pp. 420-429 (2010)
13. King, V., Saia, J., Sanwalani, V., Vee, E.: Scalable leader election. In: SODA, pp. 990-999 (2006)
14. King, V., Saia, J., Sanwalani, V., Vee, E.: Towards secure and scalable computation in peer-to-peer networks. In: FOCS, pp. 87-98 (2006)
15. Scheideler, C.: How to Spread Adversarial Nodes? Rotate! In: STOC, pp. 704-713 (2005)
16. Upfal, E.: Tolerating linear number of faults in networks of bounded degree. In: PODC, pp. 83-89 (1992)
17. Young, M., Kate, A., Goldberg, I., Karsten, M.: Practical robust communication in DHTs tolerating a byzantine adversary. In: ICDCS, pp. 263-272. IEEE, Los Alamitos (2010)
18. Zuckerman, D.: Randomness-optimal oblivious sampling. Random Struct. Algorithms 11(4), 345-367 (1997) (Pubitemid 127345393)