Dependent link padding algorithms for low latency anonymity systems

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2008, Pages 323-332

  Wang, Wei ^a   Motani, Mehul ^a   Srinivasan, Vikram ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Anonymity systems; Link padding; Traffic analysis attack

Indexed keywords

ANALYSIS AND SIMULATION; ANONYMITY SYSTEMS; DELAY BOUND; INTERNET TRACES; LINK PADDING; LOW LATENCY; POISSON PROCESS; SENDING RATE; TRAFFIC ANALYSIS; TRAFFIC ANALYSIS ATTACK; TRAFFIC RATE; USER ANONYMITY;

POISSON DISTRIBUTION;

PACKET NETWORKS;

EID: 69749095702     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1455770.1455812     Document Type: Conference Paper

References (31)

1. D. Chaum, "Untraceable electronic mail, return addresses, and digital pseudonyms," Communications of the ACM, vol. 24, no. 2, pp. 84-88, 1981.
2. G. Danezis, "The traffic analysis of continuous-time mixes," in Proceedings of Privacy Enhancing Technologies Workshop (PET), 2004.
3. X. Wang. S. Chen, and S. Jajodia, "Tracking anonymous peer-to-peer VoIP calls on the internet," in Proceedings of ACM CCS, 2005.
4. U. Moeller, L. Cottrell, P. Palfrader. and L. Sassaman, "IETF draft: Mixmastcr protocol version 2," http://www.ictf.org/internet-drafts/draft- sassaman-mixmaster-03.txt, 2004.
5. M. Reed, P. Syverson, and D. Goldschlag, "Anonymous connections and onion routing," IEEE Journal on Selected Areas in Communications, vol. 16, no. 4, pp. 482-494, 1998.
6. R. Dinglcdinc, N. Mathcwson, and P. Syverson. "Tor: the second-generation onion router." in Proceedings of the 13th conference on USENIX Security Symposium, 2004.
7. M. Frecdman and R. Morris, "Tarzan: a Peer-to-Peer Anonyrnizing Network Layer," in Proceedings of ACM CCS, 2002.
8. A. Scrjantov and P. Scwcll, "Passive Attack Analysis for Connection-Based Anonymity Systems." in Proceedings of European Symposium on Research in Computer Security, 2003.
9. V. Anantharam and S. Verdu, "Bits through queues," IEEE Trans, on Information Theory, vol. 42, no. 1, pp. 4-18, 1996.
10. X. Wang, S. Chen, and S. Jajodia, "Network Flow Watermarking Attack on Low-Latency Anonymous Communication Systems," in IEEE Symposium on Security and Privacy, 2007.
11. P. Venkitasubramaniam, T. He, and L. Tong, "Relay secrecy in wireless networks with eavesdroppers," in Proceedings of Allerton Gonference on Communication, Control and Computing, 2006.
12. A. Pfitzmann, B. Pfitzmann, and M. Waidncr. "ISDN-Mixes: Untraceable Communication with Very Small Bandwidth Overhead," in Proceedings of GI/ITG-Conference Communication in Distributed Systems, 1991.
13. P. Venkitasubramaniam and L. Tong, "Anonymous Networking for Minimum Latency in Multihop Networks," in IEEE Symposium on Security and Privacy, 2008.
14. P. Boucher. A. Shostack, and I. Goldberg, "Freedom systems 2.0 architecture," White paper, Zero Knowledge Systems. Inc., December 2000.
15. S. J. Murdoch and P. Zielinski, "Sampled traffic analysis by internet-exchange-level adversaries," in Proceedings of Privacy Enhancing Technologies Workshop (PET), 2007.
16. S. Murdoch and G. Danezis, "Low-cost traffic analysis of Tor," in IEEE Symposium on Security and Privacy, 2005.
17. N. Hopper, E. Y. Vasserman. and E. Chan-Tin, "How Much Anonymity docs Network Latency Leak?" in Proceedings of ACM CCS, 2007.
18. X. Fu, B. Graham, R. Bcttati, and W. Zhao, "On effectiveness of link padding for statistical traffic analysis attacks," in Proceedings of IEEE ICDCS, 2003.
19. V. Shniatikov and M. Wang. "Timing analysis in low-latency mix networks: attacks and defenses?" in Proceedings of ESORICS, 2006.
20. A. Scrjantov and G. Danezis, "Towards an information theoretic metric for anonymity," in Proceedings of Privacy Enhancing Technologies Workshop (PET), 2002.
21. C. Diaz. S. Scys, J. Claesscns, and B. Prcnecl, "Towards measuring anonymity," in Proceedings of Privacy Enhancing Technologies Workshop (PET), 2002.
22. B. Bollobas, Modern Graph Theory. Springer, 1998.
23. A. Blum. D. Song, and S. Venkataraman, "Detection of interactive stepping stones: Algorithms and confidence bounds," in Proceedings of International Symposium on Recent Advances In Intrusion Detection. 2004.
24. T. He and L. Tong, "Detecting information flows: Improving chaff tolerance by joint detection," in Proceedings of Annual Conference Information Sciences and Systems (CISS), 2007.
25. G. H. Gonnet, "Expected Length of the Longest Probe Sequence in Hash Code Searching," Journal of the ACM. vol. 28, no. 2, pp. 289-304, 1981.
26. M. D. Mitzenmacher, "The power of two choices in randomized load balancing," PhD Thesis, University of Califonia at Berkeley 1996.
27. A. Papoulis and S. U. Pillai, Probability, Random Variables and Stochastic Processes. 4th Ed. McGraw Hill, 2002.
28. P. Venkitasubramaniam. T. He, and L. Tong, "Anonymous networking amidst eavesdroppers," IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2770-2784, 2008.
29. J. W. Cohen, The Single Server Queue. North-Holland, 1982.
30. M. E. Crovella and A. Bestavros, "Self-Similarity in World Wide Web Traffic: Evidence and Possible Causes," IEEE/ACM Transactions on Networking, vol. 5. no. 6, pp. 835-846, 1997.
31. N. L. for Applied Network Research., "Auckland-viii data set," http://pma.nlanr.net/Spccial/auck8.html, 2003.