Yingjian Yan

dblp:71/7759 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2026
0009-0004-9022-184XORCID · corroborated

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

Security and privacy · 3 · 3 since 2021Systems, architecture and hardware · 1 · 1 since 2021
YearPublicationVenuePosition
2026 Side-Channel Analysis Based on Multiple Leakage Models Ensemble
abstract
In an era where cryptographic devices are widely used, research on Side-Channel Analysis (SCA) has attracted significant attention. While Deep Learning-based SCA (DLSCA) demonstrates notable advantages with the rapid development of deep learning, its performance remains constrained by reliance on single leakage model, leading to inefficient attacks and inadequate information utilization–particularly in grey-box scenarios where optimal leakage point identification proves challenging. Traditional ensemble methods attempting multiple leakage points combination are limited to either homogeneous models or manual feature fusion, failing to address the collaborative optimization of heterogeneous leakage features. To overcome these limitations, we propose a side-channel analysis framework based on multiple leakage models ensemble. This approach defines the training process of neural networks under different leakage models as base learners and employs Bagging ensemble learning to combine complementary leakage characteristics from heterogeneous leakage models. Thereby, it collaboratively optimizes multi-dimensional physical leakage features, significantly improving the efficiency and robustness of key recovery. Furthermore, based on information entropy and Jensen's inequality, we rigorously prove that the predictive distribution of the ensemble model more closely approximates the true key distribution, providing theoretical support for multiple models ensemble. Experimental results show that the proposed modular ensemble framework supports flexible combinations of arbitrary leakage models and exhibits excellent generalization capability and stability across different platforms and adversarial environments.
Wubiao Gao, Juesong Cai, Yingjian Yan
IEEE Trans. Dependable Secur. Comput.3
2023 Towards a metrics suite for evaluating cache side-channel vulnerability: Case studies on an open-source RISC-V processor
Yingjian Yan, Jingxin Zhong, Yanjiang Liu, Jinsong Xu
Comput. Secur.2
2023 Extending the classical side-channel analysis framework to access-driven cache attacks
Yingjian Yan, Fan Zhang 0010, Chunsheng Zhu, Zibin Dai
Comput. Secur.2
2023 A High-performance Masking Design Approach for Saber against High-order Side-channel Attack
abstract
Post-quantum cryptography (PQC) has become the most promising cryptographic scheme against the threat of quantum computing to conventional public-key cryptographic schemes. Saber, as the finalist in the third round of the PQC standardization procedure, presents an appealing option for embedded systems due to its high encryption efficiency and accessibility. However, side-channel attack (SCA) can easily reveal confidential information by analyzing the physical manifestations, and several works demonstrate that Saber is vulnerable to SCAs. In this work, a ciphertext comparison method for masking design based on the bitslicing technique and zerotest is proposed, which balances the tradeoff between the performance and security of comparing two arrays. The mathematical description of the proposed ciphertext comparison method is provided, and its correctness and security metrics are analyzed under the concept of PINI. Moreover, a high-order masking approach based on the state of the art, including the hash functions, centered binomial sampling, masking conversions, and proposed ciphertext comparison, is presented, using the bitslicing technique to improve throughput. As a proof of concept, the proposed implementation of Saber is on the ARM Cortex-M4. The performance results show that the runtime overhead factor of 1st-, 2nd-, and 3rd-order masking is 3.01×, 5.58×, and 8.68×, and the dynamic memory used for 1st-, 2nd-, and 3rd-order masking is 17.4kB, 24.0kB, and 30.2kB, respectively. The SCA-resilience evaluation results illustrate that the 1st-order Test Vectors Leakage Assessment (TVLA) result fails to reveal the secret key with 100,000 traces.
Yajing Chang, Yingjian Yan, Chunsheng Zhu, Yanjiang Liu
ACM Trans. Design Autom. Electr. Syst.2