RSIA: Defending Against Dynamic Collusive Attacks in Federated Learning

Federated learning, unlike centralized training, enables multiple clients to train a global model without exposing raw data, making it useful for applications such as medical diagnosis in smart healthcare and mobile edge networks. This setting is vulnerable to dynamic collusive attacks, where colluding clients coordinate abnormal parameter updates and adjust their strategies across training rounds. Existing studies address this problem with isolated mechanisms that focus on a single defense stage, but such mechanisms are insufficient for attacks that evolve across rounds. To address this challenge, we propose reputation-aware Stackelberg incentive aggregation (RSIA) to mitigate the influence of dynamic collusive attacks while balancing model utility in federated learning. Specifically, we first use incentive rules before local training to make repeated collusive behavior less beneficial. We then update client reputation after each round, so earlier unreliable behavior affects later incentives. Finally, we use reputation and update reliability to weight client updates, reducing the influence of abnormal updates on global model training. Experiments on three datasets show that RSIA reduces the average effective attack success rate by 84.9% compared with representative state-of-the-art (SOTA) methods. RSIA also maintains competitive test accuracy, providing a favorable trade-off between model utility and attack suppression.

Authors

Institutions

Publication Details

Journal
Computers
Published
2026-10-13
DOI
https://doi.org/10.3390/computers15100713
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

RSIA: Defending Against Dynamic Collusive Attacks in Federated Learning

Lihong Kong, Yihan Wang, Su Yu, Bintao Wang et al.
Computers
Privacy-Preserving Technologies in Data
article

RSIA: Defending Against Dynamic Collusive Attacks in Federated Learning

Lihong Kong, Yihan Wang, Su Yu, Bintao Wang, Yinsong Jiao
article en

Abstract

Federated learning, unlike centralized training, enables multiple clients to train a global model without exposing raw data, making it useful for applications such as medical diagnosis in smart healthcare and mobile edge networks. This setting is vulnerable to dynamic collusive attacks, where colluding clients coordinate abnormal parameter updates and adjust their strategies across training rounds. Existing studies address this problem with isolated mechanisms that focus on a single defense stage, but such mechanisms are insufficient for attacks that evolve across rounds. To address this challenge, we propose reputation-aware Stackelberg incentive aggregation (RSIA) to mitigate the influence of dynamic collusive attacks while balancing model utility in federated learning. Specifically, we first use incentive rules before local training to make repeated collusive behavior less beneficial. We then update client reputation after each round, so earlier unreliable behavior affects later incentives. Finally, we use reputation and update reliability to weight client updates, reducing the influence of abnormal updates on global model training. Experiments on three datasets show that RSIA reduces the average effective attack success rate by 84.9% compared with representative state-of-the-art (SOTA) methods. RSIA also maintains competitive test accuracy, providing a favorable trade-off between model utility and attack suppression.

ComputersVol. 15(10)
Shanghai University of Engineering Science (CN)
Openalex Percentile: Top 13%
Privacy-Preserving Technologies in Data
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.