Pairing-based onion routing with improved forward secrecy

ACM Transactions on Information and System Security

Volumn 13, Issue 4, 2010, Pages

  Kate, Aniket ^a   Zaverucha, Greg M ^a   Goldberg, Ian ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Anonymous key agreement; Forward secrecy; Onion routing; Pairing based cryptography; Tor

Indexed keywords

FORWARD SECRECY; KEY AGREEMENT; ONION ROUTING; PAIRING-BASED CRYPTOGRAPHY; TOR;

CRYPTOGRAPHY; NETWORK PROTOCOLS;

NETWORK SECURITY;

EID: 78651394431     PISSN: 10949224     EISSN: 15577406     Source Type: Journal    
DOI: 10.1145/1880022.1880023     Document Type: Article

References (37)

1. BLAKE, I., SEROUSSI, G., AND SMART, N. P., Eds. 2005. Advances in Elliptic Curve Cryptography. London Mathematical Society Lecture Note Series, No. 317, Cambridge University Press, Cambridge, UK. 183-252.
2. BONEH, D. AND FRANKLIN, M. 2001. Identity-based encryption from the weil pairing. In Proceedings of the International Cryptology Conference, Advances in Cryptology (CRYPTO'01). Lecture Notes in Computer Science, vol. 2139, Springer, 213-229.
3. CAMENISCH, J. AND LYSYANSKAYA, A. 2005. A formal treatment of onion routing. In Proceedings of the International Cryptology Conference, Advances in Cryptology (CRYPTO'05). Lecture Notes in Computer Science, vol. 3621, Springer, 169-187.
4. CANETTI, R. 2001. Universally composable security: A new paradigm for cryptographic protocols. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS'01). IEEE Computer Society, 136-145.
5. CANETTI, R., HALEVI, S., AND KATZ, J. 2007. A forward-secure public-key encryption scheme. J. Cryptol. 20, 3, 265-294.
6. CHAUM, D. 1981. Untraceable electronic mail, return addresses, and digital pseudonyms. Comm. ACM 4, 2, 84-88.
7. CHIEN, H. AND LIN, R. 2006. Identity-based key agreement protocol for mobile ad-hoc networks using bilinear pairing. In Proceedings of the IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC'06). IEEE Computer Society, 520-529.
8. CORON, J.-S. 2000. On the exact security of full domain hash. In Proceedings of the International Cryptology Conference, Advances in Cryptology (CRYPTO'00). Lecture Notes in Computer Science, vol. 1880, Springer, 229-235.
9. DAI, W. 1998. PipeNet 1.1. http://www.weidai.com/pipenet.txt.
10. DINGLEDINE, R. AND MATHEWSON, N. 2008. Tor protocol specification. https://www.torproject.org/svn/trunk/doc/spec/tor-spec.txt.
11. DINGLEDINE, R., MATHEWSON, N., AND SYVERSON, P. 2004. Tor: The second-generation onion router. In Proceedings of the 13th USENIX Security Symposium. USENIX, 303-320.
12. DUPONT, R. AND ENGE, A. 2006. Provably secure non-interactive key distribution based on pairings. Discr. Appl. Math. 154, 2, 270-276.
13. 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). ACM, 193-206.
14. GOLDBERG, I. 2006. On the security of the tor authentication protocol. In Proceedings of the 6th Workshop on Privacy Enhancing Technologies (PET'06). Lecture Notes in Computer Science, vol. 4258, Springer, 316-331.
15. GOLDSCHLAG, D., REED, M., AND SYVERSON, P. 1996. Hiding routing information. In Proceedings of the 1st Internationa Workshop on Information Hiding. Lecture Notes in Computer Science, vol. 1174, Springer, 137-150.
16. HUANG, D. 2007. Pseudonym-based cryptography for anonymous communications in mobile ad hoc networks. Int. J. Secur. Netw. 2, 3-4, 272-283.
17. KATE, A. AND GOLDBERG, I. 2007. A distributed private-key generator for identity-based cryptography. Tech. rep. CACR 2007-33, Centre for Applied Cryptographic Research. http://www.cacr.math.uwaterloo.ca/techreports/2007/ cacr2007-33.pdf.
18. KATE, A., ZAVERUCHA, G. M., AND GOLDBERG, I. 2007a. Pairing-based onion routing. In Proceedings of the 7th Privacy Enhancing Technologies Symposium (PETS'07). Lecture Notes in Computer Science, vol. 4776, Springer, 95-112.
19. KATE, A., ZAVERUCHA, G. M., AND HENGARTNER, U. 2007b. Anonymity and security in delay tolerant networks. In Proceedings of the 3rd International Conference on Security and Privacy in Communication Networks (SecureComm'07). IEEE Computer Society, 504-513.
20. KHALILI, A., KATZ, J., AND ARBAUGH, W. 2003. Toward secure key distribution in truly ad-hoc networks. In Proceedings of the IEEE Workshop on Security and Assurance in Ad-Hoc Networks. IEEE Computer Society, 342-346.
21. KOBLITZ, N. AND MENEZES, A. 2005. Pairing-based cryptography at high security levels. In Proceedings of the 10th IMA International Conference on Cryptography and Coding. Lecture Notes in Computer Science, vol. 3796, Springer, 13-36.
22. LYNN, B. 2008. PBC library-The pairing-based cryptography library. http://crypto.stanford.edu/pbc/.
23. MAUW, S., VERSCHUREN, J., AND DE VINK, E. 2004. A formalization of anonymity and onion routing. In Proceedings of the 9th European Symposium on Research Computer Security (ESORICS'04). Lecture Notes in Computer Science, vol. 3193, Springer, 109-124.
24. MENEZES, A., OKAMOTO, T., AND VANSTONE, S. 1991. Reducing elliptic curve logarithms to logarithms in a finite field. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC'91). ACM, 80-89.
25. MENEZES, A., OORSCHOT, P. V., AND VANSTONE, S. 1997. Handbook of Applied Cryptography 1st Ed. CRC Press, Boca Raton, FL.
26. MÖLLER, B. 2003. Provably secure public-key encryption for length-preserving chaumian mixes. In Proceedings of the Cryptographers Track at the RSA Conference (CT-RSA'03). Lecture Notes in Computer Science, vol. 2612, Springer, 244-262.
27. OKAMOTO, E. AND OKAMOTO, T. 2005. Cryptosystems based on elliptic curve pairing. In Proceedings of the Conference on Modeling Decisions for Artificial Intelligence (MDAI'05). Lecture Notes in Computer Science, vol. 3558, Springer, 13-23.
28. ØVERLIER, L. AND SYVERSON, P. 2007. Improving efficiency and simplicity of tor circuit establishment and hidden services. In Proceedings of the 7th Privacy Enhancing Technologies Symposium (PETS'07). Lecture Notes in Computer Science, vol. 4776, Springer, 134-152.
29. RAHMAN, S., INOMATA, A., OKAMOTO, T., MAMBO, M., AND OKAMOTO, E. 2006. Anonymous secure communication in wireless mobile ad-hoc networks. In Proceedings of the 1st International Conference on Ubiquitous Convergence Technology (ICUCT'06). Lecture Notes in Computer Science, vol. 4412, Springer, 140-149.
30. REED, M., SYVERSON, P., AND GOLDSCHLAG, D. 1998. Anonymous connections and onion routing. IEEE J. Select. Areas Comm. 16, 4, 482-494.
31. RENNHARD, M. AND PLATTNER, B. 2002. Introducing MorphMix: Peer-to-peer based anonymous internet usage with collusion detection. In Proceedings of the Workshop on Privacy in the Electronic Society (WPES'02). ACM, 91-102.
32. SAKAI, R., OHGISHI, K., AND KASAHARA, M. 2000. Cryptosystems based on pairing. In Proceedings of the Symposium on Cryptography and Information Security (SCIS'00).
33. SETH, A. AND KESHAV, S. 2005. Practical security for disconnected nodes. In Proceedings of the IEEE ICNP Workshop on Secure Network Protocols (NPSec'05). IEEE Computer Society, 31-36.
34. SHAMIR, A. 1979. How to share a secret. Comm. ACM 22, 11, 612-613.
35. SYVERSON, P., TSUDIK, G., REED, M., AND LANDWEHR, C. 2000. Towards an analysis of onion routing security. In Proceedings of the Designing Privacy Enhancing Technologies: Workshop on Design Issues in Anonymity and Unobservability. Lecture Notes in Computer Science, vol. 2009, Springer, 96-114.
36. TOR PROJECT. 2008. Tor: Anonymity online. https://www.torproject.org/.
37. VERHEUL, E. 2001. Evidence that XTR is more secure than supersingular elliptic curve cryptosystems. In Proceedings of the International Cryptology Conference, Advances in Cryptology (Eurocrypt'01). Lecture Notes in Computer Science, vol. 2045, Springer, 195-210.