Andrei Serjantov, George Danezis  Home/Search
Context Related
| cl.cam.ac.uk/users/aas23/paper...set.ps ovmj.org/GNUnet/papers/set.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cl.cam.ac.uk/users/aas23/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 ... (Update)
Similar documents based on text: More All
0.7: On the Anonymity of Timed Pool Mixes - Serjantov, Newman (2003) (Correct)
0.6: On the Anonymity of Message-based - Anonymity Systems Andrei (Correct)
0.6: Statistical Disclosure Attacks: Traffic Confirmation in Open.. - Danezis (Correct)
BibTeX entry: (Update)
A. Serjantov and G. Danezis. Towards an information theoretic metric for anonymity. In P. Syverson and R. Dingledine, editors, Privacy Enhancing Technologies, LNCS. San Francisco, CA, 2002. http://petworkshop.org/2002/program.html. 16 http://citeseer.ist.psu.edu/serjantov02towards.html More
@misc{ serjantov02towards,
author = "A. Serjantov and G. Danezis",
title = "Towards an information theoretic metric for anonymity",
text = "A. Serjantov and G. Danezis. Towards an information theoretic metric for
anonymity. In P. Syverson and R. Dingledine, editors, Privacy Enhancing
Technologies, LNCS. San Francisco, CA, 2002. http://petworkshop.org/2002/program.html.
16",
year = "2002",
url = "citeseer.ist.psu.edu/serjantov02towards.html" }
Citations (may not include all citations):113 The dining cryptographers problem: Unconditional sender and .. (context) - Chaum - 1988
41 return addresses and digital pseudonyms (context) - Chaum, mail - 1981
41 Stop-and-go-MIXes providing probabilistic anonymity in an op.. - Kesdogan, Egner et al. - 1998
33 Mixing email with Babel (context) - Gulcu, Tsudik - 1996
32 The disadvantages of free MIX routes and how to overcome the.. - Berthold, tzmann et al. - 2000
27 Mixmaster and remailer attacks (context) - Cottrell - 1994
12 Towards measuring anonymity - Diaz, Seys et al. - 2002
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cl.cam.ac.uk/users/aas23/):
Anonymizing Censorship Resistant Systems - Serjantov (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC