mlsanityData to 7 Oct 2026

A Whole-Process Certifiably Robust Aggregation Method Against Backdoor Attacks in Federated Learning

arXiv 2407.00719 ↗First posted 30 Jun 2024cs.CR cs.DC cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Federated Learning (FL) has garnered widespread adoption across various domains such as finance, healthcare, and cybersecurity. Nonetheless, FL remains under significant threat from backdoor attacks, wherein malicious actors insert triggers into trained models, enabling them to perform certain tasks while still meeting FL's primary objectives. In response, robust aggregation methods have been proposed, which can be divided into three types: ex-ante, ex-durante, and ex-post methods. Given the complementary nature of these methods, combining all three types is promising yet unexplored. Such a combination is non-trivial because it requires leveraging their advantages while overcoming their disadvantages. Our study proposes a novel whole-process certifiably robust aggregation (WPCRA) method for FL, which enhances robustness against backdoor attacks across three phases: ex-ante, ex-durante, and ex-post. Moreover, since the current geometric median estimation method fails to consider differences among clients, we propose a novel weighted geometric median estimation algorithm (WGME). This algorithm estimates the geometric median of model updates from clients based on each client's weight, further improving the robustness of WPCRA against backdoor attacks. We also theoretically prove that WPCRA offers improved certified robustness guarantees with a larger certified radius. We evaluate the advantages of our methods based on the task of loan status prediction. Comparison with baselines shows that our methods significantly improve FL's robustness against backdoor attacks. This study contributes to the literature with a novel WPCRA method and a novel WGME algorithm. Our code is available at https://github.com/brick-brick/WPCRAM.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 47 references that are in the map. First posted on arXiv 30 Jun 2024.

Builds on

22 of 47 references.

References · 22

  1. 2019Advances and Open Problems in Federated Learningcited by 3,021
  2. 2018How To Backdoor Federated Learningcited by 745
  3. 2018Certified Robustness to Adversarial Examples with Differential Privacycited by 462
  4. 2018Analyzing Federated Learning through an Adversarial Lenscited by 346
  5. 2018The Hidden Vulnerability of Distributed Learning in Byzantiumcited by 324
  6. 2019Robust Aggregation for Federated Learningcited by 314
  7. 2020Attack of the Tails: Yes, You Really Can Backdoor Federated Learningcited by 307
  8. 2020Systematic Evaluation of Privacy Risks of Machine Learning Modelscited by 273
  9. 2020Data Poisoning Attacks Against Federated Learning Systemscited by 266
  10. 2019Can You Really Backdoor Federated Learning?cited by 250
  11. 2022FedALA: Adaptive Local Aggregation for Personalized Federated Learningcited by 121
  12. 2019Multimodal End-to-End Autonomous Drivingcited by 110
10 more
  1. 2021CRFL: Certifiably Robust Federated Learning against Backdoor Attackscited by 91
  2. 2020Learning to Detect Malicious Clients for Robust Federated Learningcited by 86
  3. 2022DeepSight: Mitigating Backdoor Attacks in Federated Learning Through Deep Model Inspectioncited by 78
  4. 2022FedDM: Iterative Distribution Matching for Communication-Efficient Federated Learningcited by 65
  5. 2022Faster Adaptive Federated Learningcited by 35
  6. 2023Chameleon: Adapting to Peer Images for Planting Durable Backdoors in Federated Learningcited by 20
  7. 2021Robust Federated Learning with Attack-Adaptive Aggregationcited by 17
  8. 2023Revisiting Personalized Federated Learning: Robustness Against Backdoor Attackscited by 16
  9. 2024Beyond Traditional Threats: A Persistent Backdoor Attack on Federated Learningcited by 15
  10. 2022UA-FedRec: Untargeted Attack on Federated News Recommendationcited by 8

Built on by

Not cited yet.