Octopus: A secure and anonymous DHT lookup

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2012, Pages 325-334

  Wang, Qiyan ^a   Borisov, Nikita ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Anonymity; DHT; Lookup; Security

Indexed keywords

ACTIVE ATTACK; ANONYMITY; ATTACKER IDENTIFICATION; DHT; DISTRIBUTED HASH TABLES; ERROR RATE; EVENT-BASED; LOOKUP LATENCY; LOOKUPS; LOW-BANDWIDTH; MALICIOUS NODES; PLANETLAB; PROBABILISTIC MODELING; SECURITY; SECURITY AND PRIVACY; STRUCTURED PEER-TO-PEER;

DISTRIBUTED COMPUTER SYSTEMS; SHELLFISH;

PEER TO PEER NETWORKS;

EID: 84866914654     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2012.78     Document Type: Conference Paper

References (36)

1. I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup protocol for internet applications," IEEE/ACM Trans. Netw., vol. 11, no. 1, pp. 17-32, 2003.
2. P. Maymounkov and D. Mazieres, "Kademlia: A peer-to-peer information system based on the xor metric," IPTPS, 2001.
3. M. J. Freedman, E. Freudenthal, and D. Mazières, "Democratizing content publication with coral," in Proc. of NSDI'04, 2004.
4. A. Rowstron and P. Druschel, "Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility," in Proc. SOSP'01, 2001.
5. A. Mislove, G. Oberoi, A. Post, C. Reis, P. Druschel, and D. S. Wallach, "Ap3: Cooperative, decentrialized anonymous communication," ACM SIGOPS European Workshop, 2004.
6. A. Nambiar and M. Wright, "Salsa: A structured approach to large-scale anonymity," ACM CCS, 2006.
7. A. Panchenko, S. Richter, and A. Rache, "Nisan: Network information service for anonymization networks," ACM CCS, November 2009.
8. J. McLachlan, A. Tran, N. Hopper, and Y. Kim, "Scalable onion routing with torsk," ACM CCS, November 2009.
9. P. Mittal and N. Borisov, "Shadowwalker: Peer-to-peer anonymous communication using redundant structured topologies," ACM CCS, November 2009.
10. A. Shakimov, A. Varshavsky, L. P. Cox, and R. Cáceres, "Privacy, cost, and availability tradeoffs in decentralized osns," ser. WOSN '09, 2009, pp. 13-18.
11. L. A. Cutillo, R. Molva, and T. Strufe, "Privacy preserving social networking through decentralization," Proceedings of the Sixth international conference on Wireless On-Demand Network Systems and Services, 2009.
12. D. Wallach, "A survey of peer-to-peer security issues," in Software Security Theories and Systems, ser. LNCS, 2003, vol. 2609, pp. 253-258.
13. P. Mittal and N. Borisov, "Information leaks in structured peer-to-peer anonymous communication systems," ACM CCS, 2008.
14. Q. Wang, P. Mittal, and N. Borisov, "In search of an anonymous and secure lookup: Attacks on structured peer-to-peer anonymous communication systems," ACM CCS, 2010.
15. M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. S. Wallach, "Secure routing for structured peer-to-peer overlay networks," in OSDI, December 2002.
16. A. Kapadia and N. Triandopoulos, "Halo: High-assurance locate for distributed hash tables," in NDSS, February 2008.
17. M. Young, A. Kate, I. Goldberg, and M. Karsten, "Practical robust communication in dhts tolerating a byzantine adversary," Proc. ICDCS'10, pp. 263-272, 2010.
18. M. Backes, I. Goldberg, A. Kate, and T. Toft, "Adding query privacy to robust dhts," Tech. rep., arXiv:1107.1072v1 [cs.CR], July 2011.
19. J. Douceur, "The sybil attack," in Peer-to-Peer Systems, 2002, vol. 2429, pp. 251-260.
20. N. Borisov, "Computational puzzles as sybil defenses," in Peer-to-Peer Computing, 2006.
21. G. Danezis and P. Mittal, "Sybilinfer: Detecting sybil nodes using social networks," in NDSS, 2009.
22. H. Yu, P. B. Gibbons, M. Kaminsky, and F. Xiao, "Sybillimit: A near-optimal social network defense against sybil attacks," in IEEE Symposium on Security and Privacy (Oakland), 2008.
23. A. Pfitzmann and M. Hansen, "A terminology for talking about privacy by data minimization: Anonymity, unlinkability, undetectability, unobservability, pseudonymity, and identity management," Aug. 2010, v0.34.
24. A. Rowstron and P. Druschel, "Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems," IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pp. 329-350.
25. P. Wang, I. Osipkov, N. Hopper, and Y. Kim, "Myrmic: Secure and robust dht routing," Tech. rep., Digital Technology Center, University of Minnesota at Twin Cities, 2007.
26. J. L. Muoz, J. Forne, O. Esparza, and M. Soriano, "Certificate revocation system implementation based on the merkle hash tree," Inte. Journ. of Inf. Sec., vol. 2, no. 2, 2003.
27. M. C. Morogan and S. Muftic, "Certificate revocation system based on peer-to-peer crl distribution," in Proc. of the DMS'03 Conference, 2003.
28. C. Y. Liau, S. Bressan, K.-L. Tan, C. Yee, L. Stphane, and B. K. lee Tan, "Efficient certificate revocation: A p2p approach," in HICSS'05, 2005.
29. P. Syverson, G. Tsudik, M. Reed, and C. Landwehr, "Towards an analysis of onion routing security," International Workshop on Design Issues in Anonymity and Unobservaility, vol. 2009, LNCS, Springer, July 2000.
30. Q. Wang and N. Borisov, "Octopus: A secure and anonymous dht lookup," technical report, arXiv cs.CR, 2012. http://arxiv. org/abs/1203.2668.
31. F. Dabek, J. Li, E. Sit, J. Robertson, M. F. Kaashoek, and R. Morris, "Designing a dht for low latency and high throughput," NSDI'04, 2004.
32. 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, pp. 49-56, 2005.
33. M. Schuchard, A. Dean, V. Heorhiadi, N. Hopper, and Y. Kim, "Balancing the shadows," ACM WPES, 2010.
34. I. Clarke, T. W. Hong, S. G. Miller, O. Sandberg, and B. Wiley, "Protecting Free Expression Online with {Freenet}," IEEE Internet Computing, vol. 6, no. 1, pp. 40-49, 2002.
35. E. Y. Vasserman, R. Jansen, J. Tyra, N. Hopper, and Y. Kim, "Membership-concealing overlay networks," in ACM CCS, 2009.
36. WASTE. http://waste.sourceforge.net/.