arXiv:2602.05410cs.LG2026-02被引 1

用加密更新过滤恶意节点,提升联邦学习安全性与鲁棒性。

Robust Federated Learning via Byzantine Filtering over Encrypted Updates

  • 结合同态加密与元分类器,实现隐私保护下的异常更新检测。
  • 在多个数据集上识别恶意更新准确率达90%~94%,模型性能损失小。
  • 自动优化加密参数,在保证效率下实现高安全聚合。

联邦学习旨在保护数据隐私的同时协同训练模型,但其分布式特性仍面临隐私泄露和拜占庭行为干扰的风险。现有方案通常独立处理安全聚合与拜占庭鲁棒性,难以兼顾。本文提出一种新方法:利用属性推断攻击的框架,训练一组元分类器以模拟多种拜占庭行为(如后门、梯度反演、标签翻转、数据打乱),通过重加权方式抵消恶意加密更新;同时针对CKKS加密系统,提出自动化选择最优核函数与维度超参数的方法,平衡同态推理、聚合约束与效率。实验在FEMNIST、CIFAR10、GTSRB和acsincome数据集上验证有效性,所提SVM过滤器对恶意更新识别准确率达90%~94%,模型效用损失轻微,加密推理时间6~24秒,聚合总耗时9~26秒。

原文摘要 · Abstract (English)

Federated Learning (FL) aims to train a collaborative model while preserving data privacy. However, the distributed nature of this approach still raises privacy and security issues, such as the exposure of sensitive data due to inference attacks and the influence of Byzantine behaviors on the trained model. In particular, achieving both secure aggregation and Byzantine resilience remains challenging, as existing solutions often address these aspects independently. In this work, we propose to address these challenges through a novel approach that combines homomorphic encryption for privacy-preserving aggregation with property-inference-inspired meta-classifiers for Byzantine filtering. First, following the property-inference attacks blueprint, we train a set of filtering meta-classifiers on labeled shadow updates, reproducing a diverse ensemble of Byzantine misbehaviors in FL, including backdoor, gradient-inversion, label-flipping and shuffling attacks. The outputs of these meta-classifiers are then used to cancel the Byzantine encrypted updates by reweighting. Second, we propose an automated method for selecting the optimal kernel and the dimensionality hyperparameters with respect to homomorphic inference, aggregation constraints and efficiency over the CKKS cryptosystem. Finally, we demonstrate through extensive experiments the effectiveness of our approach against Byzantine participants on the FEMNIST, CIFAR10, GTSRB, and acsincome benchmarks. More precisely, our SVM filtering achieves accuracies between $90$% and $94$% for identifying Byzantine updates at the cost of marginal losses in model utility and encrypted inference runtimes ranging from $6$ to $24$ seconds and from $9$ to $26$ seconds for an overall aggregation.

联邦学习拜占庭防御加密聚合安全推理

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。