SNEAKDOOR: Stealthy Backdoor Attacks against Distribution Matching-based Dataset Condensation
Authors: He Yang, Dongyi Lv, Song Ma, Wei Xi, Jizhong Zhao
Organizations: School of Computer Science and Technology, Xi’an Jiaotong University, Xi’an, China · National Key Laboratory of Human-Machine Hybrid Augmented Intelligence, Xi’an Jiaotong University, Xi’an, China
Dataset condensation aims to synthesize compact yet informative datasets that retain the training efficacy of full-scale data, offering substantial gains in efficiency. Recent studies reveal that the condensation process can be vulnerable to backdoor attacks, where malicious triggers are injected into the condensation dataset, manipulating model behavior during inference. While prior approaches have made progress in balancing attack success rate and clean test accuracy, they often fall short in preserving stealthiness, especially in concealing the visual artifacts of condensed data or the perturbations introduced during inference. To address this challenge, we introduce Sneakdoor, which enhances stealthiness without compromising attack effectiveness. Sneakdoor exploits the inherent vulnerability of class decision boundaries and incorporates a generative module that constructs input-aware triggers aligned with local feature geometry, thereby minimizing detectability. This joint design enables the attack to remain imperceptible to both human inspection and statistical detection. Extensive experiments across multiple datasets demonstrate that Sneakdoor achieves a compelling balance among attack success rate, clean test accuracy, and stealthiness, substantially improving the invisibility of both the synthetic data and triggered samples while maintaining high attack efficacy. The code is available at https://github.com/XJTU-AI-Lab/SneakDoor.
Figures & tables
Figure 1: Stealthiness Illustration
Figure 2: Attack Performance on STL10. Larger area indicates better balance.
Figure 3: Attack Performance on Tiny-ImageNet. Larger area indicates better balance.
Figure 4: Stealthiness Performance on STL10
Appendix figures & tables9 assets
Supplementary material from the paper’s appendix.
Appendix
Method
ASR
CTA
PNSR
SSIM
IS
DM
0.9809±0.0000
0.5625±0.0007
68.62
0.6673
2.25e-4
DAM
0.9429±0.0008
0.4598±0.0003
72.16
0.6814
2.08e-4
Appendix
Table 9: Attack Performance of Sneakdoor on the ImageNette Dataset.
Method
ipc
ASR
CTA
PSNR
SSIM
IS
DM
10
0.8735±0.0009
0.4347±0.0003
73.0381
0.8211
9.05e-5
DM
20
0.9872±0.0005
0.4882±0.0008
73.5021
0.7950
1.32e-4
DM
50
0.9725±0.0000
0.5979±0.0006
70.1216
0.8066
1.41e-4
IDM
10
0.9778±0.0015
0.5965±0.0004
74.1393
0.8199
1.05e-4
IDM
20
0.9573±0.0009
0.6217±0.0006
73.9608
0.8049
2.39e-4
IDM
50
0.9790±0.0009
0.6582±0.0005
70.1548
0.7554
1.40e-4
Appendix
Table 10: Impact of IPC on Attack Performance
Method
ε
ASR
CTA
PSNR
SSIM
IS
DM
0.1
0.7755±0.0049
0.6045±0.0009
82.1241
0.9548
2.97e-5
DM
0.2
0.9332±0.0006
0.5824±0.0008
76.9565
0.8769
5.46e-5
DM
0.3
0.9732±0.000
0.5981±0.0010
74.0076
0.7963
6.32e-5
IDM
0.1
0.5400±0.0076
0.6627±0.0010
78.7475
0.7914
1.14e-4
IDM
0.2
0.7905±0.0073
0.6624±0.0013
76.4274
0.7931
1.30e-4
IDM
0.3
0.9790±0.0009
0.6582±0.0005
70.1548
0.8054
1.40e-4
Appendix
Table 11: Impact of Perturbation Bound ε on Attack Performance
Method
poison ratio
ASR
CTA
PSNR
SSIM
IS
DM
0.10
0.8810±0.0020
0.5986±0.001
74.0086
0.8285
8.82e-5
DM
0.25
0.8970±0.0019
0.6009±0.0009
73.7735
0.7942
9.55e-5
DM
0.5
0.9725±0.0000
0.5979±0.0006
73.0076
0.7963
1.14e-4
IDM
0.10
0.8205±0.0026
0.6645±0.0015
74.0362
0.7803
2.61e-4
IDM
0.25
0.8615±0.0044
0.6592±0.0007
70.2375
0.7788
1.33e-4
IDM
0.5
0.9790±0.0009
0.6582±0.0005
70.1548
0.7554
1.40e-4
Appendix
Table 12: Impact of Poisoning Ratio on Attack Performance
Figure 5: STL10 Stealthiness Illustration
Hyperparameter
Value
Optimizer
SGD
Batch size
256
Learning rate
0.01
Momentum
0.9
Weight decay
0.0005
Epochs
50
Appendix
Table 15: Hyperparameters for Surrogate Model Training
Hyperparameter
Value
Learning rate
5e-5
Perturbation scaling factor α
0.25
Maximum perturbation bound ε
0.5
Appendix
Table 16: Hyperparameters for Trigger Generator Training
Hyperparameter
Value
Images per class (IPC)
50
Condensation epochs
20000
Synthesis learning rate
1.0
Batch size
256
Optimizer
Adam
Appendix
Table 17: Hyperparameters for Malicious Dataset Condensation
Hyperparameter
Value
Optimizer
SGD
Batch size
256
Learning rate
0.01
Momentum
0.9
Weight decay
0.0005
Epochs
10000
Appendix
Table 18: Hyperparameters for Downstream Model Training
Dataset Condensation (DC) is a data-efficient learning paradigm that synthesizes small yet informative datasets, enabling models to match the performance of full-data training. However, recent work exposes a critical vulnerability of DC to backdoor attacks, where malicious patterns (e.g., triggers) are implanted into the condensation dataset, inducing targeted misclassification on specific inputs. Existing attacks always prioritize attack effectiveness and model utility, overlooking the crucial dimension of stealthiness. To bridge this gap, we propose InkDrop, which enhances the imperceptibility of malicious manipulation without degrading attack effectiveness and model utility. InkDrop leverages the inherent uncertainty near model decision boundaries, where minor input perturbations can induce semantic shifts, to construct a stealthy and effective backdoor attack. Specifically, InkDrop first selects candidate samples near the target decision boundary that exhibit latent semantic affinity to the target class. It then learns instance-dependent perturbations constrained by perceptual and spatial consistency, embedding targeted malicious behavior into the condensed dataset. Extensive experiments across diverse datasets validate the overall effectiveness of InkDrop, demonstrating its ability to integrate adversarial intent into condensed datasets while preserving model utility and minimizing detectability. Our code is available at https://github.com/lvdongyi/InkDrop.
Traditional backdoor attacks inject artificial trigger patterns into training data, causing models to misclassify triggered inputs while maintaining normal behavior on clean samples. Since these artificial triggers are absent in clean datasets, standard knowledge distillation (KD) typically eliminates them, leading to the common belief that KD serves as an effective purification defense. In this paper, we propose DAR (Discover-and-Relabel), a support-persistent backdoor method that retains its behavior even after clean-data distillation. DAR identifies naturally abundant patterns in low-dimensional feature subspaces using subspace clustering and applies label-only poisoning to samples that inherently satisfy the discovered rule. At test time, the backdoor is activated by locally modifying the corresponding subspace of the target images. By instantiating spatial and frequency operators, DAR achieves attack accuracy comparable to state-of-the-art backdoor attacks in ImageNet classification and CLIP-based prompt tuning. Notably, DAR keeps attack success above 96% after clean KD and remains defense-resistant in practice. Project page: https://junhoo.me/backdoor
Despite recent progress in backdoor attacks, existing methods remain susceptible to post-training defenses that erase the backdoor through fine-tuning or pruning. We revisit the core objectives of backdoor attacks and derive principled criteria characterizing optimal sample-specific trigger construction under a Bayes-optimal model of the victim's training. Our analysis reveals that both attack success and clean-accuracy preservation are simultaneously optimized when triggered samples are steered into low-density regions of the clean data distribution, a distributional condition that controls all moments of the poisoned distribution at once rather than a handful of input-space summary statistics. We introduce a bilevel optimization framework that estimates density ratios via conditional time-score matching and optimizes a mixture-model objective to place triggered samples in these sparse regions. Extensive evaluations on MNIST, CIFAR-10, GTSRB, and TinyImageNet demonstrate that our method achieves above 99% attack success rate before defense and retains 50--85 percentage points higher post-defense ASR than the strongest baselines under fine-tuning defenses. Against neuron-pruning defenses, the method exhibits complete immunity, with zero neurons identified for removal across all pruning thresholds. These results expose a fundamental gap in current defense paradigms and underscore the need for defenses that operate beyond the support of the clean distribution.
Qiyuan Wang, Yao Li, Raymond K. W. Wong
Texas A&M University · University of North Carolina at Chapel Hill