FedMP: A multi-pronged defense algorithm against Byzantine poisoning attacks in federated learning

IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Computer Networks Pub Date : 2025-02-01 DOI:10.1016/j.comnet.2024.110990
Kai Zhao, Lina Wang, Fangchao Yu, Bo Zeng, Zhi Pang
{"title":"FedMP: A multi-pronged defense algorithm against Byzantine poisoning attacks in federated learning","authors":"Kai Zhao,&nbsp;Lina Wang,&nbsp;Fangchao Yu,&nbsp;Bo Zeng,&nbsp;Zhi Pang","doi":"10.1016/j.comnet.2024.110990","DOIUrl":null,"url":null,"abstract":"<div><div>Federated learning (FL) is an increasingly popular privacy-preserving collaborative machine learning paradigm that enables clients to train a global model collaboratively without sharing their raw data. Despite its advantages, FL is vulnerable to untargeted Byzantine poisoning attacks in which malicious clients send incorrect model updates during training to disrupt the global model’s performance or prevent it from converging. Existing defenses based on anomaly detection typically rely on additional auxiliary datasets and assume a known and fixed proportion of malicious clients. To overcome these shortcomings, we propose FedMP, a multi-pronged defense algorithm against untargeted Byzantine poisoning attacks. FedMP’s primary idea is to detect anomalous variations in the magnitude and direction of model updates across communication rounds. In particular, FedMP first utilizes an adaptive scaling module to limit the impact of malicious updates with anomalous amplitudes. Then, FedMP identifies and filters malicious model updates with abnormal directions through dynamic clustering and partial filtering methods. Finally, FedMP extracts pure ingredients from the filtered updates as reputation scores for model aggregation to further reduce the influence of malicious updates. Comprehensive evaluations across three publicly accessible datasets demonstrate that FedMP significantly outperforms the existing Byzantine robust defenses under a high proportion of malicious clients (0.7 in our experiments) and high Non-IID degree (0.1 in our experiments) scenarios.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"257 ","pages":"Article 110990"},"PeriodicalIF":4.6000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128624008223","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

Federated learning (FL) is an increasingly popular privacy-preserving collaborative machine learning paradigm that enables clients to train a global model collaboratively without sharing their raw data. Despite its advantages, FL is vulnerable to untargeted Byzantine poisoning attacks in which malicious clients send incorrect model updates during training to disrupt the global model’s performance or prevent it from converging. Existing defenses based on anomaly detection typically rely on additional auxiliary datasets and assume a known and fixed proportion of malicious clients. To overcome these shortcomings, we propose FedMP, a multi-pronged defense algorithm against untargeted Byzantine poisoning attacks. FedMP’s primary idea is to detect anomalous variations in the magnitude and direction of model updates across communication rounds. In particular, FedMP first utilizes an adaptive scaling module to limit the impact of malicious updates with anomalous amplitudes. Then, FedMP identifies and filters malicious model updates with abnormal directions through dynamic clustering and partial filtering methods. Finally, FedMP extracts pure ingredients from the filtered updates as reputation scores for model aggregation to further reduce the influence of malicious updates. Comprehensive evaluations across three publicly accessible datasets demonstrate that FedMP significantly outperforms the existing Byzantine robust defenses under a high proportion of malicious clients (0.7 in our experiments) and high Non-IID degree (0.1 in our experiments) scenarios.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
FedMP:联邦学习中针对拜占庭中毒攻击的多管齐下的防御算法
联邦学习(FL)是一种日益流行的保护隐私的协作机器学习范例,它使客户能够在不共享原始数据的情况下协作训练全局模型。尽管具有优势,但FL容易受到无目标的拜占庭中毒攻击,在这种攻击中,恶意客户端在训练期间发送错误的模型更新,以破坏全局模型的性能或阻止其收敛。现有的基于异常检测的防御通常依赖于额外的辅助数据集,并假设已知和固定比例的恶意客户端。为了克服这些缺点,我们提出了FedMP,一种针对非目标拜占庭中毒攻击的多管齐下的防御算法。FedMP的主要思想是检测跨通信轮模型更新的幅度和方向的异常变化。特别是,FedMP首先利用自适应缩放模块来限制具有异常幅度的恶意更新的影响。然后,FedMP通过动态聚类和部分过滤方法,识别和过滤具有异常方向的恶意模型更新。最后,FedMP从过滤后的更新中提取纯成分作为信誉分数用于模型聚合,进一步降低恶意更新的影响。对三个可公开访问的数据集的综合评估表明,在高比例的恶意客户端(我们的实验中为0.7)和高非iid度(我们的实验中为0.1)的情况下,FedMP显著优于现有的拜占庭稳健防御。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
期刊最新文献
Design and evaluation of a robust and explainable intrusion detection framework for 5G/B5G networks OnlineADS: An online active learning approach to intrusion detection for WSNs Dynamic reliable SFC orchestration for SDN-NFV enabled networks Efficient level-3 secure certificateless signature against malicious KGC attacks for IoT An improved dynamic anonymous authentication and key agreement scheme for resource constrained IoT devices
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1