While there have been made several proposals to define and measure anonymity (e.g., with information theory, formal languages and logics) unlinkability has not been modelled generally and formally. In contrast to anonymity unlinkability is not restricted to persons. In fact the unlinkability of arbitrary items can be measured. In this paper we try to formalise the notion of unlinkability, give a refinement of anonymity definitions based on this formalisation and show the impact of unlinkability on anonymity. We choose information theory as a method to describe unlinkability because it allows an easy probabilistic description. As an illustration for our formalisation we describe its meaning for communication systems. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Steinbrecher, S., & Köpsell, S. (2003). Modelling unlinkability. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2760, 32–47. https://doi.org/10.1007/978-3-540-40956-4_3
Mendeley helps you to discover research relevant for your work.