A formal treatment of onion routing

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

Volumn 3621 LNCS, Issue , 2006, Pages 169-187

  Camenisch, Jan ^a   Lysyanskaya, Anna ^b  

^a IBM RESEARCH ZURICH   (Switzerland)

^b Brown University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AD-HOC SECURITY ANALYSIS; ONION ROUTING; PRIVACY-PROTECTING PROTOCOLS; UNIVERSALLY COMPOSABLE FRAMEWORK;

COMPUTER CRIME; COMPUTER SIMULATION; COMPUTER SOFTWARE; CRYPTOGRAPHY; DATA PRIVACY; MULTITASKING; SECURITY OF DATA;

NETWORK PROTOCOLS;

EID: 33745174191     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (23)

1. M. Backes, B. Pfitzmann, and M. Waidner. A general composition theorem for secure reactive systems. In TCC 2004, vol. 2951 of LNCS, pp. 336-354.
2. O. Berthold, A. Pfitzmann, and R. Standtke. The disadvantages of free MIX routes and how to overcome them. In Proceedings of Designing Privacy Enhancing Technologies, vol. 2009 of LNCS, pp. 30-45. Springer-Verlag, July 2000.
3. J. Camenisch and V. Shoup. Practical verifiable encryption and decryption of discrete logarithms. In Advances in Cryptology - CRYPTO 2003, LNCS, 2003.
4. R. Canetti. Universally composable security. A new paradigm for cryptographic protocols. In Proc. 42nd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 136-145, 2001.
5. R. Canetti, S. Halevi, and J. Katz. A forward-secure public-key encryption scheme. In EUROCRYPT 2003, vol. 2656 of LNCS, pp. 255-271. Springer Verlag, 2003.
6. D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84-88, Feb. 1981.
7. D. Chaum. Security without identification: Transaction systems to make big brother obsolete. Communications of the ACM, 28(10):1030-1044, Oct. 1985.
8. D. Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1:65-75, 1988.
9. G. Danezis. The traffic analysis of continuous-time mixes. In Privacy Enhancing Technologies (PET), 2004.
10. R. Dingledine, N. Mathewson, and P. F. Syverson. Tor: The second-generation onion router. In USENIX Security Symposium, pp. 303-320. USENIX, 2004.
11. D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. SIAM Journal on Computing, 2000.
12. D. M. Goldschlag, M. G. Reed, and P. F. Syverson. Onion routing for anonymous and private internet connections. Comm. of the ACM, 42(2):84-88, Feb. 1999.
13. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270-299, Apr. 1984.
14. D. Kesdogan, D. Agrawal, and S. Penz. Limits of anonymity in open environments. In Information Hiding 2003, vol. 2578 of LNCS, pp. 53-69. Springer, 2003.
15. M. Luby and C. Rackoff. How to construct pseudorandom permutations and pseudorandom functions. SIAM J. Computing, 17(2):373-386, Apr. 1988.
16. B. Möller. Provably secure public-key encryption for length-preserving Chaumian mixes. In Cryptographer's Track - RSA 2003, pp. 244-262. Springer, 2003.
17. B. Pfitzmann and M. Waidner. A model for asynchronous reactive systems and its application to secure message transmission. In IEEE Symposium on Research in Security and Privacy, pp. 184-200. IEEE Computer Society Press, 2001.
18. M. K. Reiter and A. D. Rubin. Crowds: anonymity for Web transactions. ACM Transactions on Information and System Security (TISSEC), 1(1):66-92, 1998.
19. V. Shoup. A proposal for an ISO standard for public key encryption, http://eprint.iacr.org/2001/112, 2001.
20. V. Shoup. Sequences of games: a tool for taming complexity in security proofs. http://eprint.iacr.org/2004/332, 2004.
21. V. Shoup and R. Gennaro. Securing threshold cryptosystems against chosen ciphertext attack. In EUROCRYPT '98, vol. 1403 of LNCS. Springer, 1998.
22. D. Wikström. A universally composable mix-net. In Theory of Cryptography Conference, vol. 2951 of LNCS, pp. 317-335. Springer, 2004.
23. Y. Zhu, X. Fu, B. Graham, R. Bettati, and W. Zhao. On flow correlation attacks and countermeasures in mix networks. In PET, 2004.