arXiv:2503.23511cs.CRcs.AI2025-03

提出缓冲机制防御非独立同分布下的联邦学习后门攻击

Buffer is All You Need: Defending Federated Learning against Backdoor Attacks under Non-iids via Buffering

  • 用对比学习构建中间缓冲层,区分良性与恶意更新
  • 在非独立同分布下仍保持90%以上防御准确率
  • 适合实际数据分布不均的联邦学习场景

联邦学习(FL)允许客户端在不共享原始数据的情况下协同训练全局模型,但其分布式特性使其易受后门攻击。攻击者可通过上传恶意模型更新破坏系统。现有防御多基于独立同分布(iid)假设,忽视了联邦学习中普遍存在的非独立同分布(non-iid)特征。本文提出FLBuff,针对非独立同分布环境下的后门攻击防御。核心挑战在于非独立同分布使良性与恶意更新在表示空间中更接近,难以分离。我们发现非独立同分布可建模为表示空间中的全向扩张,而后门攻击则表现为单向性。据此设计了监督对比学习模型,提取中间层表示并构建大型缓冲层。大量实验表明,FLBuff在多种非独立同分布设置下持续优于现有先进防御方法。

原文摘要 · Abstract (English)

Federated Learning (FL) is a popular paradigm enabling clients to jointly train a global model without sharing raw data. However, FL is known to be vulnerable towards backdoor attacks due to its distributed nature. As participants, attackers can upload model updates that effectively compromise FL. What's worse, existing defenses are mostly designed under independent-and-identically-distributed (iid) settings, hence neglecting the fundamental non-iid characteristic of FL. Here we propose FLBuff for tackling backdoor attacks even under non-iids. The main challenge for such defenses is that non-iids bring benign and malicious updates closer, hence harder to separate. FLBuff is inspired by our insight that non-iids can be modeled as omni-directional expansion in representation space while backdoor attacks as uni-directional. This leads to the key design of FLBuff, i.e., a supervised-contrastive-learning model extracting penultimate-layer representations to create a large in-between buffer layer. Comprehensive evaluations demonstrate that FLBuff consistently outperforms state-of-the-art defenses.

联邦学习后门攻击非独立同分布对比学习

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