Probabilistic Anonymity - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2005

Probabilistic Anonymity


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.
Fichier principal
Vignette du fichier
concur.pdf (285.36 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00201101 , version 1 (23-12-2007)



Mohit Bhargava, Catuscia Palamidessi. Probabilistic Anonymity. CONCUR'05, Aug 2005, San Francisco, United States. pp.171-185, ⟨10.1007/11539452_16⟩. ⟨inria-00201101⟩
276 View
294 Download



Gmail Facebook Twitter LinkedIn More