Liang He
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Liang He has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Yan Cai
Key Laboratory of System Software (Chinese Academy of Sciences) and State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China
3 shared publications - Purui Su
Institute of Software, Chinese Academy of Sciences, Beijing, Beijing, China
2 shared publications - Bin Zhang
College of Electronic Science and Technology, National University of Defense Technology, Changsha, China
1 shared publication - Chao Feng
College of Electronic Science and Technology, National University of Defense Technology, Changsha, China
1 shared publication - Chao Zhang
Tsinghua University, Beijing, China and Zhongguancun Laboratory, Beijing, China
1 shared publication - Chaojing Tang
College of Electronic Science and Technology, National University of Defense Technology, Changsha, China
1 shared publication
Latest Publications
- Open Access
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 705-719
OSmart: Whitebox Program Option Fuzzing
Program options are ubiquitous and serve as a fundamental mechanism for configuring and customizing software behaviors. Given their widespread use, testing program options becomes essential to ensure that the software behaves as expected across various configurations. Existing option-aware fuzzers either mutate options as if they were standard program inputs or employ NLP techniques to deduce relationships among options from the documentation. However, there has not been a whitebox approach that generates option combinations by capturing the inherent execution logic of the program. This paper presents Osmart, a whitebox approach designed to systematically extract program options and effective option combinations that precisely encapsulate the intrinsic execution logic of the program, incorporating both data dependency and control dependency.OSmart successfully inferred 12,560 option combinations from 56 programs. Additionally, OSmart uncovered that more than 67% of evaluated programs have undocumented options. By integrated with AFL++, OSmart discovered 40.3% more paths, which led to the detection of 51 new bugs and the assignment of 18 CVE IDs. Finally, we also compared OSmart with four state-of-the-art option-aware fuzzers on a public benchmark and our tool achieved higher line coverage in 66.7% (20/30) of the evaluated programs.
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 705-719
Open AccessOSmart: Whitebox Program Option Fuzzing
Program options are ubiquitous and serve as a fundamental mechanism for configuring and customizing software behaviors. Given their widespread use, testing program options becomes essential to ensure that the software behaves as expected across various configurations. Existing option-aware fuzzers either mutate options as if they were standard program inputs or employ NLP techniques to deduce relationships among options from the documentation. However, there has not been a whitebox approach that generates option combinations by capturing the inherent execution logic of the program. This paper presents Osmart, a whitebox approach designed to systematically extract program options and effective option combinations that precisely encapsulate the intrinsic execution logic of the program, incorporating both data dependency and control dependency.OSmart successfully inferred 12,560 option combinations from 56 programs. Additionally, OSmart uncovered that more than 67% of evaluated programs have undocumented options. By integrated with AFL++, OSmart discovered 40.3% more paths, which led to the detection of 51 new bugs and the assignment of 18 CVE IDs. Finally, we also compared OSmart with four state-of-the-art option-aware fuzzers on a public benchmark and our tool achieved higher line coverage in 66.7% (20/30) of the evaluated programs.
- 12 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (12) , 19167-19176
Novel and Efficient Rainbow Signature Scheme Based on Circulant and Toeplitz Matrices for Intelligent IoT
Quantum computing increases the security risks of data in intelligent Internet of Things (IoT) based on traditional cryptography. Multivariate public key cryptography has the security advantage of resisting quantum computing and Rainbow is an important research focus in it. However, the Rainbow algorithm’s secret keys are too large to suitable for resource-constrained IoT system. We propose an efficient Rainbow signature scheme based on circulant and Toeplitz matrices for intelligent IoT. In our scheme, the variable matrices of polynomials have special forms constructed from circulant and Toeplitz matrices. Every variable matrix of central maps and public key polynomials is divided into four submatrices. Three submatrices of variable matrices are generated using seeds randomly chosen. The fourth submatrix is generated by an affine map and three submatrices. Therefore, the public key consists of seeds and variables in the fourth submatrices, rather than all variables of polynomials. Then, the correctness of our scheme has been proved and we provide a security analysis. More specifically, it is proved that the scheme can resist five attacks against Rainbow, such as Direct attacks, Unbalanced oil vinegar attacks, MinRank attacks, HighRank attacks, and Rainbow-band-separation attacks. At last, according to the experimental results, our system’s public key sizes are 97.96% smaller and private key size are 92.12% than the key sizes of the standard Rainbow scheme. Additionally, compare with other Rainbow-like schemes, the comparison analysis and experimental results show that our scheme has less communication costs and small key size than those in the similar literatures for IoT.
- 12 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (12) , 19167-19176
Novel and Efficient Rainbow Signature Scheme Based on Circulant and Toeplitz Matrices for Intelligent IoT
Quantum computing increases the security risks of data in intelligent Internet of Things (IoT) based on traditional cryptography. Multivariate public key cryptography has the security advantage of resisting quantum computing and Rainbow is an important research focus in it. However, the Rainbow algorithm’s secret keys are too large to suitable for resource-constrained IoT system. We propose an efficient Rainbow signature scheme based on circulant and Toeplitz matrices for intelligent IoT. In our scheme, the variable matrices of polynomials have special forms constructed from circulant and Toeplitz matrices. Every variable matrix of central maps and public key polynomials is divided into four submatrices. Three submatrices of variable matrices are generated using seeds randomly chosen. The fourth submatrix is generated by an affine map and three submatrices. Therefore, the public key consists of seeds and variables in the fourth submatrices, rather than all variables of polynomials. Then, the correctness of our scheme has been proved and we provide a security analysis. More specifically, it is proved that the scheme can resist five attacks against Rainbow, such as Direct attacks, Unbalanced oil vinegar attacks, MinRank attacks, HighRank attacks, and Rainbow-band-separation attacks. At last, according to the experimental results, our system’s public key sizes are 97.96% smaller and private key size are 92.12% than the key sizes of the standard Rainbow scheme. Additionally, compare with other Rainbow-like schemes, the comparison analysis and experimental results show that our scheme has less communication costs and small key size than those in the similar literatures for IoT.
- Open Access
- 6 February 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-13
Reorder Pointer Flow in Sound Concurrency Bug Prediction
Due to the non-determinism of thread interleaving, predicting concurrency bugs has long been an extremely difficult task. Recently, several sound bug-detecting approaches were proposed. These approaches are based on local search, i.e., mutating the sequential order of the observed trace and predicting whether the mutated sequential order can trigger a bug. Surprisingly, during this process, they never consider reordering the data flow of the pointers, which can be the key point to detecting many complex bugs. To alleviate this weakness, we propose a new flow-sensitive point-to analysis technique ConPTA to help actively reorder the pointer flow during the sequential order mutation process. Based on ConPTA, we further propose a new sound predictive bug-detecting approach Eagle to predict four types of concurrency bugs. They are null pointer dereference (NPD), uninitialized pointer use (UPU), use after free (UAF), and double free (DF). By actively reordering the pointer flow, Eagle can explore a larger search space of the thread interleaving during the mutation and thus detect more concurrency bugs. Our evaluation of Eagle on 10 real-world multi-threaded programs shows that Eagle significantly outperforms four state-of-the-art bug-detecting approaches UFO, ConVul, ConVulPOE and Period in both effectiveness and efficiency.
- 6 February 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-13
Open AccessReorder Pointer Flow in Sound Concurrency Bug Prediction
Due to the non-determinism of thread interleaving, predicting concurrency bugs has long been an extremely difficult task. Recently, several sound bug-detecting approaches were proposed. These approaches are based on local search, i.e., mutating the sequential order of the observed trace and predicting whether the mutated sequential order can trigger a bug. Surprisingly, during this process, they never consider reordering the data flow of the pointers, which can be the key point to detecting many complex bugs. To alleviate this weakness, we propose a new flow-sensitive point-to analysis technique ConPTA to help actively reorder the pointer flow during the sequential order mutation process. Based on ConPTA, we further propose a new sound predictive bug-detecting approach Eagle to predict four types of concurrency bugs. They are null pointer dereference (NPD), uninitialized pointer use (UPU), use after free (UAF), and double free (DF). By actively reordering the pointer flow, Eagle can explore a larger search space of the thread interleaving during the mutation and thus detect more concurrency bugs. Our evaluation of Eagle on 10 real-world multi-threaded programs shows that Eagle significantly outperforms four state-of-the-art bug-detecting approaches UFO, ConVul, ConVulPOE and Period in both effectiveness and efficiency.
- Open Access
- 23 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 52-65
One Simple API Can Cause Hundreds of Bugs An Analysis of Refcounting Bugs in All Modern Linux Kernels
- 23 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 52-65
Open AccessOne Simple API Can Cause Hundreds of Bugs An Analysis of Refcounting Bugs in All Modern Linux Kernels