论文信息 - On the Anonymity of Timed Pool Mixes

On the Anonymity of Timed Pool Mixes

This paper presents a method for calculating the anonymity of a timed pool mix. Thus we are able to compare it to a threshold pool mix, and any future mixes that might be developed. Although we are only able to compute the anonymity of a timed pool mix after some specific number of rounds, this is a practical approximation to the real anonymity.

Richard E. Newman | Andrei Serjantov | R. Newman | A. Serjantov

[1] Bart Preneel,et al. Towards Measuring Anonymity , 2002, Privacy Enhancing Technologies.

[2] George Danezis,et al. Towards an Information Theoretic Metric for Anonymity , 2002, Privacy Enhancing Technologies.

[3] Simon L. Peyton Jones,et al. Report on the programming language Haskell: a non-strict, purely functional language version 1.2 , 1992, SIGP.

[4] Dogan Kesdogan,et al. Stop-and-Go-MIXes Providing Probabilistic Anonymity in an Open System , 1998, Information Hiding.

[5] John Hughes,et al. Report on the Programming Language Haskell 98 , 1999 .

[6] David Chaum,et al. Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.

[7] Roger Dingledine,et al. From a Trickle to a Flood: Active Attacks on Several Mix Types , 2002, Information Hiding.