Pith. sign in

REVIEW 1 cited by

Model Poisoning Attacks to Federated Learning via Multi-Round Consistency

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.15611 v3 pith:A6K6FRRY submitted 2024-04-24 cs.CR

classification cs.CR
keywords modelattacksclientspoisonedflpoisoningconsistencydefensestraining
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Model poisoning attacks are critical security threats to Federated Learning (FL). Existing model poisoning attacks suffer from two key limitations: 1) they achieve suboptimal effectiveness when defenses are deployed, and/or 2) they require knowledge of the model updates or local training data on genuine clients. In this work, we make a key observation that their suboptimal effectiveness arises from only leveraging model-update consistency among malicious clients within individual training rounds, making the attack effect self-cancel across training rounds. In light of this observation, we propose PoisonedFL, which enforces multi-round consistency among the malicious clients' model updates while not requiring any knowledge about the genuine clients. Our empirical evaluation on five benchmark datasets shows that PoisonedFL breaks eight state-of-the-art defenses and outperforms seven existing model poisoning attacks. Moreover, we also explore new defenses that are tailored to PoisonedFL, but our results show that we can still adapt PoisonedFL to break them. Our study shows that FL systems are considerably less robust than previously thought, underlining the urgency for the development of new defense mechanisms.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. FedGraM: Defending Against Untargeted Attacks in Federated Learning via Embedding Gram Matrix

    cs.LG 2025-05 conditional novelty 5.0 of 10

    A server that keeps one example per class can detect and drop malicious federated-learning clients by measuring how separated their learned embeddings are, via the norm of a Gram matrix.

Pith tools