English

Undetectable Backdoors in Model Parameters: Hiding Sparse Secrets in High Dimensions

Cryptography and Security 2026-05-07 v1 Artificial Intelligence Machine Learning

Abstract

We present Sparse Backdoor, a supply-chain attack that plants a \emph{provably undetectable} backdoor in pre-trained image classifiers, including convolutional networks and Vision Transformers. The attack injects a structured sparse perturbation along a randomly chosen direction into a small subset of columns at each fully connected layer, propagating a trigger signal to an adversary-chosen target class, and masks the perturbation with an independent isotropic Gaussian dither. The dither serves a single technical purpose: it induces a clean reference distribution anchored at the pre-trained weights, against which undetectability can be formalized. Under a mild margin condition on the pre-trained classifier, we show that the dithered reference is functionally equivalent to the original classifier. We prove that distinguishing the backdoor-injected model from this reference is at least as hard as Sparse PCA detection, which is computationally infeasible under standard hardness assumptions. The guarantee holds against any probabilistic polynomial-time distinguisher with white-box access to the parameters.

Keywords

Cite

@article{arxiv.2605.04209,
  title  = {Undetectable Backdoors in Model Parameters: Hiding Sparse Secrets in High Dimensions},
  author = {Sarthak Choudhary and Atharv Singh Patlan and Nils Palumbo and Ashish Hooda and Kassem Fawaz and Somesh Jha},
  journal= {arXiv preprint arXiv:2605.04209},
  year   = {2026}
}
R2 v1 2026-07-01T12:51:42.376Z