Free-riders in Federated Learning: Attacks and Defenses
Jierui Lin, Min Du, Jian Liu

TL;DR
This paper introduces the concept of free rider attacks in federated learning, demonstrating how malicious clients can deceive the system without local data, and proposes a high-dimensional detection method called STD-DAGMM to counter these attacks.
Contribution
It is the first to define free rider attacks in federated learning, analyze potential attack strategies, and develop a novel detection method for such adversarial behaviors.
Findings
Proposed the concept of free rider attacks in federated learning.
Developed the STD-DAGMM anomaly detection method.
Extended analysis to include multiple free riders and differential privacy.
Abstract
Federated learning is a recently proposed paradigm that enables multiple clients to collaboratively train a joint model. It allows clients to train models locally, and leverages the parameter server to generate a global model by aggregating the locally submitted gradient updates at each round. Although the incentive model for federated learning has not been fully developed, it is supposed that participants are able to get rewards or the privilege to use the final global model, as a compensation for taking efforts to train the model. Therefore, a client who does not have any local data has the incentive to construct local gradient updates in order to deceive for rewards. In this paper, we are the first to propose the notion of free rider attacks, to explore possible ways that an attacker may construct gradient updates, without any local training data. Furthermore, we explore possible…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Cryptography and Data Security · Adversarial Robustness in Machine Learning
