Abstract
In this paper we present a generalised framework for expressing batching strategies of a mix. First, we note that existing mixes can be represented as functions from the number of messages in the mix to the fraction of messages to be flushed.
We then show how to express existing mixes in the framework, and then suggest other mixes which arise out of that framework. We note that these cannot be expressed as pool mixes. In particular, we call binomial mix a timed pool mix that tosses coins and uses a probability function that depends on the number of messages inside the mix at the time of flushing. We discuss the properties of this mix.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chaum, D.: Untraceable electronic mail, return addresses and digital pseudonyms. Communications of the ACM 24(2), 84–88 (1981)
Cottrell, L.: Mixmaster and remailer attacks (1994), http://www.obscura.com/~loki/remailer/remailer-essay.html
Diaz, C., Seys, S., Claessens, J., Preneel, B.: Towards measuring anonymity. In: Dingledine, R., Syverson, P.F. (eds.) PET 2002. LNCS, vol. 2482, pp. 54–68. Springer, Heidelberg (2003), http://petworkshop.org/2002/program.html
Feller, W.: An introduction to probability theory and its applications. Wiley, Chichester (1950)
Jerichow, A.: Generalisation and Security Improvement of Mix-mediated Anonymous Communication. PhD thesis, Technischen Universitat Dresden (2000)
Kesdogan, D., Egner, J., Buschkes, R.: Stop-and-go-MIXes providing probabilistic anonymity in an open system. In: Proceedings of the International Information Hiding Workshop (April 1998)
Serjantov, A., Danezis, G.: Towards an information theoretic metric for anonymity. In: Dingledine, R., Syverson, P.F. (eds.) PET 2002. LNCS, vol. 2482, pp. 41–53. Springer, Heidelberg (2003), http://petworkshop.org/2002/program.html
Serjantov, A., Dingledine, R., Syverson, P.: From a trickle to a flood: Active attacks on several mix types. In: Petitcolas, F.A.P. (ed.) IH 2002. LNCS, vol. 2578, pp. 36–52. Springer, Heidelberg (2003)
Serjantov, A., Newman, R.E.: On the anonymity of timed pool mixes. In: Workshop on Privacy and Anonymity in Networked and Distributed Systems (18th IFIP International Information Security Conference), Athens, Greece (May 2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Díaz, C., Serjantov, A. (2003). Generalising Mixes. In: Dingledine, R. (eds) Privacy Enhancing Technologies. PET 2003. Lecture Notes in Computer Science, vol 2760. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40956-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-40956-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20610-1
Online ISBN: 978-3-540-40956-4
eBook Packages: Springer Book Archive