Pairing-based onion routing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4776 LNCS, Issue , 2007, Pages 95-112

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

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PRIVACY; ITERATIVE METHODS; PUBLIC KEY CRYPTOGRAPHY;

CIRCUIT CONSTRUCTION; TELESCOPING METHOD;

NETWORK ROUTING;

EID: 38149092452     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75551-7_7     Document Type: Conference Paper

References (34)

1. Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil Pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213-229. Springer, Heidelberg (2001)
2. Camenisch, J., Lysyanskaya, A.: A Formal Treatment of Onion Routing. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 169-187. Springer, Heidelberg (2005)
3. Chaum, D.: Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Communications of the ACM 4(2), 84-88 (1981)
4. Chien, H., Lin, R.: Identity-based Key Agreement Protocol for Mobile Ad-hoc Networks Using Bilinear Pairing. In: SUTC'06. IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, pp. 520-529. IEEE Computer Society Press, Los Alamitos (2006)
5. Dai, W.: PipeNet 1.1. Post to Cypherpunks mailing list (November 1998)
6. Dingledine, R., Mathewson, N.: The Tor Protocol Specification (accessed February 2007), http://tor.eff.org/svn/trunk/doc/spec/tor-spec.txt
7. Dingledine, R., Mathewson, N., Syverson, P.: Tor: The Second-Generation Onion Router. In: Proceedings of the 13th USENIX Security Symposium (August 2004)
8. Dupont, R., Enge, A.: Provably secure non-interactive key distribution based on pairings. Discrete Applied Mathematics 154(2), 270-276 (2006)
9. Blake, I. (ed.): Advances in Elliptic Curve Cryptography. London Mathematical Society Lecture Note Series, vol. 317. Cambridge University Press, Cambridge (2005)
10. Frcedman, M.J., Morris, R.: Tarzan: A Peer-to-Peer Anonymizing Network Layer. In: CCS 2002. Proceedings of the 9th ACM Conference on Computer and Communications Security, ACM Press, Washington, DC (2002)
11. Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 537-554. Springer, Heidelberg (2001)
12. Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure Distributed Key Generation for Discrete-Log Based Cryptosystems. Journal of Cryptology 20(1), 51-83 (2007)
13. Goldberg, I.: On the Security of the Tor Authentication Protocol. In: Danezis, G., Golle, P. (eds.) PET 2006. LNCS, vol. 4258, pp. 316-331. Springer, Heidelberg (2006)
14. Goldschlag, D., Reed, M., Syverson, P.: Hiding Routing Information. In: Anderson, R. (ed.) Information Hiding. LNCS, vol. 1174, pp. 137-150. Springer, Heidelberg (1996)
15. Kate, A., Zaverucha, G.M., Goldberg, I.: Pairing-Based Onion Routing. Technical Report CACR, 2007-08, Centre for Applied Cryptographic Research (2007), Available at http://www.cacr.math.uwaterloo.ca/techreports/2007/ cacr2007-08.pdf
16. Khalili, A., Katz, J., Arbaugh, W.: Toward Secure Key Distribution in Truly Ad-Hoc Networks. In: IEEE Workshop on Security and Assurance in Ad-Hoc Networks 2003, pp. 342-346. IEEE Computer Society Press, Los Alamitos (2003)
17. Koblitz, N., Menezes, A.: Pairing-Based Cryptography at High Security Levels. In: Smart, N.P. (ed.) Cryptography and Coding. LNCS, vol. 3796, pp. 13-36. Springer, Heidelberg (2005)
18. Lynn, B.: PBC Library - The Pairing-Based Cryptography Library (accessed February 2007), http://crypto.stanford.edu/pbc/
19. Mauw, S., Verschuren, J., de Vink, E.: A Formalization of Anonymity and Onion Routing. In: Samarati, P., Ryan, P.Y A, Gollmann, D., Molva, R. (eds.) ESORICS 2004. LNCS, vol. 3193, pp. 109-124. Springer, Heidelberg (2004)
20. Menezes, A., Okamoto, T., Vanstone, S.: Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field. In: STOC 1991. Proc. of the twenty-third annual ACM Symposium on Theory of Computing, pp. 80-89. ACM Press, New York (1991)
21. Menezes, A., Van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography, 1st edn. CRC Press, Boca Raton, USA (1997)
22. Möller, B.: Provably Secure Public-Key Encryption for Length-Preserving Chaumian Mixes. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, Springer, Heidelberg (2003)
23. Okamoto, E., Okamoto, T.: Cryptosystems Based on Elliptic Curve Pairing. In: Torra, V., Narukawa, Y., Miyamoto, S. (eds.) MDAI2005. LNCS (LNAI), vol. 3558, pp. 13-23. Springer, Heidelberg (2005)
24. Øverlier, L., Syverson, P.: Improving efficiency and simplicity of Tor circuit establishment and hidden services. In: Borisov, N., Golle, P. (eds.) PET 2007. LNCS, vol. 4776, pp. 134-152. Springer, Heidelberg (2007)
25. Pedersen, T.: A Threshold Cryptosystem without a Trusted Party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 522-526. Springer, Heidelberg (1991)
26. Rahman, S., Inomata, A., Okamoto, T., Mambo, M., Okamoto, E.: Anonymous Secure Communication in Wireless Mobile Ad-hoc Networks. In: ICUCT 2006. LNCS, vol. 4412, pp. 140-149. Springer, Heidelberg (2006)
27. Reed, M., Syverson, P., Goldschlag, D.: Anonymous Connections and Onion Routing. IEEE Journal on Selected Areas in Communications 16(4), 482-494 (1998)
28. Rennhard, M., Plattner, B.: Introducing MorphMix: Peer-to-Peer based Anonymous Internet Usage with Collusion Detection. In: WPES 2002. Proceedings of the Workshop on Privacy in the Electronic Society, Washington, DC, USA (November 2002)
29. Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems based on pairing. In: SCIS 2000. Symposium on Cryptography and Information Security (2000)
30. Seth, A., Keshav, S.: Practical Security for Disconnected Nodes. In: IEEE ICNP Workshop on Secure Network Protocols, 2005 (NPSec), pp. 31-36. IEEE Computer Society Press, Los Alamitos (2005)
31. Shamir, A.: How to Share a Secret. Commun. ACM 22(11), 612-613 (1979)
32. Syverson, P., Tsudik, G., Reed, M., Landwehr, C.: Towards an Analysis of Onion Routing Security. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 96-114. Springer, Heidelberg (2001)
33. The Tor Project. Tor: anonymity online (accessed February 2007), http://tor.eff.org/
34. Verheul, E.: Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 195-210. Springer, Heidelberg (2001)