Differential privacy for relational algebra: improving the sensitivity bounds via constraint systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Differential privacy for relational algebra: improving the sensitivity bounds via constraint systems

Abstract

Differential privacy is a modern approach in privacy-preserving data analysis to control the amount of information that can be inferred about an individual by querying a database. The most common techniques are based on the introduction of probabilistic noise, often defined as a Laplacian parametric on the sensitivity of the query. In order to maximize the utility of the query, it is crucial to estimate the sensitivity as precisely as possible. In this paper we consider relational algebra, the classical language for queries in relational databases, and we propose a method for computing a bound on the sensitivity of queries in an intuitive and compositional way. We use constraint-based techniques to accumulate the information on the possible values for attributes provided by the various components of the query, thus making it possible to compute tight bounds on the sensitivity.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
paper.pdf (209 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-00760688 , version 1 (05-12-2012)

Identifiers

Cite

Catuscia Palamidessi, Marco Stronati. Differential privacy for relational algebra: improving the sensitivity bounds via constraint systems. QAPL - Tenth Workshop on Quantitative Aspects of Programming Languages, Apr 2012, Tallin, Estonia. pp.92-105, ⟨10.4204/EPTCS.85.7⟩. ⟨hal-00760688⟩
282 View
314 Download

Altmetric

Share

Gmail Facebook X LinkedIn More