Yantian Shen

dblp:336/5095 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
7since 2021 · last 2027
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 3 · 3 since 2021Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021
YearPublicationVenuePosition
2027 FCLs-PcaTr: Flight control-link signals detection and classification via physics-consistent augmentation and tri-view representation
Yantian Shen, Hongjun Wang 0004, Yang Yang 0023, Zeeshan Kaleem
Expert Syst. Appl.1
2025 Delving into Cryptanalytic Extraction of PReLU Neural Networks
Yi Chen 0011, Xiaoyang Dong 0001, Yantian Shen, Anyu Wang 0001, Xiaoyun Wang 0001
ASIACRYPT (2)4
2025 Internal differential structure: preimage attacks on up to 5-round Keccak
Xiaoen Lin, Zhengrong Lu, Yantian Shen, Chongxu Ren
Des. Codes Cryptogr.4
2025 DFCT-net for automatic modulation recognition in UAV communication systems
Yantian Shen, Hongjun Wang 0004
Neurocomputing1
2024 Hard-Label Cryptanalytic Extraction of Neural Network Models
Yi Chen 0011, Xiaoyang Dong 0001, Jian Guo 0001, Yantian Shen, Anyu Wang 0001, Xiaoyun Wang 0001
ASIACRYPT (8)4
2023 Neural-Aided Statistical Attack for Cryptanalysis
abstract
Abstract In Crypto’19, Gohr proposed the first deep learning-based key recovery attack on 11-round Speck32/64, which opens the direction of neural-aided cryptanalysis. Until now, neural-aided cryptanalysis still faces two problems: (i) the attack complexity estimations rely purely on practical experiments; (ii) it does not work when there are not enough neutral bits. To the best of our knowledge, we are the first to solve these two problems. In this paper, we propose a Neural-Aided Statistical Attack (NASA) that has the following advantages: (i) NASA supports estimating the theoretical complexity. (ii) NASA does not rely on any special properties including neutral bits. Moreover, we propose three methods for reducing the complexity of NASA. One of the methods, which is based on a newly proposed concept named Informative Bit that reveals an important phenomenon, makes NASA applicable to large-size ciphers. We have performed a series of experiments on round reduced Speck32/64, DES, and Speck96/96. These experiments do not only verify the correctness of NASA, but also further highlight the advantage and potential of NASA. Our work arguably raises a new direction for neural-aided cryptanalysis.
Yi Chen 0011, Yantian Shen
Comput. J.2
2023 A New Neural Distinguisher Considering Features Derived From Multiple Ciphertext Pairs
abstract
Abstract Neural-aided cryptanalysis is a challenging topic, in which the neural distinguisher ($\mathcal{ND}$) is a core module. In this paper, we propose a new $\mathcal{ND}$ considering multiple ciphertext pairs simultaneously. Besides, multiple ciphertext pairs are constructed from different keys. The motivation is that the distinguishing accuracy can be improved by exploiting features derived from multiple ciphertext pairs. To verify this motivation, we have applied this new $\mathcal{ND}$ to five different ciphers. Experiments show that taking multiple ciphertext pairs as input indeed brings accuracy improvement. Then, we prove that our new $\mathcal{ND}$ applies to two different neural-aided key recovery attacks. Moreover, the accuracy improvement is helpful for reducing the data complexity of the neural-aided statistic attack. The code is available at https://github.com/AI-Lab-Y/ND_mc.
Yi Chen 0011, Yantian Shen, Sitong Yuan
Comput. J.2