Breaking the De-Pois Poisoning Defense
Alaa Anani, Mohamed Ghanem, Lotfy Abdel Khaliq

TL;DR
This paper demonstrates that the De-Pois poisoning defense, which uses a critic model to detect poisoned data, can be bypassed through white-box and black-box attacks, exposing its vulnerabilities.
Contribution
We show that the De-Pois defense is vulnerable to composed gradient-sign attacks, revealing its limitations against informed adversaries.
Findings
De-Pois defense can be bypassed with white-box attacks.
The critic model in De-Pois is vulnerable to gradient-sign attacks.
Poisoning defenses need to consider adaptive attack strategies.
Abstract
Attacks on machine learning models have been, since their conception, a very persistent and evasive issue resembling an endless cat-and-mouse game. One major variant of such attacks is poisoning attacks which can indirectly manipulate an ML model. It has been observed over the years that the majority of proposed effective defense models are only effective when an attacker is not aware of them being employed. In this paper, we show that the attack-agnostic De-Pois defense is hardly an exception to that rule. In fact, we demonstrate its vulnerability to the simplest White-Box and Black-Box attacks by an attacker that knows the structure of the De-Pois defense model. In essence, the De-Pois defense relies on a critic model that can be used to detect poisoned data before passing it to the target model. In our work, we break this poison-protection layer by replicating the critic model and…
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 · Anomaly Detection Techniques and Applications · Advanced Malware Detection Techniques
MethodsAttentive Walk-Aggregating Graph Neural Network
