Beyond Traditional Threats: A Persistent Backdoor Attack on Federated Learning
Tao Liu, Yuhang Zhang, Zhu Feng, Zhiqin Yang, Chen Xu, Dapeng Man, Wu Yang
TL;DR
This work addresses the persistence of backdoor attacks in federated learning by introducing FCBA, a combinatorics-based method that generates a full set of local triggers and assigns them to distinct malicious clients. By leveraging a model replacement strategy and a centralized aggregation of diverse local backdoor patterns, FCBA achieves higher attack persistence than prior methods across MNIST, CIFAR-10, and GTSRB, even under post-convergence injection. The authors provide extensive experiments, ablations, and robustness analyses, showing FCBA's strong persistence and its resistance to several defenses and differential privacy settings. The findings highlight a critical security concern for FL deployments and offer a framework for threat assessment and robustness evaluation against sophisticated backdoor strategies.
Abstract
Backdoors on federated learning will be diluted by subsequent benign updates. This is reflected in the significant reduction of attack success rate as iterations increase, ultimately failing. We use a new metric to quantify the degree of this weakened backdoor effect, called attack persistence. Given that research to improve this performance has not been widely noted,we propose a Full Combination Backdoor Attack (FCBA) method. It aggregates more combined trigger information for a more complete backdoor pattern in the global model. Trained backdoored global model is more resilient to benign updates, leading to a higher attack success rate on the test set. We test on three datasets and evaluate with two models across various settings. FCBA's persistence outperforms SOTA federated learning backdoor attacks. On GTSRB, postattack 120 rounds, our attack success rate rose over 50% from baseline. The core code of our method is available at https://github.com/PhD-TaoLiu/FCBA.
