FLARE: Federated Learning Attack via Robust Expectation-Based Backdooring Using GAN

In Federated Learning (FL), multiple clients trains models locally, and their updates are aggregated on the server to form a global model, while preserving data privacy by shifting training to client side. However, the decentralized nature of FL is susceptible to several adversarial attacks, particularly backdoor attacks, where an adversary embeds a malicious task into the global model to misclassify trigger-injected samples while maintaining normal performance on normal samples raising a critical security concern. One of the main challenges in such attacks is their persistence, as the malicious behavior suffers to benign updates overwriting. Prior work have proposed to approximate benign updates for strategical backdoor injection, but their reliance on local data limits the effectiveness especially in non-IID settings. In this paper, we propose a two-stage attack strategy to address such limitations. First, we train a Generative Adversarial Network (GAN) based inference model exploiting the global model's feedback to infer other participant's data, reducing the gap between local and global distributions, rather than being restricted to local data only. Second, we optimize the attack by approximating benign updates and anticipating future global model updates, effectively improving backdoor persistency. Our results demonstrate that our strategy significantly enhances attack durability.

Authors

Institutions

Publication Details

Published
2025-06-23
DOI
https://doi.org/10.1109/ic_etc65981.2025.11141092
Primary Topic
Adversarial Robustness in Machine Learning
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

FLARE: Federated Learning Attack via Robust Expectation-Based Backdooring Using GAN

Kassem Kallas, Reda Bellafqira, Gouenou Coatrieux, Hichem Faraoun
Adversarial Robustness in Machine Learning
article

FLARE: Federated Learning Attack via Robust Expectation-Based Backdooring Using GAN

Kassem Kallas, Reda Bellafqira, Gouenou Coatrieux, Hichem Faraoun
article en

Abstract

In Federated Learning (FL), multiple clients trains models locally, and their updates are aggregated on the server to form a global model, while preserving data privacy by shifting training to client side. However, the decentralized nature of FL is susceptible to several adversarial attacks, particularly backdoor attacks, where an adversary embeds a malicious task into the global model to misclassify trigger-injected samples while maintaining normal performance on normal samples raising a critical security concern. One of the main challenges in such attacks is their persistence, as the malicious behavior suffers to benign updates overwriting. Prior work have proposed to approximate benign updates for strategical backdoor injection, but their reliance on local data limits the effectiveness especially in non-IID settings. In this paper, we propose a two-stage attack strategy to address such limitations. First, we train a Generative Adversarial Network (GAN) based inference model exploiting the global model's feedback to infer other participant's data, reducing the gap between local and global distributions, rather than being restricted to local data only. Second, we optimize the attack by approximating benign updates and anticipating future global model updates, effectively improving backdoor persistency. Our results demonstrate that our strategy significantly enhances attack durability.

Inserm (FR), IMT Atlantique (FR), Laboratoire de Traitement de l'Information Médicale (FR)
Openalex Percentile: Top 88%
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.