Abstract
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.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-0-387-35691-4_52
Chapter PDF
Similar content being viewed by others
Keywords
- Interarrival Time
- Rigorous Comparison
- Pseudonym Communication
- Message Arrival
- Privacy Enhance Technology
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Chaum, D. (1981). Untraceable electronic mail, return addresses and digital pseudonyms Communications of the A.C.M., 24 (2): 84–88.
Cottrell, L. (1994). Mixmaster and remailer attacks. http://www.obscura.com/“loki/remailer/remailer-es say.html.
Diaz, C., Seys, S., Claessens, J., and Preneel, B. (2002). Towards measuring anonymity. In Privacy Enhancing Technologies,volume 2482 of LNCS.
Jerichow, A. (2000). Generalisation and Security Improvement of Mix-mediated Anonymous Communication. PhD thesis, Technischen Universitat Dresden.
Kesdogan, D., Egner, J., and Buschkes, R. (1998). Stop-and-go-MlXes providing probabilistic anonymity in an open system. In Proceedings of the International Information Hiding Workshop.
Peyton Jones, S., Hughes, J., et al. (1999). Report on the programming language Haskell 98, a non-strict., purely functional language. http://www.haskell.org/.
Serjantov, A. and Danezis, G. (2002). Towards an information theoretic metric for anonymity. In Privacy Enhacing Technologies,volume 2482 of LNCS,San Francisco, CA.
Serjantov, A., Dingledine, R., and Syverson, P. (2002). From a trickle to a flood: Active attacks on several mix types. In 5th Workshop on Information Hiding,volume 2578 of LNCS.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 IFIP International Federation for Information Processing
About this paper
Cite this paper
Serjantov, A., Newman, R.E. (2003). On the Anonymity of Timed Pool Mixes. In: Gritzalis, D., De Capitani di Vimercati, S., Samarati, P., Katsikas, S. (eds) Security and Privacy in the Age of Uncertainty. SEC 2003. IFIP — The International Federation for Information Processing, vol 122. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35691-4_41
Download citation
DOI: https://doi.org/10.1007/978-0-387-35691-4_41
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6489-5
Online ISBN: 978-0-387-35691-4
eBook Packages: Springer Book Archive