Towards measuring anonymity

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

Volumn 2482, Issue , 2003, Pages 54-68

  Díaz, Claudia ^a   Seys, Stefaan ^a   Claessens, Joris ^a   Preneel, Bart ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AMOUNT OF INFORMATION; EXISTING SYSTEMS; PROBABILISTIC INFORMATION; PROOF OF CONCEPT; THEORETIC MODEL; VARIOUS ATTACKS;

INFORMATION THEORY;

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

References (12)

1. O. Berthold, H. Federrath and S. Köpsell. Web MIXes: A System for Anonymous and Unobservable Internet Access. In Hannes Federath (Ed.), Designing Privacy Enhancing Technologies, Lecture Notes in Computer Science, LNCS 2009, pp. 115-129, Springer-Verlag, 2001.
2. O. Berthold, A. Pfiztmann and R. Standtke. The Disavantages of Free MIX Routes and How to Overcome Them. In Hannes Federath (Ed.), Designing Privacy Enhancing Technologies, Lecture Notes in Computer Science, LNCS 2009, pp. 30-45, Springer-Verlag, 2001.
3. D. Chaum. Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Communications of the ACM, Vol. 24, No. 2, pp. 84-88, 1981.
4. T. M. Cover and J. A. Thomas. Elements of Information Theory. John Wiley & Sons, Inc., 1991. ISBN 0-471-06259-6.
5. W. Feller. An Introduction to Probability Theory and its Applications. John Wiley & Sons, Inc., Third edition, 1968.
6. A. Pfitzmann and M. Köhntopp. Anonymity, Unobservability and Pseudonymity - A Proposal for Terminology. In Hannes Federath (Ed.), Designing Privacy Enhancing Technologies, Lecture Notes in Computer Science, LNCS 2009, pp. 1-9, Springer-Verlag, 2001.
7. J.-F. Raymond. Traffic Analysis: Protocols, Attacks, Design Issues, and Open Problems. In Hannes Federath (Ed.), Designing Privacy Enhancing Technologies, Lecture Notes in Computer Science, LNCS 2009, pp. 10-29, Springer-Verlag, 2001.
8. M. G. Reed, P. F. Syverson and D. Goldschlag. Anonymous Connections and Onion Routing. IEEE Journal on Selected Areas in Communication. Special Issue on Copyright and Privacy Protection, 1998.
9. M. K. Reiter and A. D. Rubin. Crowds: Anonymity for Web Transactions. Communications of the ACM, Vol. 42, No. 2, pp. 32-48, 1999.
10. A. Serjantov and G. Danezis. Towards an Information Theoretic Metric for Anonymity. In Hannes Federath (Ed.), Designing Privacy Enhancing Technologies, Lecture Notes in Computer Science, 2002.
11. C. E. Shannon. A Mathematical Theory Of Communication. Bell System Tech. J., 27: 379-423; 623-656, 1948.
12. M. Wright, M. Adler, B. Levine and C. Shields. An Analysis of the Degradation of Anonymous Protocols. In Proceedings of Network and Distributed System Security Symposium, February 2002.