Using Linkability Information to Attack Mix-Based Anonymity Services

  • Stefan Schiffner
  • Sebastian Clauß
Conference paper

DOI: 10.1007/978-3-642-03168-7_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5672)
Cite this paper as:
Schiffner S., Clauß S. (2009) Using Linkability Information to Attack Mix-Based Anonymity Services. In: Goldberg I., Atallah M.J. (eds) Privacy Enhancing Technologies. PETS 2009. Lecture Notes in Computer Science, vol 5672. Springer, Berlin, Heidelberg


There exist well established models for anonymity focusing on traffic analysis, i. e., analysing properties of single messages as, e. g., timing. However there is only little work done that use linkability information, that is information about the probability that two messages have been sent by the same sender.

In this paper we model information about linkability between messages as a weighted graph. We show lower and upper bounds with regards to the usefulness of linkability information for matching messages to senders. In addition to that we present simulation results, showing to which extent a matching of messages to senders is possible by using linkability information with different grades of noise.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Stefan Schiffner
    • 1
  • Sebastian Clauß
    • 2
  1. 1.K.U.Leuven, ESAT/SCD/COSIC and IBBTLeuven-HeverleeBelgium
  2. 2.Institute of Systems ArchitectureTechnische Universität DresdenDresdenGermany

Personalised recommendations