Linking Unlinkability - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Linking Unlinkability

Résumé

Unlinkability is a privacy property of crucial importance for several systems (such as RFID or voting systems). Informally, unlinkability states that, given two events/items in a system, an attacker is not able to infer whether they are related to each other. However, in the literature we find several definitions for this notion, which are apparently unrelated and shows a potentially problematic lack of agreement. This paper sheds new light on unlinkability by comparing different ways of defining it and showing that in many practical situations the various definitions coincide. It does so by (a) expressing in a unifying framework four definitions of unlinkability from the literature (b) demonstrating how these definitions are different yet related to each other and to their dual notion of ''inseparability'' and (c) by identifying conditions under which all these definitions become equivalent. We argue that the conditions are reasonable to expect in identification systems, and we prove that they hold for a generic class of protocols.
Fichier principal
Vignette du fichier
Unlinkability.pdf (173.85 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00760150 , version 1 (03-12-2012)

Identifiants

Citer

Mayla Brusó, Konstantinos Chatzikokolakis, Sandro Etalle, Jerry den Hartog. Linking Unlinkability. TGC 2012 - 7th International Symposium on Trustworthy Global Computing, Sep 2012, Newcastle upon Tyne, United Kingdom. pp.129-144, ⟨10.1007/978-3-642-41157-1_9⟩. ⟨hal-00760150⟩
188 Consultations
583 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More