Linking Unlinkability

Mayla Brusó 1 Konstantinos Chatzikokolakis 2, 3 Sandro Etalle 4, 1 Jerry Den Hartog 1
2 COMETE - Concurrency, Mobility and Transactions
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR7161
Abstract : 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.
Type de document :
Communication dans un congrès
Catuscia Palamidessi, Mark Ryan. TGC 2012 - 7th International Symposium on Trustworthy Global Computing, Sep 2012, Newcastle upon Tyne, United Kingdom. Springer, Lecture Notes in Computer Science, 8191, pp.129-144, 2013, TGC 2012: Trustworthy Global Computing. 〈10.1007/978-3-642-41157-1_9〉
Liste complète des métadonnées

Littérature citée [27 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00760150
Contributeur : Catuscia Palamidessi <>
Soumis le : lundi 3 décembre 2012 - 15:20:43
Dernière modification le : jeudi 10 mai 2018 - 02:06:52
Document(s) archivé(s) le : lundi 4 mars 2013 - 03:50:27

Fichier

Unlinkability.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Mayla Brusó, Konstantinos Chatzikokolakis, Sandro Etalle, Jerry Den Hartog. Linking Unlinkability. Catuscia Palamidessi, Mark Ryan. TGC 2012 - 7th International Symposium on Trustworthy Global Computing, Sep 2012, Newcastle upon Tyne, United Kingdom. Springer, Lecture Notes in Computer Science, 8191, pp.129-144, 2013, TGC 2012: Trustworthy Global Computing. 〈10.1007/978-3-642-41157-1_9〉. 〈hal-00760150〉

Partager

Métriques

Consultations de la notice

281

Téléchargements de fichiers

191