Making Chord robust to Byzantine attacks

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 803-814

  Fiat, Amos ^a   Saia, Jared ^b   Young, Maxwell ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b University of New Mexico   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; INTEGER PROGRAMMING; NETWORK PROTOCOLS; PROBABILITY; ROBUSTNESS (CONTROL SYSTEMS); TELECOMMUNICATION NETWORKS;

BYZANTINE PEERS; CHORD; DISTRIBUTED HASH TABLE (DHT); MESSAGING;

COMPUTER NETWORKS;

EID: 27144478012     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_71     Document Type: Conference Paper

References (28)

1. Aspnes, J., Shah, G.: Skip Graphs. Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2003) 384-393
2. Awerbuch, B., Scheideier, C.: Robust Distributed Name Service. International Workshop on Peer-to-Peer Systems (IPTPS) (2004) 237-249
3. Awerbuch, B., Scheideier, C.: Group Spreading: A Protocol for Provably Secure Distributed Name Service. Proceedings of the Thirty-First Int. Colloquium on Automata, Languages, and Programming (ICALP) (2004) 183-195
4. Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous Secure Computation. Proceedings of the Twenty-Fifth ACM Symposium on the Theory of Computing (STOC) (1993)
5. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computing. Proceedings of the Twentieth ACM Symposium on the Theory of Computing (STOC) (1988) 1-10
6. Ben-Or, M., Kelmer, B., Rabin, T. Asynchronous Secure Computations with Optimal Resilience. Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing (PODC) (1994) 183-192
7. Castro, M., Druschel P., Ganesh, A., Rowstron, A., Wallach, D.: Secure Routing for Structured Peer-to-Peer Overlay Networks. Proceedings of the 5th Usenix Symposium on Operating Systems Design and Implementation (OSDI) (2002) 299-314
8. Chaum, D., Crépeau, C., Damgård, L: Multiparty Unconditionally Secure Protocols. Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (STOC) (1988) 11-19
9. Dabek, F., Kaashoek, M., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with CFS. Proceedings of the 18th ACM Symposium on Operating Systems Principles (2001) 202-215
10. Douceur, J.: The Sybil Attack. Proceedings of the Second Internation Peer-to-Peer Symposium (IPTPS) (2002)
11. Fiat, A., Saia, J.: Censorship Resistant Peer-to-Peer Content Addressable Networks. Proceedings of the Thirteenth ACM Symposium on Discrete Algorithms (SODA) (2002)
12. Goldreich, O., Micali, S., Wigderson, A.: How to Play Any Mental Game - A Completeness Theorem for Protocols With Honest Majority. Proceedings of the Nineteenth ACM Symposium on Theory of Computing (STOC) (1987) 218-229
13. Harvey, N., Jones, M., Saroiu S., Theimer, M., Wolman, A.: SkipNet: A Scalable Overlay Network with Practical Locality Properties. Fourth USENIX Symposium on Internet Technologies and Systems(USITS) (2003)
14. Hildrum, K., Kubiatowicz, J.: Asymptotically Efiicient Approaches to Fault-Tolerance in Peer-to-peer Networks. Proceedings of the 17th International Symposium on Distributed Computing (2004)
15. Hirt, M., Nielsen, J., Przydatek, B.: An Asynchronous Multi-Party Computation Protocol. In Submission (2004)
16. Kashoek, M., Karger, D.: Koorde: A Simple Degree-Optimal Distributed Hash Table. Proceedings of the Second International Workshop on Peer-to-Peer Systems (IPTPS) (2003)
17. King, V., Saia, J.: Choosing a Random Peer. Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing (PODC) (2004)
18. Luby, M., Mitzenmacher, M., Shokrollahi, M., Spielman, D., and Stemann, V.: Practical loss-resilient codes. Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing (1997) 150-159
19. Naor, M., Wieder, U.: A simple fault tolerant distributed hash table. Proceedings of the Second International Workshop on Peer-to-Peer Systems (IPTPS) (2003)
20. Prabhu, B., Srinathan, K., Rangan, C.: Asynchronous Unconditionally Secure Computation: An Efficiency Improvement. INDOCRYPT 2002, Lecture Notes in Computer Science, Springer-Verlag 2551 (2002) 93-107
21. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (2001)
22. Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg, (2001) 329-350
23. Saia, J., Fiat, A., Gribble, S., Karlin, A., Saroiu, S.: Dynamically fault-tolerant content addressable networks. Proceedings of the First International Workshop on Peer-to-Peer Systems (2002)
24. Scheideler, C.: How to Spread Adversarial Nodes? Rotate! Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing (2005) 704-713
25. Srinathan, K., Rangan, C.: Efficient Asynchronous Secure Multiparty Distributed Computation. INDOCRYPT 2000, Lecture Notes in Computer Science, Springer-Verlag 1977 (2000) 117-129
26. Stoica, I., Morris, R., Karger, D., Kaashoek, M., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. Proceedings of the 2001 ACM SIGCOMM Conference (2001)
27. Yao, A.: Protocols for Secure Computations. Proceedings of the Twenty-Third IEEE Symposium on the Foundations of Computer Science (FOCS) (1982) 160-164
28. Zhao, B., Kubiatowicz, J., Joseph, A.: Tapestry: An Infrastructure for Fault-Resilient Wide-Area Location and Routing. University of California at Berkeley Technical Report, UCB//CSD-01-1141, (April 2001)