Towards an information theoretic metric for anonymity

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

Volumn 2482, Issue , 2003, Pages 41-53

  Serjantov, Andrei ^a   Danezis, George ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ALTERNATIVE INFORMATION; ANONYMITY SETS; ROUTE LENGTH; TRAFFIC ANALYSIS;

INFORMATION THEORY;

EID: 84957802536     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36467-6_4     Document Type: Conference Paper

References (12)

1. O. Berthold, A. Pfitzmann, and R. Standtke. The disadvantages of free MIX routes and how to overcome them. In Designing Privacy Enhancing Technologies: Proceedings of the International Workshop on the Design Issues in Anonymity and Observability, LNCS 2009. 2000.
2. D. Chaum. Untraceable electronic mail, return addresses and digital pseudonyms. Communications of the A.C.M., 24(2): 84-88, 1981.
3. D. Chaum. 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, 1988.
4. L. Cottrell. Mixmaster and remailer attacks, 1994. http://www.obscura.com/~loki/remailer/remailer-essay.html.
5. C. Diaz, S. Seys, J. Claessens, and B. Preneel. Towards measuring anonymity. In Workshop on Privacy Enhancing Technologies, LNCS 2482. 2002.
6. C. Gulcu and G. Tsudik. Mixing email with Babel. In 1996 Internet Society Symposium on Network and Distributed Sytem Security, pages 2-16, San Diego, CA, 1996.
7. D. Kesdogan, J. Egner, and R. Buschkes. Stop-and-go-MIXes providing probabilistic anonymity in an open system. In Proceedings of the International Information Hiding Workshop, LNCS 1525. 1998.
8. U. Moeller and L. Cottrell. Mixmaster Protocol Version 3, 2000. http://www.eskimo.com/~rowdenw/crypt/Mix/draft-moeller-v3-01.txt.
9. M. Ohkubo and M. Abe. A length-invariant hybrid mix. In T. Okamoto, editor, Advances in Cryptology - ASIACRYPT, LNCS 1976, page 178ff. 2000.
10. A. Pfitzmann and M. 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, LNCS 2009. 2000.
11. C. Shannon. The mathematical theory of communication. Bell Systems Technical Journal, 30: 50-64, 1948.
12. P. F. Syverson, G. Tsudik, M. G. Reed, and C. E. Landwehr. Towards an analysis of onion routing security. In Designing Privacy Enhancing Technologies: Proceedings of the International Workshop on the Design Issues in Anonymity and Observability, LNCS 2009. 2000.