Probabilistic analysis of onion routing in a black-box model

ACM Transactions on Information and System Security

Volumn 15, Issue 3, 2012, Pages

  Feigenbaum, Joan ^a   Johnson, Aaron ^a,b,c   Syverson, Paul ^c  

^a YALE UNIVERSITY   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^c NAVAL RESEARCH LABORATORY   (United States)

Author keywords

Security; Theory Additional

Indexed keywords

ACTIVE ADVERSARY; ANONYMOUS COMMUNICATION; BLACK-BOX MODEL; ONION ROUTING; PRIORI DISTRIBUTION; PROBABILISTIC ANALYSIS; PROBABILISTIC BEHAVIOR; SECURITY; THEORY ADDITIONAL; UNIVERSALLY COMPOSABLE;

COMPUTER SCIENCE; SAFETY ENGINEERING;

NETWORK SECURITY;

EID: 84872023509     PISSN: 10949224     EISSN: 15577406     Source Type: Journal    
DOI: 10.1145/2382448.2382452     Document Type: Article

References (50)

1. BACKES, M., GOLDBERG, I., KATE, A., AND MOHAMMADI, E. 2012. Provably secure and practical onion routing. In Proceedings of the 25th IEEE Computer Security Foundations Symposium (CSF 12). 369-385.
2. BAUER, K., MCCOY, D., GRUNWALD, D., KOHNO, T., AND SICKER, D. 2007. Low-resource routing attacks against Tor. In Proceedings of the Workshop on Privacy in the Electronic Society (WPES 07). 11-20.
3. BEIMEL, A. AND DOLEV, S. 2003. Buses for anonymous message delivery. J. Cryptol. 16, 1, 25-39.
4. BROWN, Z. 2002. Cebolla: Pragmatic IP anonymity. In Proceedings of the Ottawa Linux Symposium.
5. CAMENISCH, J. AND LYSYANSKAYA, A. 2005. A formal treatment of onion routing. In Proceedings of CRYPTO Conference. 169-187.
6. CANETTI, R. 2000. Universally composable security: A new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000/067. http://eprint.iacr.org/.
7. CHAUM, D. 1981. Untraceable electronic mail, return addresses, and digital pseudonyms. Comm. ACM 4, 2, 84-88.
8. CHAUM, D. 1988. The dining cryptographers problem: Unconditional sender and recipient untraceability. International Association for Cryptology Research. J. Cryptol. 1, 1, 65-75.
9. CORRIGAN-GIBBS, H. AND FORD, B. 2010. Dissent: Accountable anonymous group messaging. In Proceedings of the 17th ACM Conference on Computer and Communications Security (CCS 10). 340-350.
10. DANEZIS, G. 2003. Statistical disclosure attacks: Traffic confirmation in open environments. In Proceedings of Security and Privacy in the Age of Uncertainty Conference (SEC 03). 421-426.
11. DANEZIS, G. AND SERJANTOV, A. 2004. Statistical disclosure or intersection attacks on anonymity systems. In Proceedings of the 6th Information Hiding Workshop (IH 04). 293-308.
12. DÍAZ, C., SEYS, S., CLAESSENS, J., AND PRENEEL, B. 2002. Towards measuring anonymity. In Proceedings of the 2nd Privacy Enhancing Technologies Workshop (PET 02). 54-68.
13. DINGLEDINE, R.,MATHEWSON, N., AND SYVERSON, P. 2004. Tor: The second-generation onion router. In Proceedings of the 13th USENIX Security Symposium. 303-319.
14. FEIGENBAUM, J., JOHNSON, A., AND SYVERSON, P. 2007. A model of onion routing with provable anonymity. In Proceedings of the 11th Financial Cryptography and Data Security Conference (FC 07). 57-71.
15. FREEDMAN, M. J. AND MORRIS, R. 2002. Tarzan: A peer-to-peer anonymizing network layer. In Proceedings of the 9th ACM Conference on Computer and Communications Security (CCS 02). 193-206.
16. GOLDBERG, I. AND SHOSTACK, A. 1999. Freedom 1.0 security issues and analysis. White paper, Zero Knowledge Systems, Inc.
17. GOLDBERG, I. AND SHOSTACK, A. 2001. Freedom network 1.0 architecture and protocols. White paper, Zero Knowledge Systems, Inc.
18. GOLDSCHLAG, D. M., REED, M. G., AND SYVERSON, P. F. 1996. Hiding routing information. In Proceedings of the Ist International Workshop on Information Hiding. 137-150.
19. HALPERN, J. Y. AND O'NEILL, K. R. 2005. Anonymity and information hiding in multiagent systems. J. Comput. Secur. 13, 3, 483-514.
20. HERRMANN, D.,WENDOLSKY, R., AND FEDERRATH, H. 2009.Website fingerprinting: Attacking popular privacy enhancing technologies with the Multinomial Naïve-Bayes classifier. In Proceedings of the ACM Workshop on Cloud Computing Security (CCSW'09). 31-42.
21. HOPPER, N., VASSERMAN, E. Y., AND CHAN-TIN, E. 2010. How much anonymity does network latency leak? ACM Trans. Inf. Syst. Sec. 13, 2, 1-28.
22. HUGHES, D. AND SHMATIKOV, V. 2004. Information hiding, anonymity and privacy: A modular approach. J. Comput. Secur. 12, 1, 3-36.
23. KATE, A., ZAVERUCHA, G., AND GOLDBERG, I. 2007. Pairing-based onion routing. In Proceedings of the 7th International Symposium on Privacy Enhancing Technologies (PET 07). 95-112.
24. KESDOGAN, D., AGRAWAL, D., AND PENZ, S. 2002. Limits of anonymity in open environments. In Proceedings of the 5th Information Hiding Workshop (IH 02). 53-69.
25. KESDOGAN, D., EGNER, J., AND BÜSCHKES, R. 1998. Stop-and-Go MIXes: Providing probabilistic anonymity in an open system. In Proceedings of the 2nd Information Hiding Workshop (IH 98). 83-98.
26. LINCOLN, P., PORRAS, P., AND SHMATIKOV, V. 2004. Privacy-Preserving sharing and correlation of security alerts. In Proceedings of the 13th USENIX Security Symposium. 239-254.
27. LOESING ET AL. 2011. Tor metrics portal. https://metrics.torproject.org/.
28. LYNCH, N. A. 1996. Distributed Algorithms. Morgan Kaufmann Publishers.
29. MATHEWSON, N. AND DINGLEDINE, R. 2004. Practical traffic analysis: Extending and resisting statistical disclosure. In Proceedings of the 4th Privacy Enhancing Technologies Workshop (PET 04). 17-34.
30. MAUW, S., VERSCHUREN, J., AND DE VINK, E. 2004. Aformalization of anonymity and onion routing. In Proceedings of the 9th European Symposium on Research in Computer Security (ESORICS 04). 109-124.
31. MCLACHLAN, J., TRAN, A., AND HOPPER, N. 2009. Scalable onion routing with Torsk. In Proceedings of the 16th ACM Conference on Computer and Communications Security (CCS'09). ACM Press, 590-599.
32. MITTAL, P. AND BORISOV, N. 2009. ShadowWalker: Peer-to-Peer anonymous communication using redundant structured topologies. In Proceedings of the 16th ACM Conference on Computer and Communications Security (CCS'09). 161-172.
33. MURDOCH, S. J. 2006. Hot or not: Revealing hidden services by their clock skew. In Proceedings of the 13th ACM Conference on Computer and Communications Security (CCS'06). 27-36.
34. MURDOCH, S. J. AND DANEZIS, G. 2005. Low-Cost traffic analysis of Tor. In Proceedings of the IEEE Symposium on Security and Privacy (S & P 05). 183-195.
35. NAMBIAR, A. AND WRIGHT, M. 2006. Salsa: A structured approach to large-scale anonymity. In Proceedings of the 13th ACM Conference on Computer and Communications Security (CCS 06).
36. ØVERLIER, L. AND SYVERSON, P. 2006. Locating hidden servers. In Proceedings of IEEE Symposium on Security and Privacy (S& P 06). 100-114.
37. ØVERLIER, L. AND SYVERSON, P. 2007. Improving efficiency and simplicty of Tor circuit establishment and hidden services. In Proceedings of the 7th International Symposium on Privacy Enhancing Technologies (PET 07). 134-152.
38. PFITZMANN, A. AND KÖHNTOPP, M. 2000. Anonymity, unobservability, and pseudonymity: A proposal for terminology. In Proceedings of the Designing Privacy Enhancing Technologies: International Workshop on Design Issues in Anonymity and Unobservability. 1-9.
39. REED, M. G., SYVERSON, P. F., AND GOLDSCHLAG, D. M. 1998. Anonymous connections and onion routing. IEEE J. Select. Areas Comm. 16, 4, 482-494.
40. REITER, M. AND RUBIN, A. 1998. Crowds: Anonymity for web transactions. ACM Trans. Inf. Syst. Secur. 1, 1, 66-92.
41. SCHNEIDER, S. AND SIDIROPOULOS, A. 1996. CSP and anonymity. In Proceedings of the 1st European Symposium on Research in Computer Security (ESORICS 96). 198-218.
42. SERJANTOV, A. AND DANEZIS, G. 2002. Towards an information theoretic metric for anonymity. In Proceedings of the 2nd Privacy Enhancing Technologies Workshop (PET 02). 41-53.
43. SHMATIKOV, V. 2004. Probabilistic model checking of an anonymity system. J. Comput. Secur. 12, 3-4, 355-377.
44. SHMATIKOV, V. AND WANG, M.-H. 2006. Measuring relationship anonymity in mix networks. In Proceedings of the 5th ACM Workshop on Privacy in the Electronic Society (WPES 06). 59-62.
45. SYVERSON, P., REED, M., AND GOLDSCHLAG, D. 2000a. Onion routing access configurations. In Proceedings of the DARPA Information Survivability Conference and Exposition (DISCEX 00). 34-40.
46. SYVERSON, P., TSUDIK, G., REED, M., AND LANDWEHR, C. 2000b. Towards an analysis of onion routing security. In Proceedings of the Designing Privacy Enhancing Technologies: International Workshop on Design Issues in Anonymity and Unobservability. 96-114.
47. SYVERSON, P. F. AND STUBBLEBINE, S. G. 1999. Group principals and the formalization of anonymity. In Proceedings of the 1st World Congress on Formal Methods (FM'99). Vol. 1. 814-833.
48. TÓTH, G., HORNÁK, Z., AND VAJDA, F. 2004. Measuring anonymity revisited. In Proceedings of the 9th Nordic Workshop on Secure IT Systems. 85-90.
49. WIKSTRÖM, D. 2004. A universally composable mix-net. In Proceedings of the Ist Theory of Cryptography Conference (TCC 04). 317-335.
50. WRIGHT, M. K., ADLER, M., LEVINE, B. N., AND SHIELDS, C. 2004. The predecessor attack: An analysis of a threat to anonymous communications systems. ACM Trans. Inf. Syst. Secur. 7, 4, 489-522.