Sensitivity of Counting Queries - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Sensitivity of Counting Queries

Résumé

In the context of statistical databases, the release of accurate statistical information about the collected data often puts at risk the privacy of the individual contributors. The goal of differential privacy is to maximise the utility of a query while protecting the individual records in the database. A natural way to achieve differential privacy is to add statistical noise to the result of the query. In this context, a mechanism for releasing statistical information is thus a trade-off between utility and privacy. In order to balance these two " conflicting " requirements, privacy preserving mechanisms calibrate the added noise to the so-called sensitivity of the query, and thus a precise estimate of the sensitivity of the query is necessary to determine the amplitude of the noise to be added. In this paper, we initiate a systematic study of sensitivity of counting queries over relational databases. We first observe that the sensitivity of a Relational Algebra query with counting is not computable in general, and that while the sensitivity of Conjunctive Queries with counting is computable, it becomes unbounded as soon as the query includes a join. We then consider restricted classes of databases (databases with constraints), and study the problem of computing the sensitivity of a query given such constraints. We are able to establish bounds on the sensitivity of counting conjunctive queries over constrained databases. The kind of constraints studied here are: functional dependencies and cardinality dependencies. The latter is a natural generalisation of functional dependencies that allows us to provide tight bounds on the sensitivity of counting conjunctive queries
Fichier principal
Vignette du fichier
icalp16.pdf (1.52 Mo) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-01713317 , version 1 (20-02-2018)

Identifiants

  • HAL Id : hal-01713317 , version 1

Citer

Myrto Arapinis, Diego Figueira, Marco Gaboardi. Sensitivity of Counting Queries. International Colloquium on Automata, Languages, and Programming (ICALP), Jul 2016, Rome, Italy. ⟨hal-01713317⟩

Collections

CNRS TDS-MACS
309 Consultations
45 Téléchargements

Partager

Gmail Facebook X LinkedIn More