Skip to Main content Skip to Navigation
Conference papers

Weak Probabilistic Anonymity

Yuxin Deng 1 Catuscia Palamidessi 2 Jun Pang 2
2 COMETE - Concurrency, Mobility and Transactions
Inria Saclay - Ile de France, LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
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.
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Catuscia Palamidessi <>
Submitted on : Friday, December 21, 2007 - 10:35:41 PM
Last modification on : Friday, March 27, 2020 - 2:55:50 AM
Long-term archiving on: : Tuesday, April 13, 2010 - 3:09:59 PM


Files produced by the author(s)




Yuxin Deng, Catuscia Palamidessi, Jun Pang. Weak Probabilistic Anonymity. 3rd International Workshop on Security Issues in Concurrency (SecCo), Aug 2005, San Francisco, United States. pp.55-76, ⟨10.1016/j.entcs.2005.05.043⟩. ⟨inria-00200912⟩



Record views


Files downloads