Double Strike: Breaking Approximation-Based Side-Channel Countermeasures for DNNs
Lorenzo Casalino, Maria M\'endez Real, Jean-Christophe Pr\'evotet, Rub\'en Salvador

TL;DR
This paper exposes vulnerabilities in MACPRUNING, a DNN side-channel countermeasure, demonstrating how control-flow dependencies can be exploited to recover most important weights, thus significantly reducing security.
Contribution
It introduces a preprocessing attack exploiting control-flow dependencies in MACPRUNING, showing how to recover critical DNN weights and exposing security flaws in the countermeasure.
Findings
Recovered 96% of important weights in experiments
Microarchitectural leakage enhances attack effectiveness
Achieved up to 100% recovery of targeted weights
Abstract
Deep neural networks (DNNs), which support services such as driving assistants and medical diagnoses, undergo lengthy and expensive training procedures. Therefore, the training's outcome - the DNN weights - represents a significant intellectual property asset to protect. Side-channel analysis (SCA) has recently appeared as an effective approach to recover this confidential asset from DNN implementations. In response, researchers have proposed to defend DNN implementations through classic side-channel countermeasures, at the cost of higher energy consumption, inference time, and resource utilisation. Following a different approach, Ding et al. (HOST'25) introduced MACPRUNING, a novel SCA countermeasure based on pruning, a performance-oriented Approximate Computing technique: at inference time, the implementation randomly prunes (or skips) non-important weights (i.e., with low…
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
TopicsSecurity and Verification in Computing · Cryptographic Implementations and Security · Adversarial Robustness in Machine Learning
