End-to-End Hard-Label Cryptanalytic Model Extraction Using Efficient Sign Recovery
Organizations: Tohoku University 2–1–1 Katahira, Aoba-ku, Sendai-shi, 980-8577, Japan · NTT Social Informatics Laboratories, 3–9–11 Midori-cho, Musashino-shi, Tokyo, 180-8585, Japan
Abstract
The importance of deep neural networks (DNNs) is widely recognized, and the parameters obtained through training are regarded as valuable assets. Recently, attacks that extract these parameters using only oracle queries to a DNN have been actively studied at IACR conferences. The hard-label setting is the most challenging setting for model extraction, where an adversary can observe only the final output label, such as "dog" or "cat." At Eurocrypt 2025, Carlini et al. proposed polynomial-time hard-label extraction of ReLU-based MLPs. However, one step of this attack process, i.e., sign recovery, requires a large number of queries and substantial computation. Implementing this step in a black-box setting remains difficult. Consequently, a fully black-box end-to-end demonstration on trained deep ReLU MLPs has remained a challenge. In this paper, we propose a new sign-recovery algorithm based on a completely different principle from the existing method. Our method requires no dedicated queries for sign recovery. In our experiments, it achieves higher sign-recovery accuracy than the existing method. Consequently, it enables efficient sign recovery even for trained models. With our sign-recovery algorithm, all steps of hard-label model extraction can be implemented in a black-box setting. By combining these implementations, we demonstrate end-to-end model extraction from models trained on MNIST and Fashion-MNIST, with width 16 and 4 or 6 hidden layers, achieving over 98% label agreement.
Figures & tables
| Symbol | Description |
|---|---|
| ReLU network with layers | |
| ReLU function applied component-wise | |
| weight matrix in the th layer | |
| bias vector in the th layer | |
| output vector for input after the th layer | |
| forward local linear matrix up to the th layer for input |
| Signature-weighted cosine | Boundary-walking | ||||
|---|---|---|---|---|---|
| Layer | Evaluated | Correct (HC) | Wrong (HC) | Correct (HC) | Wrong (HC) |
| 2 | 128 | 127 (119) | 1 (0) | 105 (0) | 23 (0) |
| 3 | 128 | 128 (110) | 0 (0) | 85 (0) | 43 (0) |
| 4 | 128 | 128 (120) | 0 (0) | 80 (0) | 48 (0) |
| 5 | 126 | 123 (107) | 3 (0) | 67 (0) | 59 (0) |
| Model | Metric | Int. space collection | L1 | L2 | L3 | L4 | L5 | L6 | L7 | Entire model |
| MNIST 784- -10 | Active neurons | – | 16 | 16 | 16 | 16 | 10 | – | – | 74 |
| Recovered neurons | – | 16 | 16 | 16 | 16 | 10 | – | – | 74 | |
| Signature time | – | 2.95s | 4.20s | 9.02s | 5.15s | 3.20s | – | – | 25s | |
| Sign time | – | 0.23s | 44s | 29s | 31s | 0.23ms | – | – | 1m44s | |
| Total queries | – | – | ||||||||
| MNIST 784- -10 | Active neurons | – | 16 | 16 | 15 | 15 | 15 | 16 | 10 | 103 |
Appendix figures & tables2 assets
Supplementary material from the paper’s appendix.
Appendix
| Random | MNIST | Prediction | |||
|---|---|---|---|---|---|
| 2nd layer | 4th layer | 2nd layer | 4th layer | ||
| 50 | 0.6786 | 0.6602 | 0.6714 | 0.6699 | 0.6579 |
| 55 | 0.7629 | 0.7648 | 0.7500 | 0.7713 | 0.7746 |
| 60 | 0.9057 | 0.9049 | 0.9027 | 0.9012 | 0.9091 |
| 65 | 1.0550 | 1.0758 | 1.0501 | 1.0879 | 1.0656 |
| 70 | 1.2378 | 1.3441 | 1.2487 | – | 1.2500 |
Model Extraction Attacks
Model extraction attacks infer a machine-learning model’s behavior, architecture, parameters, or hidden assets from queries and system leakage.
See all 48 papers