Backdoor Attacks in Federated Learning

Overview

These attacks exploit local training and model aggregation to implant behavior that produces a target prediction when a trigger appears, often while preserving accuracy on ordinary inputs. Methods range from poisoned examples and patch triggers to semantic or contextual triggers, distributed and triggerless attacks, and updates designed to evade aggregation rules; studies span image, text, graph, vertical, and decentralized settings with heterogeneous clients. Defenses include robust aggregation such as Krum and trimmed mean, update anomaly and alignment checks, structural or spectral analysis, client reputation, active auditing, and post-training unlearning, measured by attack success alongside clean accuracy and false positives. A central tension is that stealthy adaptive attacks can evade defenses, especially under non-IID data, privacy constraints, or varied network topologies, while aggressive filtering can harm utility; realistic threat models and reproducible cross-setting evaluations remain important.

Latest papers

32 papers4 papers in the last four weeks, up 33% on the four weeks before. 0.0% of all new papers.

Nov 12, 2025

Unveiling Hidden Threats: Using Fractal Triggers to Boost Stealthiness of Distributed Backdoor Attacks in Federated Learning

Traditional distributed backdoor attacks (DBA) in federated learning improve stealthiness by decomposing global triggers into sub-triggers, which however requires more poisoned data to maintian the attck strength and hence increases the exposure risk. To overcome this defect, This paper proposes a novel method, namely Fractal-Triggerred Distributed Backdoor Attack (FTDBA), which leverages the self-similarity of fractals to enhance the feature strength of sub-triggers and hence significantly reduce the required poisoning volume for the same attack strength. To address the detectability of fractal structures in the frequency and gradient domains, we introduce a dynamic angular perturbation mechanism that adaptively adjusts perturbation intensity across the training phases to balance efficiency and stealthiness. Experiments show that FTDBA achieves a 92.3% attack success rate with only 62.4% of the poisoning volume required by traditional DBA methods, while reducing the detection rate by 22.8% and KL divergence by 41.2%. This study presents a low-exposure, high-efficiency paradigm for federated backdoor attacks and expands the application of fractal features in adversarial sample generation.
Aug 6, 2025

FLAT: Revealing Hidden Latent-Conditioned Backdoor Failures in Federated Learning

Horizontal federated learning (HFL) backdoor audits often summarize model behavior through clean accuracy (CA), mean attack success rate (ASR), or a single known-trigger test. Such summaries can hide a different failure mode, in which one target label is activated by many trigger realizations. We study this failure mode with FLAT, a latent-conditioned reliability stress test for HFL backdoors. In FLAT, compromised clients still submit ordinary classifier updates to the server, while an attacker-side generator G(x,t,z)G(x,t,z) separates target intent tt from trigger realization zz. This separation shifts the audit question from whether one known trigger succeeds to how the hidden behavior varies across targets, latent samples, defenses, and post-stop rounds. On CIFAR-10, CIFAR-100, and Tiny-ImageNet, FLAT preserves clean utility while reaching 99.49%, 99.66%, and 94.10% single-target FedAvg ASR. The evaluation also reveals non-uniform defense responses, where a server rule can suppress one target mode while leaving another active. These observations motivate HFL backdoor audits that report target-wise ASR, worst-target ASR, target coverage, latent-sampled behavior, post-stop persistence, and defense response.