郑州大学学报(工学版)2026,Vol.47Issue(4):125-133,9.DOI:10.13705/j.issn.1671-6833.2026.04.012
一种抗拜占庭攻击的联邦学习鲁棒聚合算法
A Robust Aggregation Algorithm Defending Against Byzantine Attacks in Federated Learning
摘要
Abstract
To address the issue that existing defense schemes in federated learning tend to over-prune benign mod-els during filtering,a robust aggregation algorithm defending against Byzantine attacks in federated learning(FLD-BA)was proposed.HDBSCAN density-based clustering was employed to group models,to identify the benign clus-ter,and the most representative model in terms of direction was selected as the trusted reference model.Using the trusted model as a benchmark,cosine similarity was utilized to screen potentially misclassified benign models within clusters,thereby to correct misjudgments.Additionally,a reputation mechanism was established to dynamically e-valuate models' historical behaviors,to mitigate the impact of missed detections.For models with high reputation,adaptive magnitude scaling was applied,and differential aggregation weights were assigned based on update quality to further enhance aggregation performance.Experimental results demonstrated that when defending against sign-flipping attacks,FLDBA achieved an accuracy improvement of 0.18 percentage points to 5.13 percentage points compared to FLRAM,FLAME,RFLPA,FLTrust,and Krum,while reducing the attack success rate by 40.52 per-centage points to 61.39 percentage points,exhibiting superior robustness.关键词
联邦学习/拜占庭攻击/鲁棒性/信誉/加权聚合Key words
federated learning/Byzantine attacks/robust/reputation/weighted aggregation分类
信息技术与安全科学引用本文复制引用
张淑芬,李涛,张镇博,钟琪,景忠瑞..一种抗拜占庭攻击的联邦学习鲁棒聚合算法[J].郑州大学学报(工学版),2026,47(4):125-133,9.基金项目
国家自然科学基金联合基金资助项目(U20A20179) (U20A20179)