CRARLGOct 28, 2025

Attack on a PUF-based Secure Binary Neural Network

arXiv:2510.24422v11 citationsh-index: 2
Originality Incremental advance
AI Analysis

This exposes a security flaw in a recent method for protecting BNNs against theft attacks, which is incremental but critical for edge computing applications.

The paper demonstrates that a PUF-based scheme for securing Binarized Neural Networks (BNNs) is vulnerable to a key recovery attack, recovering 85% of the PUF key and achieving 93% classification accuracy compared to the original 96% accuracy.

Binarized Neural Networks (BNNs) deployed on memristive crossbar arrays provide energy-efficient solutions for edge computing but are susceptible to physical attacks due to memristor nonvolatility. Recently, Rajendran et al. (IEEE Embedded Systems Letter 2025) proposed a Physical Unclonable Function (PUF)-based scheme to secure BNNs against theft attacks. Specifically, the weight and bias matrices of the BNN layers were secured by swapping columns based on device's PUF key bits. In this paper, we demonstrate that this scheme to secure BNNs is vulnerable to PUF-key recovery attack. As a consequence of our attack, we recover the secret weight and bias matrices of the BNN. Our approach is motivated by differential cryptanalysis and reconstructs the PUF key bit-by-bit by observing the change in model accuracy, and eventually recovering the BNN model parameters. Evaluated on a BNN trained on the MNIST dataset, our attack could recover 85% of the PUF key, and recover the BNN model up to 93% classification accuracy compared to the original model's 96% accuracy. Our attack is very efficient and it takes a couple of minutes to recovery the PUF key and the model parameters.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes