Random Sampling Plus Fake Data: Multidimensional Frequency Estimates With Local Differential Privacy
Not on the map. Why?
Abstract (arXiv)
With local differential privacy (LDP), users can privatize their data and thus guarantee privacy properties before transmitting it to the server (a.k.a. the aggregator). One primary objective of LDP is frequency (or histogram) estimation, in which the aggregator estimates the number of users for each possible value. In practice, when a study with rich content on a population is desired, the interest is in the multiple attributes of the population, that is to say, in multidimensional data (d ≥ 2). However, contrary to the problem of frequency estimation of a single attribute (the majority of the works), the multidimensional aspect imposes to pay particular attention to the privacy budget. This one can indeed grow extremely quickly due to the composition theorem. To the authors' knowledge, two solutions seem to stand out for this task: 1) splitting the privacy budget for each attribute, i.e., send each value with fracεd-LDP (Spl), and 2) random sampling a single attribute and spend all the privacy budget to send it with ε-LDP (Smp). Although Smp adds additional sampling error, it has proven to provide higher data utility than the former Spl solution. However, we argue that aggregators (who are also seen as attackers) are aware of the sampled attribute and its LDP value, which is protected by a "less strict" eε probability bound (rather than eε/d). This way, we propose a solution named Random Sampling plus Fake Data (RS+FD), which allows creating uncertainty over the sampled attribute by generating fake data for each non-sampled attribute; RS+FD further benefits from amplification by sampling. We theoretically and experimentally validate our proposed solution on both synthetic and real-world datasets to show that RS+FD achieves nearly the same or better utility than the state-of-the-art Smp solution.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Sep 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 3; 2024: 0; 2025: 1; 2026: 1.
6 papers.
- 2022OpBoost: A Vertical Federated Tree Boosting Framework Based on Order-Preserving Desensitizationcited by 12
- 2023(Local) Differential Privacy has NO Disparate Impact on Fairnesscited by 5
- 2023Local Differential Privacy in Graph Neural Networks: a Reconstruction Approachcited by 5
- 2023On the Impact of Multi-dimensional Local Differential Privacy on Fairnesscited by 4
- 2025Optimal Survey Design for Private Mean Estimationcited by 0
- 2026Classification Under Local Differential Privacy with Model Reversal and Model Averagingcited by 0
- 2026Classification Under Local Differential Privacy with Model Reversal and Model Averaging5 Feb 2026
- 2025Optimal Survey Design for Private Mean Estimation30 Jan 2025
- 2023On the Impact of Multi-dimensional Local Differential Privacy on Fairness7 Dec 2023
- 2023Local Differential Privacy in Graph Neural Networks: a Reconstruction Approach15 Sep 2023
- 2023(Local) Differential Privacy has NO Disparate Impact on Fairness25 Apr 2023
- 2022OpBoost: A Vertical Federated Tree Boosting Framework Based on Order-Preserving Desensitization4 Oct 2022