Weak Probabilistic Anonymity - Archive ouverte HAL Access content directly
Conference Papers Year : 2007

Weak Probabilistic Anonymity

(1) , (2) , (2)
1
2

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

Dates and versions

inria-00200912 , version 1 (21-12-2007)

Identifiers

Cite

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⟩
315 View
104 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More