提出轻量级双服务器联邦学习框架,防拜占庭攻击且保护隐私。
DSFL: A Dual-Server Byzantine-Resilient Federated Learning Framework via Group-Based Secure Aggregation
- 用分组安全聚合实现无加密的更新保护
- 通过偏差评分过滤恶意客户端,准确率达97.15%(CIFAR-10)
- 适合资源受限边缘设备,通信开销仅1088 KB/轮
联邦学习(FL)可在不共享原始数据的前提下实现分布式模型训练,具备强隐私保障。然而现有协议难以同时应对拜占庭参与者、非独立同分布(non-IID)数据下的模型性能下降,且在边缘设备上计算开销过高。此前工作或依赖可信硬件,或使用昂贵密码学工具,无法兼顾隐私与鲁棒性。本文提出DSFL——一种基于分组安全聚合的双服务器拜占庭容错联邦学习框架。不同于假设服务器不共谋的LSFL,DSFL揭示了客户端-服务器共谋导致的隐私泄露漏洞,并引入三项创新:(1) 双服务器安全聚合协议,无需加密或密钥交换即可保护更新;(2) 基于信用的分组过滤机制,依据偏离度评分识别恶意客户端;(3) 动态奖惩系统,激励公平参与。在MNIST、CIFAR-10和CIFAR-100上评估,面对最高30%拜占庭客户端,在IID与non-IID设置下均表现优异。例如,DSFL在CIFAR-10上达97.15%准确率,而FedAvg降至9.39%;在CIFAR-100上达68.60%。整体仅需55.9毫秒运行时间与1088 KB通信量/轮次,保持轻量化。
原文摘要 · Abstract (English)
Federated Learning (FL) enables decentralized model training without sharing raw data, offering strong privacy guarantees. However, existing FL protocols struggle to defend against Byzantine participants, maintain model utility under non-independent and identically distributed (non-IID) data, and remain lightweight for edge devices. Prior work either assumes trusted hardware, uses expensive cryptographic tools, or fails to address privacy and robustness simultaneously. We propose DSFL, a Dual-Server Byzantine-Resilient Federated Learning framework that addresses these limitations using a group-based secure aggregation approach. Unlike LSFL, which assumes non-colluding semi-honest servers, DSFL removes this dependency by revealing a key vulnerability: privacy leakage through client-server collusion. DSFL introduces three key innovations: (1) a dual-server secure aggregation protocol that protects updates without encryption or key exchange, (2) a group-wise credit-based filtering mechanism to isolate Byzantine clients based on deviation scores, and (3) a dynamic reward-penalty system for enforcing fair participation. DSFL is evaluated on MNIST, CIFAR-10, and CIFAR-100 under up to 30 percent Byzantine participants in both IID and non-IID settings. It consistently outperforms existing baselines, including LSFL, homomorphic encryption methods, and differential privacy approaches. For example, DSFL achieves 97.15 percent accuracy on CIFAR-10 and 68.60 percent on CIFAR-100, while FedAvg drops to 9.39 percent under similar threats. DSFL remains lightweight, requiring only 55.9 ms runtime and 1088 KB communication per round.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。