Using sphinx to improve onion routing circuit construction

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

Volumn 6052 LNCS, Issue , 2010, Pages 359-366

  Kate, Aniket ^a   Goldberg, Ian ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CERTIFICATELESS; CIRCUIT CONSTRUCTION; DIFFIE-HELLMAN VALUES; MESSAGE FORMAT; ONION ROUTING; UNIVERSAL COMPOSABILITY;

CRYPTOGRAPHY; NETWORK PROTOCOLS;

NETWORK SECURITY;

EID: 77955333322     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14577-3_30     Document Type: Conference Paper

References (19)

1. Kate, A., Goldberg, I.: Using Sphinx to Improve Onion Routing Circuit Construction. Technical Report CACR 2009-33 (2009), http://www.cacr.math. uwaterloo.ca/techreports/2009/cacr2009-33.pdf
2. Goldschlag, D.M., Reed, M., Syverson, P.: Hiding Routing Information. In: Information Hiding: First International Workshop, pp. 137-150 (1996)
3. Reed, M., Syverson, P., Goldschlag, D.: Anonymous Connections and Onion Routing. IEEE J-SAC 16(4), 482-494 (1998)
4. Dai, W.: PipeNet 1.1 (1998), www.weidai.com/pipenet.txt (accessed November 2009)
5. Dingledine, R., Mathewson, N., Syverson, P.: Tor: The Second-Generation Onion Router. In: 13th USENIX Security Symposium, pp. 303-320 (2004)
6. Freedman, M.J., Morris, R.: Tarzan: A Peer-to-Peer Anonymizing Network Layer. In: CCS 2002, pp. 193-206. ACM, New York (2002)
7. The Tor Project: (2003), https://www.torproject.org/ (accessed November 2009)
8. Øverlier, L., Syverson, P.: Improving Efficiency and Simplicity of Tor Circuit Establishment and Hidden Services. In: PETS 2007, pp. 134-152 (2007)
9. Menezes, A., Oorschot, P.V., Vanstone, S.: Handbook of Applied Cryptography, 1st edn. CRC Press, Boca Raton (1997)
10. Kate, A., Zaverucha, G.M., Goldberg, I.: Pairing-Based Onion Routing. In: PETS 2007, pp. 95-112 (2007)
11. Catalano, D., Fiore, D., Gennaro, R.: Certificateless Onion Routing. In: CCS 2009, pp. 151-160 (2009)
12. Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. In: FOCS 2001, pp. 136-145 (2001)
13. 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)
14. Danezis, G., Goldberg, I.: Sphinx: A Compact and Provably Secure Mix Format. In: IEEE Symposium on Security and Privacy, pp. 269-282 (2009)
15. Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems Based on Pairing. In: Symposium on Cryptography and Information Security (SCIS 2000), Japan (2000)
16. Galbraith, S.D., Paterson, K.G., Smart, N.P.: Pairings for Cryptographers. Discrete Applied Mathematics 156(16), 3113-3121 (2008)
17. Al-Riyami, S.S., Paterson, K.G.: Certificateless Public Key Cryptography. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.2894, pp. 452-473. Springer, Heidelberg (2003)
18. Bernstein, D.J.: Curve25519: New Diffie-Hellman Speed Records. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol.3958, pp. 207-228. Springer, Heidelberg (2006)
19. Evans, N.S., Dingledine, R., Grothoff, C.: A Practical Congestion Attack on Tor Using Long Paths. In: 18th USENIX Security Symposium, pp. 33-50 (2009)