融合差分隐私与安全聚合,实现可扩展的联邦学习隐私保护。
Scalable and Private Federated Learning Using Distributed Differential Privacy and Secure Aggregation

- 客户端先加拉普拉斯噪声,再拆分梯度为秘密共享。
- 实验表明精度高于仅用LDP,隐私保护强于仅用MPC。
- 适合大规模隐私敏感的联邦学习场景使用。
本文提出DDP-SA框架,结合客户端本地差分隐私(LDP)与全阈值加法秘密共享(ASS),实现可扩展的隐私保护联邦学习。该框架采用两阶段保护机制:客户端首先对本地梯度添加校准的拉普拉斯噪声,再将含噪梯度分解为加法秘密份额并分发至多个中间服务器。此设计确保:(i) 单个服务器或通信链路被攻破也无法泄露任何客户更新信息;(ii) 参数服务器仅能重构聚合后的含噪梯度,无法获取任一客户的具体贡献。大量实验表明,相较于仅使用LDP的方法,DDP-SA在模型精度上显著提升;相比仅使用MPC的方法,提供更强的端到端隐私保障。该框架在参与方数量上呈线性扩展,具备可控的计算与通信开销,是一种实用且安全的联邦学习隐私解决方案。
原文摘要 · Abstract (English)
This article presents DDP-SA, a scalable privacy-preserving federated learning framework that jointly leverages client-side local differential privacy (LDP) and full-threshold additive secret sharing (ASS) for secure aggregation. Unlike existing methods that rely solely on differential privacy or on secure multi-party computation (MPC), DDP-SA integrates both techniques to deliver stronger end-to-end privacy guarantees while remaining computationally practical. The framework introduces a two-stage protection mechanism: clients first perturb their local gradients with calibrated Laplace noise, then decompose the noisy gradients into additive secret shares that are distributed across multiple intermediate servers. This design ensures that (i) no single compromised server or communication channel can reveal any information about individual client updates, and (ii) the parameter server reconstructs only the aggregated noisy gradient, never any client-specific contribution. Extensive experiments show that DDP-SA achieves substantially higher model accuracy than standalone LDP while providing stronger privacy protection than MPC-only approaches. The proposed framework scales linearly with the number of participants and offers a practical, privacy-preserving solution for federated learning applications with controllable computational and communication overhead.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。