Measuring unlinkability revisited

Lars Fischer, Stefan Katzenbeisser, Claudia Eckert

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

15 Scopus citations

Abstract

Unlinkability describes the inability of an observer to decide whether certain items of interest are related or not. Privacy aware protocol designers need a consistent and meaningful unlinkability measure to asses protocols in face of different attacks. In this paper we show that entropy measures are not sufficient for measuring unlinkability. We propose an alternative measure that estimates the error made by an attacker. We show by example that our expected distance provides a consistent measure that offers a better estimation of message-unlinkability.

Original languageEnglish
Title of host publicationProceedings of the 7th ACM Workshop on Privacy in the Electronic Society, WPES'08,Co-located with the 15th ACM Computer and Communications Security Conference, CCS'08
Pages105-109
Number of pages5
DOIs
StatePublished - 2008
Externally publishedYes
Event7th ACM Workshop on Privacy in the Electronic Society, WPES'08, Co-located with the 15th ACM Computer and Communications Security Conference, CCS'08 - Alexandria, VA, United States
Duration: 27 Oct 200831 Oct 2008

Publication series

NameProceedings of the ACM Conference on Computer and Communications Security
ISSN (Print)1543-7221

Conference

Conference7th ACM Workshop on Privacy in the Electronic Society, WPES'08, Co-located with the 15th ACM Computer and Communications Security Conference, CCS'08
Country/TerritoryUnited States
CityAlexandria, VA
Period27/10/0831/10/08

Keywords

  • Anonymity
  • Mobile communication
  • Positional information
  • Unlinkability

Fingerprint

Dive into the research topics of 'Measuring unlinkability revisited'. Together they form a unique fingerprint.

Cite this