Salsa: A structured approach to large-scale anonymity

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2006, Pages 17-26

  Nambiar, Arjun ^a   Wright, Matthew ^a  

^a The University of Texas at Arlington   (United States)

Author keywords

Anonymous communications; Networks; Peer to peer networks; Privacy

Indexed keywords

ANONYMOUS CIRCUITS; ANONYMOUS COMMUNICATIONS SYSTEMS; PEER-TO-PEER NETWORKS; VIRTUAL TREE STRUCTURE;

COMMUNICATION SYSTEMS; COMPUTER CRIME; COMPUTER PRIVACY; DISTRIBUTED COMPUTER SYSTEMS; LARGE SCALE SYSTEMS; REQUIREMENTS ENGINEERING; VIRTUAL REALITY;

NETWORK SECURITY;

EID: 34547281136     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1180405.1180409     Document Type: Conference Paper

References (29)

1. A. Acquisti, R. Dingledine, and P. Syverson. On the economics of anonymity. In Proc. Financial Cryptography, Jan 2003.
2. A. Back, I. Goldberg, and A. Shostack. Freedom 2.0 security issues and analysis. Zero-Knowledge Systems, Inc. white paper, Nov 2000.
3. O. Berthold, H. Federrath, and M. Kohntopp. Project anonymity and unobservability in the Internet. In Proc. Computers Freedom and Privacy, April 2000.
4. O. Berthold, A. Pfitzmann, and R. Standtke. The disadvantages of free mix-routes and how to overcome them. In Proc. Intl. Workshop on Design Issues in Anonymity and Unobservability, July 2000.
5. N. Borisov. Anonymous Routing in Structured Peer-to-Peer Overlays. University of California, Berkeley, CA, 2005. Ph.D Thesis.
6. D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84-88, Feb 1981.
7. G. Ciaccio. Improving sender anonymity in a structured overlay with imprecise routing. In Proc. Privacy Enhancing Technologies Workshop (PET), June 2006.
8. G. Danezis. Statistical disclosure attacks: Traffic confirmation in open environments. In Proc. Security and Privacy in the Age of Uncertainty (SEC 2003), pages 421-426, May 2003.
9. G. Danezis. The traffic analysis of continuous-time mixes. In Proc. Privacy Enhancing Technologies Workshop (PET), May 2004.
10. G. Danezis, C. Lesniewski-Laas, M. F. Kaashoek, and R. Anderson. Sybil-resistant DHT routing. In Proc. ESORICS, Sep. 2005.
11. R. Dingledine, N. Mathewson, and P. Syverson. Tor: The next-generation Onion Router. In Proc. 13th USENIX Security Symposium, August 2004.
12. J. Douceur. The Sybil attack. In Proc. IPTPS, Mar. 2002.
13. M. Freedman and R. Morris. Tarzan: A peer-to-peer anonymizing network layer. In Proc. ACM CCS, Nov. 2002.
14. S. D. Kamvar, M. T. Schlosser, and H. Garcia-Molina. The eigentrust algorithm for reputation management in p2p networks. In Proc. 12th International World Wide Web Conference, 2003.
15. J. Kirk. Botnets shrinking in size, harder to trace. http://tinyurl.com/ nfxgk, Jan. 2006.
16. L. von Ahn, M. Blum, N. J. Hopper, and J. Langford. CAPTCHA: Using hard AI problems for security. In Proc. Eurocrypt, 2003.
17. B. N. Levine, M. Reiter, C. Wang, and M. Wright. Timing analysis in low-latency mix systems. In Proc. Financial Cryptography, February 2004.
18. N. Mathewson and R. Dingledine. Practical traffic analysis: extending and resisting statistical disclosure. In Proc. Privacy Enhancing Technologies workshop (PET 2004), May 2004.
19. R. Motawani and P. Raghavan. Randomized Algorithms, chapter 3. Cambridge University Press, 1995.
20. S. J. Murdoch and G. Danezis. Low-cost traffic analysis of Tor. In Proceedings of the 2005 IEEE Symposium on Security and Privacy, May 2005.
21. M. Reiter, X. Weng, and M. Wright. Building reliable mix networks with fair exchange. In Proc. 3rd Applied Cryptography and Network Security Conference (ACNS), June 2005.
22. M. K. Reiter and A. D. Rubin. Crowds: Anonymity for Web Transactions. ACM TISSEC, 1(1):66-92, Nov 1998.
23. M. Rennhard and B. Plattner. Practical anonymity for the masses with MorphMix. In Proc. Financial Cryptography (FC '04), February 2004.
24. 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 the 2001 ACM SIGCOMM Conference, 2001.
25. P. Syverson, G. Tsudik, M. Reed, and C. Landwehr. Towards an analysis of Onion Routing security. In Workshop on Design Issues in Anonymity and Unobservability, July 2000.
26. P. Tabriz and N. Borisov. Breaking the collusion detection mechanism of MorphMix. In Proc. Privacy Enhancing Technologies Workshop (PET), June 2006.
27. M. Wright, M. Adler, B. Levine, and C. Shields. An analysis of the degradation of anonymous protocols. In Proc. ISOC Sym. on Network and Distributed System Security, Feb 2002.
28. M. Wright, M. Adler, B. Levine, and C. Shields. Defending anonymous communications against passive logging attacks. In Proc. IEEE Sym. on Security and Privacy, May 2003.
29. Y. Zhu, X. Fu, B. Graham, R. Bettati, and W. Zhao. On flow correlation attacks and countermeasures in mix networks. In Proc. Privacy Enhancing Technologies (PET), May 2004.