Modular Reasoning about Differential Privacy in a Probabilistic Process Calculus - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Modular Reasoning about Differential Privacy in a Probabilistic Process Calculus

Abstract

The verification of systems for protecting sensitive and confidential information is becoming an increasingly important issue. Differential privacy is a promising notion of privacy originated from the community of statistical databases, and now widely adopted in various models of computation. We consider a probabilistic process calculus as a specification formalism for concurrent systems, and we propose a framework for reasoning about the degree of differential privacy provided by such systems. In particular, we investigate the preservation of the degree of privacy under composition via the various operators. We illustrate our idea by proving an anonymity-preservation property for a variant of the Crowds protocol for which the standard analyses from the literature are inapplicable. Finally, we make some preliminary steps towards automatically computing the degree of privacy of a system in a compositional way.
Fichier principal
Vignette du fichier
Modular_Reasoning_about_Differential_Privacy_in_a_Probabilistic_Process_Calculus.pdf (296.88 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00691284 , version 1 (25-04-2012)
hal-00691284 , version 2 (27-07-2012)
hal-00691284 , version 3 (04-12-2012)

Identifiers

  • HAL Id : hal-00691284 , version 3

Cite

Lili Xu. Modular Reasoning about Differential Privacy in a Probabilistic Process Calculus. 7th International Symposium on Trustworthy Global Computing (TGC), Sep 2012, Newcastle upon Tyne, United Kingdom. pp.198-212. ⟨hal-00691284v3⟩
317 View
435 Download

Share

Gmail Facebook X LinkedIn More