Probabilistic Anonymity

Mohit Bhargava 1 Catuscia Palamidessi 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 : The concept of anonymity comes into play in a wide range of situations, varying from voting and anonymous donations to postings on bulletin boards and sending mails. The systems for ensuring anonymity often use random mechanisms which can be described probabilistically, while the agents' interest in performing the anonymous action may be totally unpredictable, irregular, and hence expressible only nondeterministically. Formal definitions of the concept of anonymity have been investigated in the past either in a totally nondeterministic framework, or in a purely probabilistic one. In this paper, we investigate a notion of anonymity which combines both probability and nondeterminism, and which is suitable for describing the most general situation in which both the systems and the user can have both probabilistic and nondeterministic behavior. We also investigate the properties of the definition for the particular cases of purely nondeterministic users and purely probabilistic users. We formulate our notions of anonymity in terms of observables for processes in the probabilistic pi-calculus, whose semantics is based on Probabilistic Automata. We illustrate our ideas by using the example of the dining cryptographers.
Type de document :
Communication dans un congrès
Martin Abadi and Luca de Alfaro. CONCUR'05, Aug 2005, San Francisco, United States. Springer, 3653, pp.171-185, 2005, Lecture Notes in Computer Science. 〈10.1007/11539452_16〉
Liste complète des métadonnées

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

https://hal.inria.fr/inria-00201101
Contributeur : Catuscia Palamidessi <>
Soumis le : dimanche 23 décembre 2007 - 17:15:15
Dernière modification le : jeudi 11 janvier 2018 - 01:49:34
Document(s) archivé(s) le : mardi 13 avril 2010 - 15:31:03

Fichier

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

Identifiants

Collections

Citation

Mohit Bhargava, Catuscia Palamidessi. Probabilistic Anonymity. Martin Abadi and Luca de Alfaro. CONCUR'05, Aug 2005, San Francisco, United States. Springer, 3653, pp.171-185, 2005, Lecture Notes in Computer Science. 〈10.1007/11539452_16〉. 〈inria-00201101〉

Partager

Métriques

Consultations de la notice

530

Téléchargements de fichiers

194