ShadowWalker: Peer-to-peer anonymous communication using redundant structured topologies

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2009, Pages 161-172

  Mittal, Prateek ^a   Borisov, Nikita ^a  

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

Author keywords

Anonymity; Peer to peer; Random walks

Indexed keywords

ANONYMOUS COMMUNICATION; ANONYMOUS COMMUNICATION SYSTEMS; DOS ATTACKS; LOW-LATENCY; NEW DESIGN; NEW OPPORTUNITIES; PEER TO PEER; PEER-TO-PEER APPROACH; RANDOM WALK; STATE OF THE ART;

COMMUNICATION SYSTEMS; COMPUTER CRIME; DESIGN; DISTRIBUTED COMPUTER SYSTEMS; NETWORK SECURITY; TOPOLOGY;

PEER TO PEER NETWORKS;

EID: 74049096681     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1653662.1653683     Document Type: Conference Paper

References (55)

1. A. Back, U. Möller, and A. Stiglic. Traffic analysis attacks and trade-offs in anonymity providing systems. In Proceedings of the IH, 2001.
2. O. Berthold, H. Federrath, and M. Köhntopp. Project anonymity and unobservability in the Internet. In Proceedings of CFP, 2000.
3. R. Bhagwan, S. Savage, and G. Voelker. Understanding availability. Proceedings of IPTPS, pages 256-267, 2003.
4. N. Borisov. Anonymous routing in structured peer-to-peer overlays. PhD thesis, University of California at Berkeley, Berkeley, CA, USA, 2005.
5. N. Borisov, G. Danezis, P. Mittal, and P. Tabriz. Denial of service or denial of security? How attacks on reliability can compromise anonymity. In Proceedings of CCS, October 2007.
6. M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. S. Wallach. Secure routing for structured peer-to-peer overlay networks. In Proceedings of OSDI, December 2002.
7. D. Daly, D. D. Deavours, J. M. Doyle, P. G. Webster, and W. H. Sanders. Möbius: An extensible tool for performance and dependability modeling. In B. R. Haverkort, H. C. Bohnenkamp, and C. U. Smith, editors, Computer Performance Evaluation: Modelling Techniques and Tools, volume 1786, pages 332-336, Schaumburg, IL, Mar. 2000. Springer.
8. G. Danezis. Mix-networks with restricted routes. In R. Dingledine, editor, Proceedings of PET, pages 1-17. Springer-Verlag, LNCS 2760, March 2003.
9. G. Danezis and R. Clayton. Route Fingerprinting in Anonymous Communications. Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing, pages 69-72, 2006.
10. G. Danezis, R. Dingledine, and N. Mathewson. Mixminion: Design of a Type III Anonymous Remailer Protocol. In Proceedings of S & P, pages 2-15, May 2003.
11. G. Danezis, C. Lesniewski-Laas, M. F. Kaashoek, and R. J. Anderson. Sybil-resistant dht routing. In Proceedings of ESORICS, pages 305-318, 2005.
12. G. Danezis and P. Mittal. Sybilinfer: Detecting sybil nodes using social networks. In Proceedings of NDSS, 2009.
13. G. Danezis and P. Syverson. Bridging and fingerprinting: Epistemic attacks on route selection. In Proceedings of PET, Leuven, Belgium, July 2008.
14. N. de Bruijn. A combinatorial problem. Koninklijke Nederlandse Akademie van Wetenschappen, 49, 1946.
15. C. Diaz, S. Seys, J. Claessens, and B. Preneel. Towards measuring anonymity. In R. Dingledine and P. Syverson, editors, Proceedings of PET, San Diego, CA, April 2002. Springer-Verlag, LNCS 2482.
16. R. Dingledine, N. Mathewson, and P. Syverson. Tor: The second-generation onion router. In Proceedings of USENIX Security Symposium, August 2004.
17. J. Douceur. The Sybil Attack. In Proceedings of IPTPS, March 2002.
18. M. J. Freedman and R. Morris. Tarzan: A peer-to-peer anonymizing network layer. In Proceedings of CCS, Washington, DC, November 2002.
19. D. Goodin. Tor at heart of embassy passwords leak. The Register, September 10 2007.
20. K. P. Gummadi, S. Saroiu, and S. D. Gribble. King: estimating latency between arbitrary internet end hosts. SIGCOMM CCR., 32(3):11-11, 2002.
21. S. Hazel and B. Wiley. Achord: A variant of the Chord lookup service for use in censorship resistant peer-to-peer publishing systems. In Proceedings of IPTPS, Cambridge, MA, Mar. 2002.
22. A. Kapadia and N. Triandopoulos. Halo: High-assurance locate for distributed hash tables. In Proceedings of NDSS, pages 61-79, February 2008.
23. F. Lesueur, L. Me, and V. V. T. Tong. A sybilproof distributed identity management for p2p networks. In Computers and Communications, 2008. ISCC 2008. IEEE Symposium on, pages 246-253, 2008.
24. B. N. Levine, M. K. Reiter, C. Wang, and M. K. Wright. Timing attacks in low-latency mix-based systems. In A. Juels, editor, Proceedings of FC, pages 251-265. Springer-Verlag, LNCS 3110, February 2004.
25. K. Loesing. Measuring the Tor network: Evaluation of client requests to directories. https://git. torproject.org/checkout/metrics/master/report/dirreq/ directory-requests-2009-06-25.pdf, 2009.
26. J. McLachlan and N. Hopper. Don't clog the queue: Circuit clogging and mitigation in P2P anonymity schemes. In Proceedings of FC, January 2008.
27. R. Merkle. Protocols for public key cryptosystems. In Proceedings of S & P, pages 122-133, 1980.
28. A. Mislove, G. Oberoi, A. Post, C. Reis, P. Druschel, and D. S. Wallach. AP3: Cooperative, decentralized anonymous communication. In Proceedings of the ACM SIGOPS European Workshop, 2004.
29. P. Mittal and N. Borisov. Information leaks in structured peer-to-peer anonymous communication. In Proceedings of CCS, October 2008.
30. U. Möller, L. Cottrell, P. Palfrader, and L. Sassaman. Mixmaster Protocol - Version 2. IETF Internet Draft, July 2003.
31. S. J. Murdoch and G. Danezis. Low-cost traffic analysis of Tor. In Proceedings of S & P, 2005.
32. A. Nambiar and M. Wright. The Salsa simulator: http://ranger.uta.edu/ mwright/code/salsa-sims.zip.
33. A. Nambiar and M. Wright. Salsa: a structured approach to large-scale anonymity. In Proceedings of CCS, pages 17-26, New York, NY, USA, 2006. ACM.
34. L. Øverlier and P. Syverson. Locating hidden servers. In Proceedings of S & P. IEEE CS, May 2006.
35. T. T. Project. Torstatus-tor network status. http://torstatus.kgprog.com/ .
36. J.-F. Raymond. Traffic Analysis: Protocols, Attacks, Design Issues, and Open Problems. In H. Federrath, editor, Proceedings of Designing Privacy Enhancing Technologies: Workshop on Design Issues in Anonymity and Unobservability, pages 10-29. Springer-Verlag, LNCS 2009, July 2000.
37. M. Reiter and A. Rubin. Crowds: Anonymity for web transactions. ACM TISSEC, 1(1), June 1998.
38. M. Rennhard and B. Plattner. Introducing MorphMix: Peer-to-Peer based Anonymous Internet Usage with Collusion Detection. In Proceedings of WPES, Washington, DC, USA, November 2002.
39. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Middleware, pages 329-350, November 2001.
40. S. Saroiu, P. Gummadi, and S. Gribble. A measurement study of peer-to-peer file sharing systems. In Multimedia Computing and Networking, 2002.
41. A. Serjantov and G. Danezis. Towards an information theoretic metric for anonymity. In Proceedings of PET, 2002.
42. V. Shmatikov and M.-H. Wang. Timing analysis in low-latency mix networks: Attacks and defenses. In Proceedings of ESORICS, September 2006.
43. E. Sit and R. Morris. Security considerations for peer-to-peer distributed hash tables. In IPTPS, pages 261-269, London, UK, 2002. Springer-Verlag.
44. 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., 11(1):17-32, 2003.
45. P. Syverson, G. Tsudik, M. Reed, and C. Landwehr. Towards an analysis of onion routing security. In H. Federrath, editor, Proceedings of Designing Privacy Enhancing Technologies: Workshop on Design Issues in Anonymity and Unobservability, pages 96-114. Springer-Verlag, LNCS 2009, July 2000.
46. P. F. Syverson, D. M. Goldschlag, and M. G. Reed. Anonymous connections and onion routing. Security & Privacy, IEEE, 4-7:44-54, 1997.
47. P. Tabriz and N. Borisov. Breaking the collusion detection mechanism of MorphMix. In G. Danezis and P. Golle, editors, Proceedings of PET, pages 368-384, Cambridge, UK, June 2006. Springer.
48. D. Wallach. A survey of peer-to-peer security issues. In International Symposium on Software Security, Tokyo, Japan, 2002.
49. C. Williams. Bt admits misleading customers over Phorm experiments. The Register, March 17 2008.
50. M. Wright, M. Adler, B. N. Levine, and C. Shields. An analysis of the degradation of anonymous protocols. In Proceedings of NDSS. IEEE, February 2002.
51. M. Wright, M. Adler, B. N. Levine, and C. Shields. Defending anonymous communication against passive logging attacks. In Proceedings of S & P, May 2003.
52. M. Wright, M. Adler, B. N. Levine, and C. Shields. Passive logging attacks against anonymous communications. ACM TISSEC, 11(2), May 2008.
53. H. Yu, P. B. Gibbons, M. Kaminsky, and F. Xiao. Sybillimit: A near-optimal social network defense against sybil attacks. In Proceedings of S & P, 2008.
54. H. Yu, M. Kaminsky, P. B. Gibbons, and A. Flaxman. Sybilguard: defending against sybil attacks via social networks. SIGCOMM CCR., 36(4):267-278, 2006.
55. Y. Zhu, X. Fu, B. Graham, R. Bettati, and W. Zhao. On flow correlation attacks and countermeasures in mix networks. In Proceedings of PET, 2004.