Preserving caller anonymity in voice-over-IP networks

Proceedings - IEEE Symposium on Security and Privacy

Volumn , Issue , 2008, Pages 50-63

  Srivatsa, Mudhakar ^a   Liu, Ling ^b   Iyengar, Arun ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CANNING; INTERNET PROTOCOLS; INTERNET TELEPHONY; LAWS AND LEGISLATION; NETWORK PROTOCOLS; PROBABILITY; RANDOM PROCESSES; RISK ASSESSMENT; TELECOMMUNICATION SYSTEMS; TELEPHONE SYSTEMS; VOICE/DATA COMMUNICATION SYSTEMS; WIRELESS SENSOR NETWORKS;

COMMUNICATION LATENCY; EXPERIMENTAL EVALUATIONS; HIGH PROBABILITY; LOW-LATENCY; MIX NETWORKS; ON-DEMAND; PROTOTYPE IMPLEMENTATIONS; QOS GUARANTEES; RANDOM WALKS; SECURITY AND PRIVACY; SHORTEST PATH; TIMING ANALYSIS; TRIANGULATION BASED; VOICE-OVER IP;

QUALITY OF SERVICE;

EID: 50249106959     PISSN: 10816011     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SP.2008.10     Document Type: Conference Paper

References (38)

1. GT-ITM: Georgia tech internetwork topology models. http://www.cc.gatech. edu/projects/gtitm/.
2. The network simulator NS-2. http://www.isi.edu/nsnam/ns/.
3. The network simulator NS-2: Topology generation. http://www.isi.edu/ nsnam/ns/ns-topogen.html.
4. Phex client. http://www.phex.org.
5. Skype - the global internet telephone company. http://www.skype.com.
6. Telegeography research. http://www.telegeography.com.
7. D. Aldous and J. Fill. Reversible markov chains and random walks on graphs. http://statwww. berkeley.edu/users/aldous/RWG/book.html.
8. A. Back, I. Goldberg, and A. Shostack. Freedom 2.1 security issues and analysis. Zero Knowledge Systems, Inc. white paper, 2001.
9. A. Blum, D. Song, and S. Venkataraman. Detection of interactive stepping stones: Algorithms and confidence bounds. In 7th RAID, 2004.
10. D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. In Communications of ACM, 24(2): 84-88, 1981.
11. L. Deng and M. D. F. Wong. An exact algorithm for statistical shortest path problem. In Design Automation Conference, 2006.
12. R. Dingledine, N. Mathewson, and P. Syverson. Tor: The second generation onion router. In 13th USENIX Security Symposium, 2000.
13. D. L. Donoho, A. G. Flesia, U. Shankar, V. Paxson, J. Coit, and S. Staniford. Multiscale stepping stone detection: Detecting pairs of jittered interactive streams by exploiting maximum tolerable delay. In 5th RAID, 2002.
14. Eclipse. Aspectj compiler. http://eclipse.org/aspectj.
15. B. Fortz and M. Thorup. Optimizing OSPF/IS-IS weights in a changing world. In IEEE Journal on Special Areas in Communication, 2002.
16. M. J. Freedman and R. Morris. Tarzan: A peer-to-peer anonymizing network layer. In 9th ACM CCS, 2002.
17. D. Goldschlag, M. Reed, and P. Syverson. Onion routing for anonymous and private internet connections. In Communications of ACM, Vol 42(2), 1999.
18. M. Gruteser and D. Grunwald. Anonymous usage of location-based services through spatial and temporal cloaking. In ACM MobiSys, 2003.
19. K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica. The impact of DHT routing geometry on resilience and proximity. In ACM SIGCOMM, 2003.
20. P. Kamat, Y. Zhang, W. Trappe, and C. Ozturk. Enhancing source location privacy in sensor network routing. In IEEE ICDCS, 2005.
21. A. Papoulis. Probability, random variables, and stochastic processes. In 3rd ed. McGraw Hill ISBN 0-07-100870-5, pp. 113-114.
22. G. Perng, M. K. Reiter, and C. Wang. M2: Multicasting mixes for efficient and anonymous communication. In IEEE ICDCS, 2006.
23. A. Pfitzmann, B. Pfitzmann, and M. Waidner. ISDN-MIXes: Untraceable communication with small bandwidth overhead. In GI/ITG Conference on Communication in Distributed Systems, 1991.
24. A. Pfitzmann and M. Waidner. Networks without user observability. In Computers and Security, 2(6): 158-166, 1987.
25. L. Qiu, V. N. Padmanabhan, and G. M. Voelker. On the placement of web server replicas. In 12th IEEE INFOCOM, 2001.
26. S. M. Ross. Introduction to probability models. Academic Press ISBN: 0125980558, 2002.
27. C. Shields and B. N. Levine. A protocol for anonymous communication over the internet. In ACM CCS, 2000.
28. V. Shmatikov and M. H. Wang. Timing analysis in low latency mix networks: Attacks and defenses. In 11th ESORICS, 2006.
29. G. I. Sound. VoIP: Better than PSTN? http://www.globalipsound.com/demo/ tutorial.php.
30. 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, 2000.
31. X. Wang, S. Chen, and S. Jajodia. Tracking anonymous peer-to-peer VoIP calls on the internet. In 12th ACM CCS, 2005.
32. X. Wang and D. Reeves. Robust correlation of encrypted attack traffic through stepping stones by manipulation of interpacket delays. In 10th ACM CCS, 2003.
33. X. Wang, D. Reeves, and S. Wu. Inter-packet delay based correlation for tracing encrypted connections through stepping stones. In 7th ESORICS, 2002.
34. X. Wang, Z. Yao, and D. Loguinov. Residual-based measurement of peer and link lifetimes in gnutella networks. In IEEE InfoCom, 2007.
35. X. Y. Wang and D. S. Reeves. Robust correlation of encrypted attack traffic through stepping stones by manipulation of interpacket delays. In ACM CCS, 2003.
36. K. Yoda and H. Etoh. Finding a connection chain for tracing intruders. In 6th ESORICS, 2000.
37. E. W. Zegura, K. Calvert, and S. Bhattacharjee. How to model an internetwork? In IEEE Infocom, 1996.
38. Y. Zhang and V. Paxon. Detecting stepping stones. In 9th USENIX Security Symposium, 2000.