提出IntraShuffler,解决异构隐私联邦学习中的梯度泄露风险。
IntraShuffler: A Privacy Preserving Framework for Heterogeneous DP Federated Learning

- 按隐私预算分组后在参数级进行混洗,破坏梯度结构
- 使梯度可恢复性降低60%以上,推理准确率从0.78降至0.33
- 兼容异构隐私设置,适合关注隐私安全的联邦学习系统
异构差分隐私联邦学习(HDP-FL)允许客户端根据政策和数据敏感性自主选择隐私预算(ε_i)。现有系统常采用ε感知服务器聚合,通过权重调整提升模型效用,但非独立同分布数据导致梯度保留结构性模式,暴露给诚实但好奇的服务器,引发隐私推断攻击。本文首次证明,在合理知识约束下,服务器可通过梯度去噪与代理建模,实现对客户端分布属性的推断及跨轮次更新关联,表现为代理推理准确率与链接成功率。尽管洗牌模型可缓解此类风险,但其与HDP-FL的ε感知聚合不兼容。为此,我们提出IntraShuffler——一种面向HDP-FL的中间件防御框架。该框架将客户端按隐私兼容性分桶,并在每桶内进行参数级混洗,以破坏持久梯度结构,同时保持ε感知聚合能力。在四个数据集上的实验表明,IntraShuffler使梯度可恢复性下降超60%,代理推理准确率由0.78降至0.33,且在多种联邦聚合规则下维持相近模型性能。
原文摘要 · Abstract (English)
Heterogeneous Differential Privacy (HDP) in Federated Learning (FL) allows clients to select individual privacy budgets ($\varepsilon_i$) according to institutional policies and data sensitivity. In practice, many HDP-FL systems employ $\varepsilon$-aware server aggregation to improve model utility by re-weighting client updates according to their declared privacy budgets. However, gradient updates in FL retain structural patterns induced by non-independent and identically-distributed (non-IID) data, and these additional signals exposed by $\varepsilon$-aware aggregation create new opportunities for inference by an honest-but-curious server. In this work, we first show that a server equipped with gradient denoising and surrogate modeling can mount a \emph{Privacy Inference Attack} that infers distributional attributes of clients and links updates from the same client across training rounds, measured via surrogate inference accuracy and linkage success, under realistic knowledge constraints. The Shuffle-Model has been widely studied as a defense against such inference risks by anonymizing update sources, but it is fundamentally incompatible with HDP-FL $\varepsilon$-aware aggregation. To address this challenge, we propose \textbf{IntraShuffler}, a middleware defense framework designed for HDP-FL systems. IntraShuffler introduces a privacy-aware shuffling mechanism that groups clients into privacy-compatible buckets and performs parameter-level shuffling within each bucket to disrupt persistent gradient structure while preserving $\varepsilon$-aware aggregation. Experiments across four different datasets show that IntraShuffler reduces gradient recoverability by over 60% and decreases surrogate inference accuracy from 0.78 to 0.33 while maintaining comparable model utility across multiple FL aggregation rules.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。