Untargeted poisoning attack based on fake clients and its defense in federated learning

Abstract Untargeted poisoning attacks pose a serious threat to federated learning. However, existing untargeted poisoning attacks have limitations. Most attacks assume that the adversary can control a large number of real clients, which is difficult to achieve in practice. Although the poisoning attack based on fake clients overcomes dependence on real clients. It causes the model to classify all data into default categories, which limits the effectiveness of the attack. Additionally, the fake local model updates are consistent, making them easily detectable by existing defenses. the attack is less stealth. To address these issues, we propose an Untargeted Poisoning Attack based on Fake Clients called UPA-FC. The attack manipulates key model layers based on their importance to enhance its effectiveness. We also introduce a random flipping strategy to reduce similarity between fake local updates, enhancing the stealth of the attack. To defend against UPA-FC, we propose a clustering-based defense scheme called D-UPA-FC. This scheme analyzes the distance matrix using a clustering algorithm. It determines the optimal clusters by calculating Euclidean distances to aggregate the global model. Experimental results show that UPA-FC outperforms the existing poisoning attack in terms of both effectiveness and stealth, while D-UPA-FC effectively defends against the UPA-FC.

Authors

Institutions

Publication Details

Journal
Cybersecurity
Published
2025-12-05
DOI
https://doi.org/10.1186/s42400-025-00389-y
Primary Topic
Adversarial Robustness in Machine Learning
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Untargeted poisoning attack based on fake clients and its defense in federated learning

Caimei Wang, Zhipeng Sun, Kuan Xu, Yiran Ren et al.
Cybersecurity
Adversarial Robustness in Machine Learning
article

Untargeted poisoning attack based on fake clients and its defense in federated learning

Caimei Wang, Zhipeng Sun, Kuan Xu, Yiran Ren, Jianzhong Pan, An He
article en

Abstract

Abstract Untargeted poisoning attacks pose a serious threat to federated learning. However, existing untargeted poisoning attacks have limitations. Most attacks assume that the adversary can control a large number of real clients, which is difficult to achieve in practice. Although the poisoning attack based on fake clients overcomes dependence on real clients. It causes the model to classify all data into default categories, which limits the effectiveness of the attack. Additionally, the fake local model updates are consistent, making them easily detectable by existing defenses. the attack is less stealth. To address these issues, we propose an Untargeted Poisoning Attack based on Fake Clients called UPA-FC. The attack manipulates key model layers based on their importance to enhance its effectiveness. We also introduce a random flipping strategy to reduce similarity between fake local updates, enhancing the stealth of the attack. To defend against UPA-FC, we propose a clustering-based defense scheme called D-UPA-FC. This scheme analyzes the distance matrix using a clustering algorithm. It determines the optimal clusters by calculating Euclidean distances to aggregate the global model. Experimental results show that UPA-FC outperforms the existing poisoning attack in terms of both effectiveness and stealth, while D-UPA-FC effectively defends against the UPA-FC.

CybersecurityVol. 8(1)
Hefei University (CN)
Hefei University
Openalex Percentile: Top 79%
Adversarial Robustness in Machine Learning
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.