Modelling unlinkability

Research output: Contribution to book/conference proceedings/anthology/reportChapter in book/anthology/reportContributedpeer-review

Contributors

Abstract

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.

Details

Original languageEnglish
Title of host publicationPrivacy Enhancing Technologies
EditorsRoger Dingledine
PublisherSpringer, Berlin [u. a.]
Pages32-47
Number of pages16
ISBN (print)9783540409564
Publication statusPublished - 2003
Peer-reviewedYes

Publication series

SeriesLecture Notes in Computer Science, Volume 2760
ISSN0302-9743

External IDs

ORCID /0000-0002-0466-562X/work/142246144

Keywords

Research priority areas of TU Dresden

Library keywords