R2DP: A Universal and Automated Approach to Optimizing the Randomization Mechanisms of Differential Privacy for Utility Metrics with No Known Optimal Distributions
Meisam Mohammady, Shangyu Xie, Yuan Hong, Mengyuan Zhang, Lingyu Wang, Makan Pourzandi, Mourad Debbabi
摘要
Differential privacy (DP) has emerged as a de facto standard privacy notion for a wide range of applications. Since the meaning of data utility in different applications may vastly differ, a key challenge is to find the optimal randomization mechanism, i.e., the distribution and its parameters, for a given utility metric. Existing works have identified the optimal distributions in some special cases, while leaving all other utility metrics (e.g., usefulness and graph distance) as open problems. Since existing works mostly rely on manual analysis to examine the search space of all distributions, it would be an expensive process to repeat such efforts for each utility metric. To address such deficiency, we propose a novel approach that can automatically optimize different utility metrics found in diverse applications under a common framework. Our key idea that, by regarding the variance of the injected noise itself as a random variable, a two-fold distribution may approximately cover the search space of all distributions. Therefore, we can automatically find distributions in this search space to optimize different utility metrics in a similar manner, simply by optimizing the parameters of the two-fold distribution. Specifically, we define a universal framework, namely, randomizing the randomization mechanism of differential privacy (R2DP), and we formally analyze its privacy and utility. Our experiments show that R2DP can provide better results than the baseline distribution (Laplace) for several utility metrics with no known optimal distributions, whereas our results asymptotically approach to the optimality for utility metrics having known optimal distributions. As a side benefit, the added degree of freedom introduced by the two-fold distribution allows R2DP to accommodate the preferences of both data owners and recipients.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper7
- L-SRR: Local Differential Privacy for Location-Based Services with Staircase Randomized ResponseHan Wang, Hanbin Hong, Li Xiong, Zhan Qin 等CCS 2022 · 被引用 37 次
- Task-Agnostic Privacy-Preserving Representation Learning for Federated Learning against Attribute Inference AttacksCaridad Arroyo Arevalo, Sayedeh Leila Noorbakhsh, Yun Dong, Yuan Hong 等AAAI 2024 · 被引用 26 次
- "Get in Researchers; We're Measuring Reproducibility": A Reproducibility Study of Machine Learning Papers in Tier 1 Security ConferencesDaniel Olszewski, Allison Lu, Carson Stillman, Kevin Warren 等CCS 2023 · 被引用 19 次
- Inf2Guard: An Information-Theoretic Framework for Learning Privacy-Preserving Representations against Inference AttacksSayedeh Leila Noorbakhsh, Binghui Zhang, Yuan Hong, Binghui WangUSENIX Security 2024 · 被引用 17 次
- DPI: Ensuring Strict Differential Privacy for Infinite Data StreamingShuya Feng, Meisam Mohammady, Han Wang, Xiaochen Li 等S&P 2024 · 被引用 17 次
它引用的顶会 Paper1
相关 Paper
- AdaPDP: Adaptive Personalized Differential PrivacyBen Niu, Yahong Chen, Boyang Wang, Zhibo Wang 等INFOCOM 2021 · 被引用 46 次
- Addressing Sensitivity Distinction in Local Differential Privacy: A General Utility-Optimized FrameworkXingyu He, Youwen Zhu, Rongke Liu, Gaoning Pan 等USENIX Security 2025
- Meeting Utility Constraints in Differential Privacy: A Privacy-Boosting ApproachBo Jiang, Wanrong Zhang, Donghang Lu, Jian Du 等S&P 2025
- One-Sided Bounded Noise: Theory, Optimization Algorithms and ApplicationsHanshen Xiao, Jun Wan, Elaine Shi, Srinivas DevadasCCS 2025
- Geometry of Sensitivity: Twice Sampling and Hybrid Clipping in Differential Privacy with Optimal Gaussian Noise and Application to Deep LearningHanshen Xiao, Jun Wan, Srinivas DevadasCCS 2023 · 被引用 9 次
