Jingju Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jingju Liu has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Shicheng Zhou
College of Electronic Engineering, National University of Defense Technology, Hefei, China
4 shared publications - Dongdong Hou
College of Electronic Engineering, National University of Defense Technology, Hefei 230037, China
3 shared publications - Peng Wang
National University of Defense Technology
3 shared publications - Xiaofeng Zhong
College of Electronic Engineering, National University of Defense Technology, Hefei 230037, China
3 shared publications - Yue Zhang
College of Computer Science and Technology, National University of Defense Technology, Changsha, China
2 shared publications - Canju Lu
College of Electronic Engineering, National University of Defense Technology, Hefei 230037, China
1 shared publication
Latest Publications
- 9 August 2023
- Published by Springer Nature
- p. 83-98
A Cybersecurity Knowledge Graph Completion Method for Scalable Scenarios
- 9 August 2023
- Published by Springer Nature
- p. 83-98
A Cybersecurity Knowledge Graph Completion Method for Scalable Scenarios
- Open Access
- 12 April 2023
- Published by MDPI AG in Electronics
- Vol. 12 (8) , 1837
A Cybersecurity Knowledge Graph Completion Method for Penetration Testing
Penetration testing is an effective method of making computers secure. When conducting penetration testing, it is necessary to fully understand the various elements in the cyberspace. Prediction of future cyberspace state through perception and understanding of cyberspace can assist defenders in decision-making and action execution. Accurate cyberspace detection information is the key to ensuring successful penetration testing. However, cyberspace situation awareness still faces the following challenges. Due to the limited detection capability, the information obtained from cyberspace detection intelligence is incomplete. There are some errors in the cyberspace detection intelligence, which may mislead the penetration testing workers. The knowledge graph can store and manage the cybersecurity data. In order to ensure the integrity and accuracy of cyberspace information, we design a knowledge graph completion model called CSNT to complete cybersecurity data. CSNT uses the BiLSTM to capture the interaction information between entities and relationships. It models the relationship between entities by combining the neural network and tensor decomposition. The Pearson Mix Net is designed to control the generation of joint vectors. We also design a novel self-distillation strategy to reduce catastrophic forgetting during model training. After learning the relationship pattern between entities in the cyberspace detection intelligence, the model can be used to mine the knowledge not found in the cybersecurity detection intelligence and correct the erroneous records. Experiments show that our method has certain advantages for the knowledge graph completion.
- 12 April 2023
- Published by MDPI AG in Electronics
- Vol. 12 (8) , 1837
Open AccessA Cybersecurity Knowledge Graph Completion Method for Penetration Testing
Penetration testing is an effective method of making computers secure. When conducting penetration testing, it is necessary to fully understand the various elements in the cyberspace. Prediction of future cyberspace state through perception and understanding of cyberspace can assist defenders in decision-making and action execution. Accurate cyberspace detection information is the key to ensuring successful penetration testing. However, cyberspace situation awareness still faces the following challenges. Due to the limited detection capability, the information obtained from cyberspace detection intelligence is incomplete. There are some errors in the cyberspace detection intelligence, which may mislead the penetration testing workers. The knowledge graph can store and manage the cybersecurity data. In order to ensure the integrity and accuracy of cyberspace information, we design a knowledge graph completion model called CSNT to complete cybersecurity data. CSNT uses the BiLSTM to capture the interaction information between entities and relationships. It models the relationship between entities by combining the neural network and tensor decomposition. The Pearson Mix Net is designed to control the generation of joint vectors. We also design a novel self-distillation strategy to reduce catastrophic forgetting during model training. After learning the relationship pattern between entities in the cyberspace detection intelligence, the model can be used to mine the knowledge not found in the cybersecurity detection intelligence and correct the erroneous records. Experiments show that our method has certain advantages for the knowledge graph completion.
- Open Access
- 16 December 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (24) , 12947
A Cybersecurity Knowledge Graph Completion Method Based on Ensemble Learning and Adversarial Training
The application of cybersecurity knowledge graphs is attracting increasing attention. However, many cybersecurity knowledge graphs are incomplete due to the sparsity of cybersecurity knowledge. Existing knowledge graph completion methods do not perform well in domain knowledge, and they are not robust enough relative to noise data. To address these challenges, in this paper we develop a new knowledge graph completion method called CSEA based on ensemble learning and adversarial training. Specifically, we integrate a variety of projection and rotation operations to model the relationships between entities, and use angular information to distinguish entities. A cooperative adversarial training method is designed to enhance the generalization and robustness of the model. We combine the method of generating perturbations for the embedding layers with the self-adversarial training method. The UCB (upper confidence bound) multi-armed bandit method is used to select the perturbations of the embedding layer. This achieves a balance between perturbation diversity and maximum loss. To this end, we build a cybersecurity knowledge graph based on the CVE, CWE, and CAPEC cybersecurity databases. Our experimental results demonstrate the superiority of our proposed model for completing cybersecurity knowledge graphs.
- 16 December 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (24) , 12947
Open AccessA Cybersecurity Knowledge Graph Completion Method Based on Ensemble Learning and Adversarial Training
The application of cybersecurity knowledge graphs is attracting increasing attention. However, many cybersecurity knowledge graphs are incomplete due to the sparsity of cybersecurity knowledge. Existing knowledge graph completion methods do not perform well in domain knowledge, and they are not robust enough relative to noise data. To address these challenges, in this paper we develop a new knowledge graph completion method called CSEA based on ensemble learning and adversarial training. Specifically, we integrate a variety of projection and rotation operations to model the relationships between entities, and use angular information to distinguish entities. A cooperative adversarial training method is designed to enhance the generalization and robustness of the model. We combine the method of generating perturbations for the embedding layers with the self-adversarial training method. The UCB (upper confidence bound) multi-armed bandit method is used to select the perturbations of the embedding layer. This achieves a balance between perturbation diversity and maximum loss. To this end, we build a cybersecurity knowledge graph based on the CVE, CWE, and CAPEC cybersecurity databases. Our experimental results demonstrate the superiority of our proposed model for completing cybersecurity knowledge graphs.
- Open Access
- 14 October 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (20) , 10339
Improved Deep Recurrent Q-Network of POMDPs for Automated Penetration Testing
With the development of technology, people’s daily lives are closely related to networks. The importance of cybersecurity protection draws global attention. Automated penetration testing is the novel method to protect the security of networks, which enhances efficiency and reduces costs compared with traditional manual penetration testing. Previous studies have provided many ways to obtain a better policy for penetration testing paths, but many studies are based on ideal penetration testing scenarios. In order to find potential vulnerabilities from the perspective of hackers in the real world, this paper models the process of black-box penetration testing as a Partially Observed Markov Decision Process (POMDP). In addition, we propose a new algorithm named , which is applied to the automated black-box penetration testing. In the POMDP model, an agent interacts with a network environment to choose a better policy without insider information about the target network, except for the start points. To handle this problem, we utilize a Long Short-Term Memory (LSTM) structure empowering agent to make decisions based on historical memory. In addition, this paper enhances the current algorithm using the structure of the neural network, the calculation method of the Q-value, and adding noise parameters to the neural network to advance the generalization and efficiency of this algorithm. In the last section, we conduct comparison experiments of the algorithm and other recent state-of-the-art (SOTA) algorithms. The experimental results vividly show that this novel algorithm is able to find a greater attack-path strategy for all vulnerable hosts in the automated black-box penetration testing. Additionally, the generalization and robustness of this algorithm are far superior to other SOTA algorithms in different size simulation scenarios based on the CyberBattleSim simulation developed by Microsoft.- 14 October 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (20) , 10339
Open AccessImproved Deep Recurrent Q-Network of POMDPs for Automated Penetration Testing
With the development of technology, people’s daily lives are closely related to networks. The importance of cybersecurity protection draws global attention. Automated penetration testing is the novel method to protect the security of networks, which enhances efficiency and reduces costs compared with traditional manual penetration testing. Previous studies have provided many ways to obtain a better policy for penetration testing paths, but many studies are based on ideal penetration testing scenarios. In order to find potential vulnerabilities from the perspective of hackers in the real world, this paper models the process of black-box penetration testing as a Partially Observed Markov Decision Process (POMDP). In addition, we propose a new algorithm named , which is applied to the automated black-box penetration testing. In the POMDP model, an agent interacts with a network environment to choose a better policy without insider information about the target network, except for the start points. To handle this problem, we utilize a Long Short-Term Memory (LSTM) structure empowering agent to make decisions based on historical memory. In addition, this paper enhances the current algorithm using the structure of the neural network, the calculation method of the Q-value, and adding noise parameters to the neural network to advance the generalization and efficiency of this algorithm. In the last section, we conduct comparison experiments of the algorithm and other recent state-of-the-art (SOTA) algorithms. The experimental results vividly show that this novel algorithm is able to find a greater attack-path strategy for all vulnerable hosts in the automated black-box penetration testing. Additionally, the generalization and robustness of this algorithm are far superior to other SOTA algorithms in different size simulation scenarios based on the CyberBattleSim simulation developed by Microsoft. - Open Access
High-Speed Path Probing Method for Large-Scale Network
In large-scale network topology discovery, due to the complex network structure and dynamic change characteristics, it is always the focus of network topology measurement to obtain as many network paths as possible in a short time. In this paper, we propose a large-scale network path probing approach in order to solve the problems of low probing efficiency and high probing redundancy commonly found in current research. By improving the packet delivery order and the update strategy of time-to-live field values, we redesigned and implemented an efficient large-scale network path probing tool. The experimental results show that the method-derived tool can complete path probing for a sample of 12 million/24 network address segments worldwide within 1 hour, which greatly improves the efficiency of network path probing. Meanwhile, compared to existing methods, the proposed method can reduce the number of packets sent by about 10% with the same number of network addresses found, which effectively reduces probing redundancy and alleviates the network load.
Open AccessHigh-Speed Path Probing Method for Large-Scale Network
In large-scale network topology discovery, due to the complex network structure and dynamic change characteristics, it is always the focus of network topology measurement to obtain as many network paths as possible in a short time. In this paper, we propose a large-scale network path probing approach in order to solve the problems of low probing efficiency and high probing redundancy commonly found in current research. By improving the packet delivery order and the update strategy of time-to-live field values, we redesigned and implemented an efficient large-scale network path probing tool. The experimental results show that the method-derived tool can complete path probing for a sample of 12 million/24 network address segments worldwide within 1 hour, which greatly improves the efficiency of network path probing. Meanwhile, compared to existing methods, the proposed method can reduce the number of packets sent by about 10% with the same number of network addresses found, which effectively reduces probing redundancy and alleviates the network load.
- Open Access
- 23 September 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (19) , 8823
Autonomous Penetration Testing Based on Improved Deep Q-Network
Penetration testing is an effective way to test and evaluate cybersecurity by simulating a cyberattack. However, the traditional methods deeply rely on domain expert knowledge, which requires prohibitive labor and time costs. Autonomous penetration testing is a more efficient and intelligent way to solve this problem. In this paper, we model penetration testing as a Markov decision process problem and use reinforcement learning technology for autonomous penetration testing in large scale networks. We propose an improved deep Q-network (DQN) named NDSPI-DQN to address the sparse reward problem and large action space problem in large-scale scenarios. First, we reasonably integrate five extensions to DQN, including noisy nets, soft Q-learning, dueling architectures, prioritized experience replay, and intrinsic curiosity model to improve the exploration efficiency. Second, we decouple the action and split the estimators of the neural network to calculate two elements of action separately, so as to decrease the action space. Finally, the performance of algorithms is investigated in a range of scenarios. The experiment results demonstrate that our methods have better convergence and scaling performance.
- 23 September 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (19) , 8823
Open AccessAutonomous Penetration Testing Based on Improved Deep Q-Network
Penetration testing is an effective way to test and evaluate cybersecurity by simulating a cyberattack. However, the traditional methods deeply rely on domain expert knowledge, which requires prohibitive labor and time costs. Autonomous penetration testing is a more efficient and intelligent way to solve this problem. In this paper, we model penetration testing as a Markov decision process problem and use reinforcement learning technology for autonomous penetration testing in large scale networks. We propose an improved deep Q-network (DQN) named NDSPI-DQN to address the sparse reward problem and large action space problem in large-scale scenarios. First, we reasonably integrate five extensions to DQN, including noisy nets, soft Q-learning, dueling architectures, prioritized experience replay, and intrinsic curiosity model to improve the exploration efficiency. Second, we decouple the action and split the estimators of the neural network to calculate two elements of action separately, so as to decrease the action space. Finally, the performance of algorithms is investigated in a range of scenarios. The experiment results demonstrate that our methods have better convergence and scaling performance.
- Open Access
- 1 March 2020
- Published by IOP Publishing in IOP Conference Series: Materials Science and Engineering
- Vol. 768 (5)
Review on the Application of Knowledge Graph in Cyber Security Assessment
The development of artificial intelligence technology has advanced by leaps and bounds and made significant progress in many areas. Many researchers have begun to apply artificial intelligence technology to the cyber security domain. Knowledge graphs can describe the concepts, entities and their relationships in the objective world in a structured way. Applying knowledge graph to the cyber security domain can organize, manage, and utilize massive amounts of information in cyberspace in a better way. In this paper, the common cyber security assessment models and their shortcomings is summarized, the research progress of ontology-based knowledge representation is discussed, thus leading to a conclusion that ontology-based knowledge representation can completely and accurately represent the complex knowledge of heterogeneous systems in the cyber security domain. Then we introduce the concept of knowledge graph, summarize the application progress of knowledge graphs in the cyber security domain, and discuss directions of future research.
- 1 March 2020
- Published by IOP Publishing in IOP Conference Series: Materials Science and Engineering
- Vol. 768 (5)
Open AccessReview on the Application of Knowledge Graph in Cyber Security Assessment
The development of artificial intelligence technology has advanced by leaps and bounds and made significant progress in many areas. Many researchers have begun to apply artificial intelligence technology to the cyber security domain. Knowledge graphs can describe the concepts, entities and their relationships in the objective world in a structured way. Applying knowledge graph to the cyber security domain can organize, manage, and utilize massive amounts of information in cyberspace in a better way. In this paper, the common cyber security assessment models and their shortcomings is summarized, the research progress of ontology-based knowledge representation is discussed, thus leading to a conclusion that ontology-based knowledge representation can completely and accurately represent the complex knowledge of heterogeneous systems in the cyber security domain. Then we introduce the concept of knowledge graph, summarize the application progress of knowledge graphs in the cyber security domain, and discuss directions of future research.