Scope: On Detecting Constrained Backdoor Attacks in Federated Learning

IF 8 1区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS IEEE Transactions on Information Forensics and Security Pub Date : 2025-01-24 DOI:10.1109/TIFS.2025.3533899
Siquan Huang;Yijiang Li;Xingfu Yan;Ying Gao;Chong Chen;Leyu Shi;Biao Chen;Wing W. Y. Ng
{"title":"Scope: On Detecting Constrained Backdoor Attacks in Federated Learning","authors":"Siquan Huang;Yijiang Li;Xingfu Yan;Ying Gao;Chong Chen;Leyu Shi;Biao Chen;Wing W. Y. Ng","doi":"10.1109/TIFS.2025.3533899","DOIUrl":null,"url":null,"abstract":"Federated learning (FL) allows multiple clients to train an efficient deep-learning model collaboratively but is susceptible to backdoor attacks. Traditional detection-based defenses depend on specific metrics to distinguish client gradients. Defense-aware attackers exploit this by constraining attack gradients on these metrics to evade detection, leading to metric-constrained attacks. This paper concretely instantiates such threats and introduces cosine-constrained attacks, which successfully compromise advanced defenses based on cosine distance. To address the aforementioned challenge, we propose Scope, a novel defense that detects cosine-constrained attacks using cosine distance by exposing the constrained backdoor dimensions of attack gradients. Scope employs dimension-wise normalization and differential scaling to amplify the distinction between backdoor dimensions and benign or unused ones, countering sophisticated attackers’ attempts to obscure them. Moreover, we develop a novel clustering approach, namely Dominant Gradient Clustering (DGC), to isolate and eliminate backdoor gradients. Extensive experiments across various datasets, models, FL settings, and adversary scenarios demonstrate that Scope consistently outperforms existing defenses by a significant margin, especially against the cosine-constrained attack. Additionally, we present a Scope-tailored attack designed to evade Scope, but it remains ineffective even when maximizing stealthiness, further underscoring the robustness of Scope. We release our source code at: <uri>https://github.com/siquanhuang/Scope</uri>.","PeriodicalId":13492,"journal":{"name":"IEEE Transactions on Information Forensics and Security","volume":"20 ","pages":"3302-3315"},"PeriodicalIF":8.0000,"publicationDate":"2025-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Forensics and Security","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10852410/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Federated learning (FL) allows multiple clients to train an efficient deep-learning model collaboratively but is susceptible to backdoor attacks. Traditional detection-based defenses depend on specific metrics to distinguish client gradients. Defense-aware attackers exploit this by constraining attack gradients on these metrics to evade detection, leading to metric-constrained attacks. This paper concretely instantiates such threats and introduces cosine-constrained attacks, which successfully compromise advanced defenses based on cosine distance. To address the aforementioned challenge, we propose Scope, a novel defense that detects cosine-constrained attacks using cosine distance by exposing the constrained backdoor dimensions of attack gradients. Scope employs dimension-wise normalization and differential scaling to amplify the distinction between backdoor dimensions and benign or unused ones, countering sophisticated attackers’ attempts to obscure them. Moreover, we develop a novel clustering approach, namely Dominant Gradient Clustering (DGC), to isolate and eliminate backdoor gradients. Extensive experiments across various datasets, models, FL settings, and adversary scenarios demonstrate that Scope consistently outperforms existing defenses by a significant margin, especially against the cosine-constrained attack. Additionally, we present a Scope-tailored attack designed to evade Scope, but it remains ineffective even when maximizing stealthiness, further underscoring the robustness of Scope. We release our source code at: https://github.com/siquanhuang/Scope.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
研究范围:联邦学习中受限后门攻击的检测
联邦学习(FL)允许多个客户端协同训练高效的深度学习模型,但容易受到后门攻击。传统的基于检测的防御依赖于特定的度量来区分客户端梯度。防御意识攻击者通过限制这些指标上的攻击梯度来逃避检测,从而导致指标约束攻击。本文具体举例了这些威胁,并介绍了余弦约束攻击,这种攻击成功地破坏了基于余弦距离的高级防御。为了解决上述挑战,我们提出了Scope,这是一种新的防御方法,通过暴露攻击梯度的受限后门维度,使用余弦距离检测余弦约束攻击。Scope使用维度标准化和差分缩放来放大后门维度与良性维度或未使用维度之间的区别,以对抗老练的攻击者模糊它们的企图。此外,我们开发了一种新的聚类方法,即优势梯度聚类(DGC),以隔离和消除后门梯度。在各种数据集、模型、FL设置和对手场景中进行的广泛实验表明,Scope始终以显著的优势优于现有的防御,特别是针对余弦约束攻击。此外,我们提出了一种针对范围的攻击,旨在逃避范围,但即使在最大限度地提高隐身性时,它仍然无效,进一步强调了范围的鲁棒性。我们的源代码发布在:https://github.com/siquanhuang/Scope。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Information Forensics and Security
IEEE Transactions on Information Forensics and Security 工程技术-工程:电子与电气
CiteScore
14.40
自引率
7.40%
发文量
234
审稿时长
6.5 months
期刊介绍: The IEEE Transactions on Information Forensics and Security covers the sciences, technologies, and applications relating to information forensics, information security, biometrics, surveillance and systems applications that incorporate these features
期刊最新文献
Bandwidth-Efficient Robust Threshold ECDSA in Three Rounds CShard: Blockchain Sharding via Repairable Fountain Codes and the Paradigm for Sharding Design AtomXross: Towards General Cross-Chain Transaction Differentially Private Zeroth-Order Methods for Scalable Large Language Model Fine-tuning PromptGuard: Soft Prompt-Guided Unsafe Content Moderation for Text-to-Image Models
×
引用
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