mlsanityData to 7 Oct 2026

PFAttack: Stealthy Attack Bypassing Group Fairness in Federated Learning

arXiv 2410.06509 ↗First posted 9 Oct 2024cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Federated learning (FL), integrating group fairness mechanisms, allows multiple clients to collaboratively train a global model that makes unbiased decisions for different populations grouped by sensitive attributes (e.g., gender and race). Due to its distributed nature, previous studies have demonstrated that FL systems are vulnerable to model poisoning attacks. However, these studies primarily focus on perturbing accuracy, leaving a critical question unexplored: Can an attacker bypass the group fairness mechanisms in FL and manipulate the global model to be biased? The motivations for such an attack vary; an attacker might seek higher accuracy, yet fairness considerations typically limit the accuracy of the global model or aim to cause ethical disruption. To address this question, we design a novel form of attack in FL, termed Profit-driven Fairness Attack (PFAttack), which aims not to degrade global model accuracy but to bypass fairness mechanisms. Our fundamental insight is that group fairness seeks to weaken the dependence of outputs on input attributes related to sensitive information. In the proposed PFAttack, an attacker can recover this dependence through local fine-tuning across various sensitive groups, thereby creating a biased yet accuracy-preserving malicious model and injecting it into FL through model replacement. Compared to attacks targeting accuracy, PFAttack is more stealthy. The malicious model in PFAttack exhibits subtle parameter variations relative to the original global model, making it robust against detection and filtering by Byzantine-resilient aggregations. Extensive experiments on benchmark datasets are conducted for four fair FL frameworks and three Byzantine-resilient aggregations against model poisoning, demonstrating the effectiveness and stealth of PFAttack in bypassing group fairness mechanisms in FL.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 27 of its 40 references that are in the map. First posted on arXiv 9 Oct 2024.

Builds on

27 of 40 references.

References · 27

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  2. 2019A Survey on Bias and Fairness in Machine Learningcited by 1,911
  3. 2018How To Backdoor Federated Learningcited by 745
  4. 2014Certifying and removing disparate impactcited by 715
  5. 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 698
  6. 2016Inherent Trade-Offs in the Fair Determination of Risk Scorescited by 582
  7. 2019Local Model Poisoning Attacks to Byzantine-Robust Federated Learningcited by 479
  8. 2021Retiring Adult: New Datasets for Fair Machine Learningcited by 443
  9. 2019Fair Resource Allocation in Federated Learningcited by 389
  10. 2018Analyzing Federated Learning through an Adversarial Lenscited by 346
  11. 2020Attack of the Tails: Yes, You Really Can Backdoor Federated Learningcited by 307
  12. 2020Data Poisoning Attacks Against Federated Learning Systemscited by 266
15 more
  1. 2021FairFed: Enabling Group Fairness in Federated Learningcited by 114
  2. 2020FairBatch: Batch Selection for Model Fairnesscited by 99
  3. 2022Neurotoxin: Durable Backdoors in Federated Learningcited by 97
  4. 2020Fairness-aware Agnostic Federated Learningcited by 87
  5. 2021Federated Learning with Fair Averagingcited by 59
  6. 2021Addressing Algorithmic Disparity and Performance Inconsistency in Federated Learningcited by 50
  7. 2020Exacerbating Algorithmic Bias through Fairness Attackscited by 47
  8. 2021Training Fair Models in Federated Learning without Data Privacy Infringementcited by 26
  9. 2022Minimax Demographic Group Fairness in Federated Learningcited by 24
  10. 2020Group Fairness by Probabilistic Modeling with Latent Fair Decisionscited by 22
  11. 2022Towards Understanding Fairness and its Composition in Ensemble Machine Learningcited by 17
  12. 2021Fair Representation: Guaranteeing Approximate Multiple Group Fairness for Unknown Taskscited by 16
  13. 2022Fair Federated Learning via Bounded Group Losscited by 12
  14. 2023A Four-Pronged Defense Against Byzantine Attacks in Federated Learningcited by 9
  15. 2021Matchings with Group Fairness Constraints: Online and Offline Algorithmscited by 8

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.