We perform a probabilistic analysis of onion routing. The analysis is presented in a black-box model of anonymous communication in the Universally Composable framework that abstracts the essential properties of onion routing in the presence of an active adversary that c... View more
BAUER, K., MCCOY, D., GRUNWALD, D., KOHNO, T., AND SICKER, D. 2007. Low-resource routing attacks against Tor. In Proceedings of the Workshop on Privacy in the Electronic Society (WPES 2007). Washington, DC, USA.
BEIMEL, A. AND DOLEV, S. 2003. Buses for anonymous message delivery. Journal of Cryptology 16, 1, 25- 39.
BROWN, Z. 2002. Cebolla: Pragmatic IP anonymity. In Proceedings of the 2002 Ottawa Linux Symposium.
CAMENISCH, J. AND LYSYANSKAYA, A. 2005. A formal treatment of onion routing. In Proceedings of CRYPTO 2005. 169-187.
CANETTI, R. 2000. Universally composable security: A new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000/067. http://eprint.iacr.org/.
CHAUM, D. 1981. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM 4, 2, 84-88.
CHAUM, D. 1988. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology: The Journal of the International Association for Cryptologic Research 1, 1, 65-75.
CORRIGAN-GIBBS, H. AND FORD, B. 2010. Dissent: accountable anonymous group messaging. In Proceedings of the 17th ACM conference on Computer and communications security (CCS 2010). CCS '10. 340- 350.
DANEZIS, G. 2003. Statistical disclosure attacks: Traffic confirmation in open environments. In Proceedings of Security and Privacy in the Age of Uncertainty (SEC 2003). 421-426.
DANEZIS, G. AND SERJANTOV, A. 2004. Statistical disclosure or intersection attacks on anonymity systems. In Proceedings of 6th Information Hiding Workshop (IH 2004). 293-308.