Secure and Private Federated Learning: Achieving Adversarial Resilience through Robust Aggregation
Kun Yang, Neena Imam

TL;DR
This paper introduces ArKrum, a robust aggregation method for federated learning that enhances security and privacy by resisting adversarial attacks without prior knowledge of malicious client count.
Contribution
ArKrum combines median filtering and multi-update averaging to improve robustness and privacy in federated learning against Byzantine threats.
Findings
ArKrum achieves high accuracy under various Byzantine attacks.
It outperforms traditional aggregation methods in robustness.
It maintains stability even with non-i.i.d. data distributions.
Abstract
Federated Learning (FL) enables collaborative machine learning across decentralized data sources without sharing raw data. It offers a promising approach to privacy-preserving AI. However, FL remains vulnerable to adversarial threats from malicious participants, referred to as Byzantine clients, who can send misleading updates to corrupt the global model. Traditional aggregation methods, such as simple averaging, are not robust to such attacks. More resilient approaches, like the Krum algorithm, require prior knowledge of the number of malicious clients, which is often unavailable in real-world scenarios. To address these limitations, we propose Average-rKrum (ArKrum), a novel aggregation strategy designed to enhance both the resilience and privacy guarantees of FL systems. Building on our previous work (rKrum), ArKrum introduces two key innovations. First, it includes a median-based…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning
