A Nearly Instance-optimal Differentially Private Mechanism for Conjunctive Queries

05/12/2021
by   Wei Dong, et al.
0

Releasing the result size of conjunctive queries and graph pattern queries under differential privacy (DP) has received considerable attention in the literature, but existing solutions do not offer any optimality guarantees. We provide the first DP mechanism for this problem with a fairly strong notion of optimality, which can be considered as a natural relaxation of instance-optimality.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/19/2022

Composition Theorems for Interactive Differential Privacy

An interactive mechanism is an algorithm that stores a data set and answ...
research
02/09/2023

Pushing the Boundaries of Private, Large-Scale Query Answering

We address the problem of efficiently and effectively answering large nu...
research
03/01/2023

Subset-Based Instance Optimality in Private Estimation

We propose a new definition of instance optimality for differentially pr...
research
02/09/2021

Differential Privacy for Binary Functions via Randomized Graph Colorings

We present a framework for designing differentially private (DP) mechani...
research
09/25/2019

Differential Privacy for Evolving Almost-Periodic Datasets with Continual Linear Queries: Application to Energy Data Privacy

For evolving datasets with continual reports, the composition rule for d...
research
09/12/2023

Concurrent Composition for Interactive Differential Privacy with Adaptive Privacy-Loss Parameters

In this paper, we study the concurrent composition of interactive mechan...
research
06/28/2023

Boost: Effective Caching in Differentially-Private Databases

Differentially private (DP) databases can enable privacy-preserving anal...

Please sign up or login with your details

Forgot password? Click here to reset