CAIDA Home
 papers | presentations | animations | visualizations | bibliography  
 www.caida.org > publications : bib : networking : entries : serjantov_anonymity.xml
    visit     contact     search:
CAIDA: Cooperative Association for Internet Data Analysis
Bibliography Details

-----summary of contents-----
A. Serjantov and G. Danezis, "Towards an Information Theoretic Metric for Anonymity," in Privacy Enhancing Technologies, 2002.
-----end summary of contents-----
Towards an Information Theoretic Metric for Anonymity
Authors: A. Serjantov
G. Danezis
Published: Privacy Enhancing Technologies, 2002
URL: http://citeseer.ist.psu.edu/serjantov02towards.html
ENTRY DATE: 2008-06-16
ABSTRACT: In this paper we look closely at the popular metric of anonymity, the anonymity set, and point out a number of problems associated with it. We then propose an alternative information theoretic measure of anonymity which takes into account the probabilities of users sending and receiving the messages and show how to calculate it for a message in a standard mix-based anonymity system. We also use our metric to compare a pool mix to a traditional threshold mix, which was impossible using anonymity sets. We also show how the maximum route length restriction which exists in some fielded anonymity systems can lead to the attacker performing more powerful traffic analysis. Finally, we discuss open problems and future work on anonymity measurements.

Cooperative Association for Internet Data Analysis (CAIDA)
  Last Modified: Tues Jul-8-2008 14:34:17 PDT
  Maintained by: Alex Ma
  Page URL: http://www.caida.org/publications/bib/networking/entries/serjantov_anonymity.xml