Exact Privacy Analysis of the Gaussian Sparse Histogram Mechanism

Main Article Content

Arjun Wilkins
https://orcid.org/0009-0000-5315-356X
Daniel Kifer
Danfeng Zhang
https://orcid.org/0000-0003-1942-6872
Brian Karrer
https://orcid.org/0000-0002-6252-8332

Abstract

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 epsilon, delta differential privacy guarantees satisfied by this mechanism. We compare these exact epsilon, delta parameters to the simpler overestimates used in prior work to quantify the impact of their looser privacy bounds.

Article Details

How to Cite
Wilkins, Arjun, Daniel Kifer, Danfeng Zhang, and Brian Karrer. 2024. “Exact Privacy Analysis of the Gaussian Sparse Histogram Mechanism”. Journal of Privacy and Confidentiality 14 (1). https://doi.org/10.29012/jpc.823.
Section
Articles