Weak Probabilistic Anonymity

Yuxin Deng 1 Catuscia Palamidessi 2 Jun Pang 2
2 COMETE - Concurrency, Mobility and Transactions
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France, Polytechnique - X, CNRS - Centre National de la Recherche Scientifique : UMR7161
Abstract : Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be described probabilistically. In this paper we propose a notion of weak probabilistic anonymity, where weak refers to the fact that some amount of probabilistic information may be revealed by the protocol. This information can be used by an observer to infer the likeliness that the action has been performed by a certain user. The aim of this work is to study the degree of anonymity that the protocol can still ensure, despite the leakage of information. We illustrate our ideas by using the example of the dining cryptographers with biased coins. We consider both the cases of nondeterministic and probabilistic users. Correspondingly, we propose two notions of weak anonymity and we investigate their respective dependencies on the biased factor of the coins.
Type de document :
Communication dans un congrès
Michael Backes and Andre Scedrov. 3rd International Workshop on Security Issues in Concurrency (SecCo), Aug 2005, San Francisco, United States. Elsevier Science B.V., 180 (1), pp.55-76, 2007, Electronic Notes in Theoretical Computer Science. 〈10.1016/j.entcs.2005.05.043〉
Liste complète des métadonnées

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

https://hal.inria.fr/inria-00200912
Contributeur : Catuscia Palamidessi <>
Soumis le : vendredi 21 décembre 2007 - 22:35:41
Dernière modification le : jeudi 11 janvier 2018 - 06:22:13
Document(s) archivé(s) le : mardi 13 avril 2010 - 15:09:59

Fichier

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

Identifiants

Collections

Citation

Yuxin Deng, Catuscia Palamidessi, Jun Pang. Weak Probabilistic Anonymity. Michael Backes and Andre Scedrov. 3rd International Workshop on Security Issues in Concurrency (SecCo), Aug 2005, San Francisco, United States. Elsevier Science B.V., 180 (1), pp.55-76, 2007, Electronic Notes in Theoretical Computer Science. 〈10.1016/j.entcs.2005.05.043〉. 〈inria-00200912〉

Partager

Métriques

Consultations de la notice

419

Téléchargements de fichiers

98