mlsanityData to 14 Oct 2026

PROFL: A Privacy-Preserving Federated Learning Method with Stringent Defense Against Poisoning Attacks

arXiv 2312.01045 ↗First posted 2 Dec 2023cs.CR cs.AI cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Federated Learning (FL) faces two major issues: privacy leakage and poisoning attacks, which may seriously undermine the reliability and security of the system. Overcoming them simultaneously poses a great challenge. This is because privacy protection policies prohibit access to users' local gradients to avoid privacy leakage, while Byzantine-robust methods necessitate access to these gradients to defend against poisoning attacks. To address these problems, we propose a novel privacy-preserving Byzantine-robust FL framework PROFL. PROFL is based on the two-trapdoor additional homomorphic encryption algorithm and blinding techniques to ensure the data privacy of the entire FL process. During the defense process, PROFL first utilize secure Multi-Krum algorithm to remove malicious gradients at the user level. Then, according to the Pauta criterion, we innovatively propose a statistic-based privacy-preserving defense algorithm to eliminate outlier interference at the feature level and resist impersonation poisoning attacks with stronger concealment. Detailed theoretical analysis proves the security and efficiency of the proposed method. We conducted extensive experiments on two benchmark datasets, and PROFL improved accuracy by 39% to 75% across different attack settings compared to similar privacy-preserving robust methods, demonstrating its significant advantage in robustness.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 18 references that are in the map. First posted on arXiv 2 Dec 2023.

Builds on

5 of 18 references.

References · 5

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  2. 2019Deep Leakage from Gradientscited by 1,021
  3. 2018How To Backdoor Federated Learningcited by 765
  4. 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 711
  5. 2019A Little Is Enough: Circumventing Defenses For Distributed Learningcited by 288

Built on by

Not cited yet.