Exact Privacy Analysis of the Gaussian Sparse Histogram Mechanism

02/02/2022
by   Brian Karrer, et al.
0

Sparse histogram methods can be useful for returning differentially private counts of items in large or infinite histograms, large group-by queries, and more generally, releasing a set of statistics with sufficient item counts. We consider the Gaussian version of the sparse histogram mechanism and study the exact ϵ,δ differential privacy guarantees satisfied by this mechanism. We compare these exact ϵ,δ parameters to the simpler overestimates used in prior work to quantify the impact of their looser privacy bounds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/17/2023

A Unifying Privacy Analysis Framework for Unknown Domain Algorithms in Differential Privacy

There are many existing differentially private algorithms for releasing ...
research
10/08/2019

Differentially private anonymized histograms

For a dataset of label-count pairs, an anonymized histogram is the multi...
research
10/23/2020

Permute-and-Flip: A new mechanism for differentially private selection

We consider the problem of differentially private selection. Given a fin...
research
06/07/2022

Histogram Estimation under User-level Privacy with Heterogeneous Data

We study the problem of histogram estimation under user-level differenti...
research
10/04/2017

Analysis of NIST SP800-22 focusing on randomness of each sequence

NIST SP800-22 is a randomness test set applied for a set of sequences. A...
research
06/18/2021

Differentially private sparse vectors with low error, optimal space, and fast access

Representing a sparse histogram, or more generally a sparse vector, is a...
research
06/07/2019

Computing Exact Guarantees for Differential Privacy

Quantification of the privacy loss associated with a randomised algorith...

Please sign up or login with your details

Forgot password? Click here to reset