Abstract
Abstract
Many data analysis operations can be expressed as a GROUP BY query on an unbounded set of partitions, followed by a per-partition aggregation. To make such a query differentially private, adding noise to each aggregation is not enough: we also need to make sure that the set of partitions released is also differentially private.
This problem is not new, and it was recently formally introduced as differentially private set union [14]. In this work, we continue this area of study, and focus on the common setting where each user is associated with a single partition. In this setting, we propose a simple, optimal differentially private mechanism that maximizes the number of released partitions. We discuss implementation considerations, as well as the possible extension of this approach to the setting where each user contributes to a fixed, small number of partitions.
Reference30 articles.
1. [1] G. Acs, C. Castelluccia, and R. Chen. Differentially private histogram publishing through lossy compression. In 2012 IEEE 12th International Conference on Data Mining, pages 1–10. IEEE, 2012.10.1109/ICDM.2012.80
2. [2] B. Balle and Y.-X. Wang. Improving the gaussian mechanism for differential privacy: Analytical calibration and optimal denoising. In International Conference on Machine Learning, pages 394–403. PMLR, 2018.
3. [3] J. Bater, X. He, W. Ehrich, A. Machanavajjhala, and J. Rogers. Shrinkwrap: Differentially-private query processing in private data federations. arXiv preprint arXiv:1810.01816, 2018.
4. [4] G. Cormode, C. Procopiuc, D. Srivastava, and T. T. Tran. Differentially private summaries for sparse data. In Proceedings of the 15th International Conference on Database Theory, pages 299–311, 2012.10.1145/2274576.2274608
5. [5] G. Cormode, M. Procopiuc, D. Srivastava, and T. T. Tran. Differentially private publication of sparse data. arXiv preprint arXiv:1103.0825, 2011.10.1145/2274576.2274608
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Privately Answering Queries on Skewed Data via Per-Record Differential Privacy;Proceedings of the VLDB Endowment;2024-07
2. Bounded and Unbiased Composite Differential Privacy;2024 IEEE Symposium on Security and Privacy (SP);2024-05-19
3. TraVaS: Differentially Private Trace Variant Selection for Process Mining;Lecture Notes in Business Information Processing;2023
4. Distributed, Private, Sparse Histograms in the Two-Server Model;Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security;2022-11-07