Provably secure and practical onion routing

Proceedings of the Computer Security Foundations Workshop

Volumn , Issue , 2012, Pages 369-385

  Backes, Michael ^a   Goldberg, Ian ^b   Kate, Aniket ^a   Mohammadi, Esfandiar ^a  

^a SAARLAND UNIVERSITY   (Germany)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Onion routing; Security proof; Universal compos ability

Indexed keywords

ANONYMITY ANALYSIS; BLACK-BOX MODEL; COMPREHENSIVE ANALYSIS; CRYPTOGRAPHIC PRIMITIVES; EXACT SECURITY; FORWARD SECRECY; KEY EXCHANGE PROTOCOLS; ONION ROUTING; PROCESSING ALGORITHMS; PROVABLY SECURE; SECURITY DEFINITIONS; SECURITY PROOFS; SYMMETRIC ENCRYPTION; UNIVERSAL COMPOS-ABILITY; WEB ACCESS;

ALGORITHMS; INTERNET PROTOCOLS; NETWORK PROTOCOLS; NEXT GENERATION NETWORKS; SECURITY SYSTEMS;

NETWORK SECURITY;

EID: 84866946287     PISSN: 10636900     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSF.2012.32     Document Type: Conference Paper

References (30)

1. M. Backes, I. Goldberg, A. Kate, and E. Mohammadi, "Provably secure and practical onion routing," IACR Cryptology ePrint Archive, Report 2011/308, 2012.
2. V. Boyko, P. D. MacKenzie, and S. Patel, "Provably Secur Password-Authenticated Key Exchange Using Diffie-Hellman," in EUROCRYPT, 2000, pp. 156-171.
3. J. Camenisch and A. Lysyanskaya, "A formal treatment of onion routing," in Advances in Cryptology-CRYPTO 200 2005, pp. 169-187.
4. R. Canetti, "Universally Composable Security: A New Paradigm for Cryptographic Protocols," in Proc. 42nd IEE Symposium on Foundations of Computer Science (FOCS), 2001, pp. 136-145.
5. R. Canetti, Y. Dodis, R. Pass, and S. Walfish, "Universally composable security with global setup," in Proc. 4th Theo of Cryptography Conference (TCC), 2007, pp. 61-85.
6. D. Catalano, D. Fiore, and R. Gennaro, "Certificateless onion routing," in Proc. 16th ACM Conference on Comput and Communication Security (CCS), 2009, pp. 151-160.
7. W. Diffie, P. C. van Oorschot, and M. J. Wiener, "Authentication and Authenticated Key Exchanges," Des. Codes Cryptography, vol. 2, no. 2, pp. 107-125, 1992.
8. R. Dingledine and N. Mathewson, "Tor Protocol Specification," https://gitweb.torproject.org/torspec.git?a=blobplain;hb=HEAD;f=tor-spec.txt, 2008, accessed Nov 2011.
9. R. Dingledine, N. Mathewson, and P. Syverson, "Tor: The Second-Generation Onion Router," in Proc. 13th USENIX Security Symposium (USENIX), 2004, pp. 303-320.
10. J. Feigenbaum, A. Johnson, and P. F. Syverson, "A model onion routing with provable anonymity," in Proc. 11th Conference on Financial Cryptography and Data Security (FC), 2007, pp. 57-71.
11. J. Feigenbaum, A. Johnson, and P. F. Syverson, "Probabilistic analysis of onion routing in a black-box model," in Proc. 6th ACM Workshop on Privacy in the Electronic Society (WPES), 2007, pp. 1-10.
12. J. Feigenbaum, A. Johnson, and P. F. Syverson, "Probabilistic Analysis of Onion Routing in a Black-box Model, Tech. Rep. arXiv:1111.2520, 2011, http://arxiv.org/abs/1111.2520v1.
13. I. Goldberg, "On the Security of the Tor Authentication Protocol," in Proc. 6th Workshop on Privacy Enhancing Technologies, 2006, pp. 316-331.
14. I. Goldberg, D. Stebila, and B. Ustaoglu, "Anonymity and one-way authentication in key exchange protocols," Designs, Codes and Cryptography, pp. 1-25, 2012, proposal for Tor: https://gitweb.torproject.org/torspec.git/ blob/HEAD: /proposals/ideas/xxx-ntor-handshake.txt.
15. O. Goldreich and Y. Lindell, "Session-Key Generation Using Human Passwords Only," in CRYPTO, 2001, pp. 408-432.
16. D. M. Goldschlag, M. Reed, and P. Syverson, "Hiding Routing Information," in Proc. 1st Workshop on Information Hiding, 1996, pp. 137-150.
17. D. M. Goldschlag, M. G. Reed, and P. F. Syverson, "Onion Routing," Commun. ACM, vol. 42, no. 2, pp. 39-41, 1999.
18. D. Hofheinz, "Possibility and Impossibility Results for Selective Decommitments," J. Cryptology, vol. 24, no. 3, pp. 470-516, 2011.
19. A. Kate and I. Goldberg, "Distributed Private-Key Generators for Identity-Based Cryptography," in Proc. 7th Conference on Security and Cryptography for Networks (SCN), 2010, pp. 436-453.
20. A. Kate and I. Goldberg, "Using Sphinx to Improve Onion Routing Circuit Construction," in Proc. 14th Conference on Financial Cryptography and Data Security (FC), 2010, pp. 359-366.
21. A. Kate, G. M. Zaverucha, and I. Goldberg, "Pairing-Based Onion Routing," in Proc. 7th Privacy Enhancing Technologies Symposium (PETS), 2007, pp. 95-112.
22. A. Kate, G. M. Zaverucha, and I. Goldberg, "Pairing-Based Onion Routing with Improved Forward Secrecy," ACM Trans. Inf. Syst. Secur., vol. 13, no. 4, p. 29, 2010.
23. S. Mauw, J. Verschuren, and E. P. de Vink, "A Formalization of Anonymity and Onion Routing," in Proc. 9th European Symposium on Research in Computer Security (ESORICS), 2004, pp. 109-124.
24. L. Øverlier and P. Syverson, "Improving efficiency and simplicity of tor circuit establishment and hidden services," in Proc. 7th Privacy Enhancing Technologies Symposium (PETS), 2007, pp. 134-152.
25. M. Reed, P. Syverson, and D. Goldschlag, "Anonymous Connections and Onion Routing," IEEE J-SAC, vol. 16, no. 4, pp. 482-494, 1998.
26. V. Shmatikov, "Probabilistic analysis of an anonymity system," Journal of Computer Security, vol. 12, no. 3-4, pp. 355-377, 2004.
27. P. Syverson, G. Tsudik, M. Reed, and C. Landwehr, "Towards an Analysis of Onion Routing Security," in Proc. Workshop on Design Issues in Anonymity and Unobservability (WDIAU), 2000, pp. 96-114.
28. "The Tor Project," https://www.torproject.org/, 2003, accessed Nov 2011.
29. D. Wikström, "A universally composable mix-net," in Proc. of the 1st Theory of Cryptography Conference (TCC), 2004, pp. 317-335.
30. Y. Zhang, "Effective attacks in the tor authentication protocol," in NSS '09, 2009, pp. 81-86.