Probable Innocence Revisited - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Probable Innocence Revisited


In this paper we propose a formalization of probable innocence, a notion of probabilistic anonymity that is associated to “realistic” protocols such as Crowds. We analyze critically two different definitions of probable innocence from the literature. The first one, corresponding to the property that Reiter and Rubin have proved for Crowds, aims at limiting the probability of detection. The second one, by Halpern and O'Neill, aims at constraining the attacker's confidence. Our proposal combines the spirit of both these definitions while generalizing them. In particular, our definition does not need symmetry assumptions, and it does not depend on the probabilities of the users to perform the action of interest. We show that, in case of a symmetric system, our definition corresponds exactly to the one of Reiter and Rubin. Furthermore, in the case of users with uniform probabilities, it amounts to a property similar to that of Halpern and O'Neill. Another contribution of our paper is the study of probable innocence in the case of protocol composition, namely when multiple runs of the same protocol can be linked, as in the case of Crowds.
Fichier principal
Vignette du fichier
reportPI.pdf (181.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

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


  • HAL Id : inria-00201109 , version 1


Konstantinos Chatzikokolakis, Catuscia Palamidessi. Probable Innocence Revisited. Third International Workshop on Formal Aspects in Security and Trust (FAST 2005), Jul 2005, Newcastle Upon Tyne, United Kingdom. pp.142-157. ⟨inria-00201109⟩
346 View
164 Download


Gmail Facebook Twitter LinkedIn More