Mix-networks with restricted routes

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

Volumn 2760, Issue , 2003, Pages 1-17

  Danezis, George ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Anonymity; Mix cascades; Mix networks; Traffic analysis

Indexed keywords

DATA PRIVACY;

ANONYMITY; EXPANDER GRAPHS; INTERSECTION ATTACKS; MIX CASCADES; MIX NETWORKS; ROUTE LENGTH; TRAFFIC ANALYSIS; WORKED EXAMPLES;

TOPOLOGY;

EID: 35248866624     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40956-4_1     Document Type: Article

References (26)

1. Oliver Berthold, Hannes Federrath, and Stefan Köpsell. Web MIXes: A system for anonymous and unobservable Internet access. In Designing Privacy Enhancing Technologies, LNCS Vol. 2009, pages 115-129. Springer-Verlag, 2000.
2. Oliver Berthold, Andreas Pfitzmann, and Ronny Standtke. The disadvantages of free MIX routes and how to overcome them. In Designing Privacy Enhancing Technologies, LNCS Vol. 2009, pages 30-45. Springer-Verlag, 2000.
3. P. Boucher, I. Goldberg, and A. Shostack. Freedom system 2.0 architecture. http://www.freedom.net/info/whitepapers/, December 2000. Zero-Knowledge Sytems, Inc.
4. David Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 4(2), February 1981.
5. George Danezis. Statistical disclosure attacks. In Sec 2003, May 2003. http://www.cl.cam.ac.uk/∼gd216/StatDisclosure.pdf.
6. George Danezis, Roger Dingledine, and Nick Mathewson. Mixminion: Design of a Type III Anonymous Remailer Protocol. In IEEE Security and Privacy Symposium, 2003.
7. Claudia Diaz, Stefaan Seys, Joris Claessens, and Bart Preneel. Towards measuring anonymity. In Privacy Enhancing Technologies Workshop 2002, April 2002.
8. Roger Dingledine, Michael J. Freedman, David Hopwood, and David Molnar. A reputation system to increase MIX-net reliability. Lecture Notes in Computer Science, 2137:126-141, 2001.
9. Roger Dingledine and Paul Syverson. Reliable MIX Cascade Networks through Reputation. Proceedings of Financial Cryptography 2002.
10. David Gillman. A chernoff bound for random walks on expander graphs. In IEEE Symposium on Foundations of Computer Science, pages 680-691, 1993.
11. Yair Glasner. Ramanujan graphs with small girth.
12. D. Goldschlag, M. Reed, and P. Syverson. Onion routing for anonymous and private internet connections. Communications of the ACM (USA), 42(2):39-41, 1999.
13. C. Gulcu and G. Tsudik. Mixing E-mail with Babel. In Network and Distributed Security Symposium - NDSS '96. IEEE, 1996.
14. Anja Jerichow, Jan Müller, Andreas Pfitzmann, Birgit Pfitzmann, and Michael Waidner. Real-Time MIXes: A Bandwidth-Efficient Anonymity Protocol. IEEE Journal on Selected Areas in Communications, 1998.
15. Dogan Kesdogan, Dakshi Agrawal, and Stefan Penz. Limits of anonymity in open environments. In Information Hiding, 5th International Workshop, Noordwijkerhout, The Netherlands, October 2002. Springer Verlag.
16. Nati Linial and Avi Wigderson. Expander graphs and their applications. Collection of Lecture Notes http://www.math.ias.edu/∼avi/TALKS/expander_course.pdf, January 2003.
17. Christian Mock. Mixmaster stats (Austria). http://www.tahina.priv.at/∼cm/stats/mlist2.html.
18. Ulf Möller and Lance Cottrell. Mixmaster Protocol-Version 2. Unfinished draft, January 2000. http://www.eskimo.com/∼rowdenw/crypt/Mix/draft-moeller-mixmaster2-protocol- 00.txt.
19. Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge Univerisity Press, 1995.
20. A. Pfitzmann, B. Pfitzmann, and M. Waidner. Isdnmixes: Untraceable communication with very small bandwidth overhead, 1991.
21. Andreas Pfitzmann and Marit Kohntopp. Anonymity, unobservability and pseudonymity - a proposal for terminology. In Designing Privacy Enhancing Technologies: Proceedings of the International Workshop on the Design Issues in Anonymity and Observability, number 2009 in LNCS, pages 1-9. Springer-Verlag, July 2000.
22. M. S. Pinsker. On the complexity of a concentrator. In Proceedings of the 7th International Teletraffic Conference, pages 318/1-318/4, Stockholm, 1973.
23. Omer Reingold, Salil P. Vadhan, and Avi Wigderson. Entropy waves, the zigzag graph product, and new constant-degree expanders and extractors. In IEEE Symposium on Foundations of Computer Science, pages 3-13, 2000.
24. Andrei Serjantov and George Danezis. Towards an information theoretc metric for anonymity. In Privacy Enhancing Technologies Workshop 2002, San Francisco, CA, May 2002.
25. Andrei Serjantov, Roger Dingledine, and Paul Syverson. From a trickle to a flood: Active attacks on several mix types. In Fabien A.P. Petitcolas, editor, Information Hiding Workshop, number 2578 in LNCS, pages 36-52. Springer-Verlag, 2002.
26. P. Syverson, M. Reed, and D. Goldschlag. Private web browsing. Journal of Computer Security, 5(3):237-248, 1997.