Differentially Private Mechanisms for Count Queries
Parastoo Sadeghi, Shahab Asoodeh, Flavio du Pin Calmon

TL;DR
This paper introduces a new differentially private mechanism for count queries that adds integer-valued noise, balancing privacy and utility, and outperforms existing discrete Gaussian mechanisms in privacy guarantees.
Contribution
It proposes a novel integer-valued noise addition mechanism for count queries that enhances privacy guarantees compared to previous methods.
Findings
Provides higher privacy guarantees than discrete Gaussian mechanism
Derives privacy parameters based on error probability and count size
Demonstrates improved privacy-utility trade-off
Abstract
In this paper, we consider the problem of responding to a count query (or any other integer-valued queries) evaluated on a dataset containing sensitive attributes. To protect the privacy of individuals in the dataset, a standard practice is to add continuous noise to the true count. We design a differentially-private mechanism which adds integer-valued noise allowing the released output to remain integer. As a trade-off between utility and privacy, we derive privacy parameters and in terms of the the probability of releasing an erroneous count under the assumption that the true count is no smaller than half the support size of the noise. We then numerically demonstrate that our mechanism provides higher privacy guarantee compared to the discrete Gaussian mechanism that is recently proposed in the literature.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Cryptography and Data Security · Complexity and Algorithms in Graphs
