Benchmarking Secure Sampling Protocols for Differential Privacy
Yucheng Fu, Tianhao Wang
摘要
Differential privacy (DP) is widely employed to provide privacy protection for individuals by limiting information leakage from the aggregated data. Two well-known models of DP are the central model and the local model. The former requires a trustworthy server for data aggregation, while the latter requires individuals to add noise, significantly decreasing the utility of aggregated results. Recently, many studies have proposed to achieve DP with Secure Multi-party Computation (MPC) in distributed settings, namely, the distributed model, which has utility comparable to central model while, under specific security assumptions, preventing parties from obtaining others' information. One challenge of realizing DP in distributed model is efficiently sampling noise with MPC. Although many secure sampling methods have been proposed, they have different security assumptions and isolated theoretical analyses. There is a lack of experimental evaluations to measure and compare their performances. We fill this gap by benchmarking existing sampling protocols in MPC and performing comprehensive measurements of their efficiency. First, we present a taxonomy of the underlying techniques of these sampling protocols. Second, we extend widely used distributed noise generation protocols to be resilient against Byzantine attackers. Third, we implement discrete sampling protocols and align their security settings for a fair comparison. We then conduct an extensive evaluation to study their efficiency and utility. Our experiments show that (1) malicious protocols based on a technique called bitwise sampling are more efficient than other methods, and using an oblivious data structure can reduce the circuit size in high-security regimes, (2) the cost of realizing malicious security is high, under the assumption of semi-honest, using a method named distributed noise generation is much more efficient, and (3) the utility loss caused by sampling noise in MPC is small, which to a certain extent eliminates utility concerns when using the DDP protocol in practice. We also opensource our code The code of our benchmark is now available at https://github.com/yuchengxj/Secure-sampling-benchmark . CCS Concepts • Security and privacy → Privacy-preserving protocols.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper6
- Accelerating Multiparty Noise Generation Using LookupsFredrik Meisingseth, Christian Rechberger, Fabian SchmidCCS 2026 · 被引用 3 次
- Secure Noise Sampling for Differentially Private Collaborative LearningOlive Franzese, Congyu Fang, Radhika Garg, Xiao Wang 等CCS 2025 · 被引用 1 次
- Harnessing Sparsification in Federated Learning: A Secure, Efficient, and Differentially Private RealizationShuangqing Xu, Yifeng Zheng, Zhongyun HuaCCS 2025
- Distributed Synthesis of Differentially Private Tabular DatasetsYucheng Fu, Tianyao Gu, Elaine Shi, Tianhao WangUSENIX Security 2026
- Thresholdizing Standardized FALCON SignaturesRadhika Garg, Daniel Escudero, Antigoni Polychroniadou, Akira Takahashi 等CCS 2026
它引用的顶会 Paper29
- Deep Learning with Differential PrivacyMartín Abadi, Andy Chu, Ian J. Goodfellow, H. Brendan McMahan 等CCS 2016 · 被引用 7,620 次
- Bulletproofs: Short Proofs for Confidential Transactions and MoreBenedikt Bünz, Jonathan Bootle, Dan Boneh, Andrew Poelstra 等S&P 2018 · 被引用 1,285 次
- Locally Differentially Private Protocols for Frequency EstimationTianhao Wang, Jeremiah Blocki, Ninghui Li, Somesh JhaUSENIX Security 2017 · 被引用 629 次
- The Discrete Gaussian for Differential PrivacyClément L. Canonne, Gautam Kamath, Thomas SteinkeNeurIPS 2020 · 被引用 355 次
- The Distributed Discrete Gaussian Mechanism for Federated Learning with Secure AggregationPeter Kairouz, Ziyu Liu, Thomas SteinkeICML 2021 · 被引用 291 次
相关 Paper
- Securely Sampling Discrete Gaussian Noise for Multi-Party Differential PrivacyChengkun Wei, Ruijing Yu, Yuan Fan, Wenzhi Chen 等CCS 2023 · 被引用 4 次
- Selective MPC: Distributed Computation of Differentially Private Key-Value StatisticsThomas Humphries, Rasoul Akhavan Mahdavi, Shannon Veitch, Florian KerschbaumCCS 2022 · 被引用 9 次
- Private Counting from Anonymous Messages: Near-Optimal Accuracy with Vanishing Communication OverheadBadih Ghazi, Ravi Kumar, Pasin Manurangsi, Rasmus PaghICML 2020 · 被引用 59 次
- Efficient Differentially Private Secure Aggregation for Federated Learning via Hardness of Learning with ErrorsTimothy Stevens, Christian Skalka, Christelle Vincent, John H. Ring 等USENIX Security 2022
- Augmented Shuffle Protocols for Accurate and Robust Frequency Estimation Under Differential PrivacyTakao Murakami, Yuichi Sei, Reo EriguchiS&P 2025
