← Back to all news
arXiv Machine Learning By Anh Tu Ngo, Anupam Chattopadhyay, Subhamoy Maitra

Cryptographic Backdoor for Neural Networks: Boon and Bane

Read the original on arXiv Machine Learning →

arXiv:2509. 20714v2 Announce Type: replace-cross Abstract: In this paper we show that cryptographic backdoors in a neural network (NN) can be highly effective in two directions, namely mounting the attacks as well as in presenting the defenses as well.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Aug 26

Encrypted Neural Networks without Overflows

arXiv:2605.23096v2 Announce Type: replace-cross Abstract: The popular Cheon-Kim-Kim-Song (CKKS) scheme enables efficient private inference in neural networks by evaluating them on encrypted data. Sin...

By Philipp Kern, Lorenzo Rovida, Samuel Teuber, Edoardo Manino, Carsten Sinz, Alberto Leporati
More like this →
arXiv Computer Vision
Sep 21

Privacy Leakage on DNNs: A Survey of Model Inversion Attacks and Defenses

The paper "Privacy Leakage on DNNs: A Survey of Model Inversion Attacks and Defenses" provides a comprehensive review of model inversion (MI) attacks that exploit trained deep neural networks to reconstruct private training data. It traces the evolution of MI from early machine‑learning contexts to recent DNN‑based attacks across various modalities and learning tasks, offering a detailed taxonomy and comparative analysis of both attacks and defenses. The authors also present an open‑source toolbox on GitHub to support further research in this area.

By Hao Fang, Yixiang Qiu, Hongyao Yu, Wenbo Yu, Jiawei Kong, Baoli Chong, Bin Chen, Xuan Wang, Shu-Tao Xia, Ke Xu
safety
More like this →
arXiv Machine Learning
Aug 27

Provable Privacy Attacks on Trained Shallow Neural Networks

The paper investigates provable privacy attacks on trained 2‑layer ReLU neural networks, specifically membership inference and data reconstruction. It demonstrates that the implicit bias of such networks can be leveraged to identify, with high probability, whether a given point was part of the training set in high‑dimensional, nearly orthogonal settings, and to construct a finite set containing a constant fraction of training points in a univariate setting. This work claims to be the first to reveal provable vulnerabilities arising from implicit bias in shallow neural networks.

By Guy Smorodinsky, Gal Vardi, Itay Safran
safety
More like this →