On Differentially Private Counting on Trees
Data Structures and Algorithms
2023-04-28 v2 Cryptography and Security
Abstract
We study the problem of performing counting queries at different levels in hierarchical structures while preserving individuals' privacy. Motivated by applications, we propose a new error measure for this problem by considering a combination of multiplicative and additive approximation to the query results. We examine known mechanisms in differential privacy (DP) and prove their optimality, under this measure, in the pure-DP setting. In the approximate-DP setting, we design new algorithms achieving significant improvements over known ones.
Cite
@article{arxiv.2212.11967,
title = {On Differentially Private Counting on Trees},
author = {Badih Ghazi and Pritish Kamath and Ravi Kumar and Pasin Manurangsi and Kewen Wu},
journal= {arXiv preprint arXiv:2212.11967},
year = {2023}
}
Comments
26 pages, full version