Jian Lin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Jian Lin has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Weiyu Dong
Information Engineering University, Zhengzhou, China
4 shared publications - Rui Chang
Zhejiang University
3 shared publications - Guoan Liu
Information Engineering University, Zhengzhou, China
2 shared publications - Tieming Liu
School of Cyberspace Security, Information Engineering University, Zhengzhou, China
2 shared publications Weiyu Dong
Information Engineering University
2 shared publications- Dingding Wang
Zhejiang University
1 shared publication
Latest Publications
- 7 March 2026
- Published by Elsevier in Computers & Security
- Vol. 166
ROParser: A high-efficient framework for return-oriented programming deobfuscation
- 7 March 2026
- Published by Elsevier in Computers & Security
- Vol. 166
ROParser: A high-efficient framework for return-oriented programming deobfuscation
- 10 July 2025
- Published by Springer Nature
- p. 118-139
SyzForge: An Automated System Call Specification Generation Process for Efficient Kernel Fuzzing
- 10 July 2025
- Published by Springer Nature
- p. 118-139
SyzForge: An Automated System Call Specification Generation Process for Efficient Kernel Fuzzing
- Open Access
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 198-208
Proteus: An Automatical High-Efficiency Framework for Generating Compact and Printable Shellcode on ARMv8
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 198-208
Open AccessProteus: An Automatical High-Efficiency Framework for Generating Compact and Printable Shellcode on ARMv8
- Open Access
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 258-268
Devmp: A Virtual Instruction Extraction Method for Commercial Code Virtualization Obfuscators
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 258-268
Open AccessDevmp: A Virtual Instruction Extraction Method for Commercial Code Virtualization Obfuscators
- Open Access
- 14 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 359-364
Interface Definition Language and Graphical Programming - Based Approach for Quick Shellcode Generation
- 14 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 359-364
Open AccessInterface Definition Language and Graphical Programming - Based Approach for Quick Shellcode Generation
- Open Access
- 14 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 327-333
SyzMutateX: Optimizing Syzkaller Fuzzing with LLM-Driven Mutation and Adaptive Energy Allocation
- 14 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 327-333
Open AccessSyzMutateX: Optimizing Syzkaller Fuzzing with LLM-Driven Mutation and Adaptive Energy Allocation
- 10 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 20 (1) , 343-359
EnBinDiff: Identifying Data-Only Patches for Binaries
In this paper, we focus on data-only patches, a specific type of security patches not incurring any structural changes. As one of the most significant causes leading to false negatives, data-only patches become a fundamental problem that affects all state-of-the-art binary diffing approaches/tools. To this end, we first systematically study data-only patches, and thoroughly illustrate the essence and adverse effect on existing tools. Based on the observations, we further propose and implement a system named EnBinDiff based on Value Set Analysis (VSA) to effectively identify data-only patches. Specifically, EnBinDiff first precisely identifies functions from binaries, and then efficiently locates all "matched" function pairs based on structural binary diffing. After that, EnBinDiff perform data-only patch analysis, including stack frame matching and constant value matching, to identify data-only patches from the matched functions. To demonstrate the effectiveness of EnBinDiff, we conduct an extensive evaluation with multiple datasets. The results demonstrate that the proposed system outperforms state-of-the-art binary diffing tools, and the false negative rate is reduced from 11.02% to 1.63%. Furthermore, we apply EnBinDiff to analyze real-world binaries, and successfully identify 20 1-day vulnerabilities.
- 10 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 20 (1) , 343-359
EnBinDiff: Identifying Data-Only Patches for Binaries
In this paper, we focus on data-only patches, a specific type of security patches not incurring any structural changes. As one of the most significant causes leading to false negatives, data-only patches become a fundamental problem that affects all state-of-the-art binary diffing approaches/tools. To this end, we first systematically study data-only patches, and thoroughly illustrate the essence and adverse effect on existing tools. Based on the observations, we further propose and implement a system named EnBinDiff based on Value Set Analysis (VSA) to effectively identify data-only patches. Specifically, EnBinDiff first precisely identifies functions from binaries, and then efficiently locates all "matched" function pairs based on structural binary diffing. After that, EnBinDiff perform data-only patch analysis, including stack frame matching and constant value matching, to identify data-only patches from the matched functions. To demonstrate the effectiveness of EnBinDiff, we conduct an extensive evaluation with multiple datasets. The results demonstrate that the proposed system outperforms state-of-the-art binary diffing tools, and the false negative rate is reduced from 11.02% to 1.63%. Furthermore, we apply EnBinDiff to analyze real-world binaries, and successfully identify 20 1-day vulnerabilities.
- Open Access
- 20 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 186308-186318
A Dynamic Taint Analysis Framework Based on Entity Equipment
With the development of the Internet of Things, the security of embedded device has received extensive attention. Taint analysis technology can improve the understanding of the firmware program operating mechanism and improve the effectiveness of security analysis. It is an important method in security analysis. Traditional taint analysis of embedded device firmware requires complex pre-preparation work, setting up a virtual operating environment. This work takes up a lot of time and effort from the security analysts, and the results are often not only satisfactory. In this paper, we propose a dynamic taint analysis method based on entity equipment. The core idea of our approach is to divide the taint analysis into two parts: the simulation analysis on the host and the real execution on the entity equipment. Since one of the features of our method is based on entity equipment, there is no need to build a dedicated virtual environment. Another feature is that the tested firmware program runs on entity equipment and can ensure the accuracy of the analysis by comparing the results of the taint analysis with the device firmware run-time information.We implement a prototype system and verified the effectiveness of the method, which can perform taint analysis on multiple architecture embedded firmware programs and detect vulnerabilities such as stack overflow, heap overflow and so on. Finally, we verify our prototype with a test case to effectively detect vulnerabilities in the firmware program. And we evaluate the performance of the prototype, compared with PANDA, the time overhead of our prototype is reduced by 5.9%.
- 20 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 186308-186318
Open AccessA Dynamic Taint Analysis Framework Based on Entity Equipment
With the development of the Internet of Things, the security of embedded device has received extensive attention. Taint analysis technology can improve the understanding of the firmware program operating mechanism and improve the effectiveness of security analysis. It is an important method in security analysis. Traditional taint analysis of embedded device firmware requires complex pre-preparation work, setting up a virtual operating environment. This work takes up a lot of time and effort from the security analysts, and the results are often not only satisfactory. In this paper, we propose a dynamic taint analysis method based on entity equipment. The core idea of our approach is to divide the taint analysis into two parts: the simulation analysis on the host and the real execution on the entity equipment. Since one of the features of our method is based on entity equipment, there is no need to build a dedicated virtual environment. Another feature is that the tested firmware program runs on entity equipment and can ensure the accuracy of the analysis by comparing the results of the taint analysis with the device firmware run-time information.We implement a prototype system and verified the effectiveness of the method, which can perform taint analysis on multiple architecture embedded firmware programs and detect vulnerabilities such as stack overflow, heap overflow and so on. Finally, we verify our prototype with a test case to effectively detect vulnerabilities in the firmware program. And we evaluate the performance of the prototype, compared with PANDA, the time overhead of our prototype is reduced by 5.9%.
- Open Access
- 19 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 114593-114606
A Value Set Analysis Refinement Approach Based on Conditional Merging and Lazy Constraint Solving
Value set analysis is a common static binary program analysis approach. Value set analysis attempts to identify a tight over-approximation of the program state at any given point in the program and can be used to detect vulnerability. Existing memory corruption detection analysis technologies based on value set analysis have a high false positive rate, because value set analysis suffers from a lack of accuracy. We observed that two main sources of imprecision in value set analysis are merge operation and failed branch conditions tracking. In order to address above problems, in this paper, we propose a value set analysis refinement approach based on conditional merging and lazy constraint solving. We propose a variable dependence analysis algorithm to divide program paths into subsets and only merge the states which satisfy the condition that the states are from the same subset, which reduces the imprecision from the merging operation. We collect path predicates as path constraint and solve the path constraint using Satisfiability Modulo Theories (SMT) solver lazily to get a tighter number range of the variable when a variable need be refined, which reduces the imprecision from the failed branch conditions tracking. We implement a prototype system RVSA based on the proposed approach and verify its effectiveness according to experimentation. Compared with state-of-the-art approach, the experimental results demonstrate that the false positive rate is reduced by 12.9%. Furthermore, using our proposed approach, 25 zero-day vulnerabilities are found in the Netgear httpd binary.
- 19 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 114593-114606
Open AccessA Value Set Analysis Refinement Approach Based on Conditional Merging and Lazy Constraint Solving
Value set analysis is a common static binary program analysis approach. Value set analysis attempts to identify a tight over-approximation of the program state at any given point in the program and can be used to detect vulnerability. Existing memory corruption detection analysis technologies based on value set analysis have a high false positive rate, because value set analysis suffers from a lack of accuracy. We observed that two main sources of imprecision in value set analysis are merge operation and failed branch conditions tracking. In order to address above problems, in this paper, we propose a value set analysis refinement approach based on conditional merging and lazy constraint solving. We propose a variable dependence analysis algorithm to divide program paths into subsets and only merge the states which satisfy the condition that the states are from the same subset, which reduces the imprecision from the merging operation. We collect path predicates as path constraint and solve the path constraint using Satisfiability Modulo Theories (SMT) solver lazily to get a tighter number range of the variable when a variable need be refined, which reduces the imprecision from the failed branch conditions tracking. We implement a prototype system RVSA based on the proposed approach and verify its effectiveness according to experimentation. Compared with state-of-the-art approach, the experimental results demonstrate that the false positive rate is reduced by 12.9%. Furthermore, using our proposed approach, 25 zero-day vulnerabilities are found in the Netgear httpd binary.