Halo: High-Assurance Locate for Distributed Hash Tables

Proceedings of the Symposium on Network and Distributed System Security, NDSS 2008

Volumn , Issue , 2008, Pages

  Kapadia, Apu ^a   Triandopoulos, Nikos ^b  

^a DARTMOUTH COLLEGE   (United States)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; FAILURE ANALYSIS; FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; MIDDLEWARE; NETWORK SECURITY;

COMMUNICATION COMPLEXITY; DISTRIBUTED HASH TABLE; HIGH ASSURANCE; MALICIOUS NODES; NETWORK NODE; PEER-TO-PEER NETWORKS; SEARCH OPERATIONS; SEARCH PROCESS; STORAGE COMPLEXITY; TABLE STRUCTURE;

PEER TO PEER NETWORKS;

EID: 85180784621     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (36)

1. M. S. Artigas, P. G. Lopez, J. P. Ahullo, and A. F. G. Skarmeta. Cyclone: A novel design schema for hierarchical dhts. In P2P '05: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (P2P’05), pages 49-56, Washington, DC, USA, 2005. IEEE Computer Society.
2. J. Aspnes and G. Shah. Skip graphs. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms, pages 384-393, 2003.
3. B. Awerbuch and C. Scheideler. Towards a scalable and robust dht. In SPAA '06: Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, pages 318-327, New York, NY, USA, 2006. ACM.
4. M. Castro, P. Drushel, A. Ganesh, A. Rowstron, and D. Wallach. Secure routing for structured peer-to-peer overlay networks. In Proceedings of Usenix Symposium of Operating Systems Design and Implementation (OSDI), 2002.
5. F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In Proceedings of 18th ACM Symposium on Operating Systems Principles (SOSP '01), Chateau Lake Louise, Banff, Canada, Oct. 2001.
6. G. Danezis, C. Lesniewski-Laas, M. F. Kaashoek, and R. Anderson. Sybil-resistant DHT routing. In Proceedings of the 10th European Symposium On Research In Computer Security, Milan, Italy, September 2005.
7. J. R. Douceur. The sybil attack. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), pages 251-260, 2002.
8. P. Druschel and A. Rowstron. Past: A large-scale, persistent peer-to-peer storage utility. In HOTOS '01: Proceedings of EighthWorkshop on Hot Topics in Operating Systems, page 75, Washington, DC, USA, 2001. IEEE Computer Society.
9. A. Fiat and J. Saia. Censorship resistant peer-to-peer content addressable networks. In Proceedings of Symposium on Discrete Algorithms, 2002.
10. A. Fiat, J. Saia, and M. Young. Making chord robust to byzantine attacks. In Proceeding of European Symposium of Algorithms, pages 803-814, 2005.
11. M. J. Freedman and R. Morris. Tarzan: a peer-to-peer anonymizing network layer. In CCS '02: Proceedings of the 9th ACM conference on Computer and communications security, pages 193-206, New York, NY, USA, 2002. ACM Press.
12. K. Fu, M. F. Kaashoek, and D. Mazieres. Fast and secure distributed read-only file system. Computer Systems, 20(1):1-24, 2002.
13. P. Ganesan and G. S. Manku. Optimal routing in Chord. In Proceedings of 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 169-178, 2004.
14. M. T. Goodrich, M. J. Nelson, and J. Z. Sun. The rainbow skip graph: a fault-tolerant constant-degree distributed data structure. In SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pages 384-393, New York, NY, USA, 2006. ACM Press.
15. C. Harvesf and D. M. Blough. The effect of replica placement on routing robustness in distributed hash tables. In P2P '06: Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing, pages 57-6,Washington, DC, USA, 2006. IEEE Computer Society.
16. N. J. A. Harvey, M. B. Jones, S. Saroiu, M. Theimer, and A. Wolman. SkipNet: A scalable overlay network with practical locality properties. In USENIX Symposium on Internet Technologies and Systems, Lecture Notes in Computer Science, 2003.
17. R. Huebsch, B. Chun, J. Hellerstein, B. Loo, P. Maniatis, T. Roscoe, S. Shenker, I. Stoica, and A. Yumerefendi. The architecture of PIER: an internet-scale query processor. In Proceedings of 2nd Conference on Innovative Data Systems Research (CIDR), pages 28-43, 2005.
18. F. Kaashoek and D. R. Karger. Koorde: A simple degreeoptimal distributed hash table. In Proceedings of 2nd International Workshop on Peer-to-Peer Systems, 2003.
19. K. Kothapalli and C. Scheideler. Supervised peer-topeer systems. In Proceedings of 2005 International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN), 2005.
20. G. S. Manku, M. Bawa, and P. Raghavan. Symphony: Distributed hashing in a small world. In Proceedings of 4th USENIX Symposium on Internet Technologies and Systems, pages 127-140, 2003.
21. P. Maymounkov and D. Mazires. Kademlia: A peerto- peer information system based on the xor metric. In Proceedings of the 1st International Workshop on Peerto-Peer Systems (IPTPS '02), pages 53-65, Mar. 2002.
22. A. Nambiar and M. Wright. Salsa: a structured approach to large-scale anonymity. In CCS '06: Proceedings of the 13th ACM conference on Computer and communications security, pages 17-26, New York, NY, USA, 2006. ACM Press.
23. M. Naor and U. Wieder. Novel architectures for p2p applications: The continuous-discrete approach. ACM Trans. Algorithms, 3(3):34, 2007.
24. C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proceedings of ACM Symposium on Parallel Algorithms and Architectures, pages 311-320, June 1997.
25. S. Ratnasamy, P. Francis, M. Handley, R. M. Karp, and S. Shenker. A scalable content-addressable network. In Proceedings of SIGCOMM, pages 161-172, 2001.
26. M. Rennhard and B. Plattner. Practical anonymity for the masses with MorphMix. In Proceedings of Financial Cryptography, 2004.
27. S. Rhea, B. Godfrey, B. Karp, J. Kubiatowicz, S. Ratnasamy, S. Shenker, I. Stoica, and H. Yu. OpenDHT: A public DHT service and its uses. In Proceedings of 2005 ACM SIGCOMM Conference, pages 73-84, 2005.
28. A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peerto- peer systems. Lecture Notes in Computer Science, 2218:329, 2001.
29. A. I. T. Rowstron, A.-M. Kermarrec, M. Castro, and P. Druschel. SCRIBE: The design of a large-scale event notification infrastructure. In Networked Group Communication, pages 30-43, 2001.
30. J. Saia, A. Fiat, S. D. Gribble, A. R. Karlin, and S. Saroiu. Dynamically fault-tolerant content addressable networks. In IPTPS '01: Revised Papers from the First International Workshop on Peer-to-Peer Systems, pages 270-279, London, UK, 2002. Springer-Verlag.
31. E. Sit and R. Morris. Security considerations for peer-topeer distributed hash tables. In Proceedings of International Workshop on P2P Systems, pages 261-269, 2002.
32. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable Peer-To-Peer lookup service for internet applications. In Proceedings of 2001 ACM SIGCOMM Conference, pages 149-160, 2001.
33. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proceedings of SIGCOMM '01, pages 149-160, San Diego, California, August 2001.
34. R. Tamassia and N. Triandopoulos. Efficient content authentication in peer-to-peer networks. In Proceedings of Applied Cryptography and Network Security, pages 354-372, 2007.
35. D. S. Wallach. A survey of peer-to-peer security issues. In Proceedings of International Symposium on Software Security, 2002.
36. B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. Kubiatowicz. Tapestry: A resilient globalscale overlay for service deployment. IEEE Journal on Selected Areas in Communications, 22(1):41-53, January 2004.