A Cybersecurity Knowledge Graph Completion Method for Penetration Testing

被引:3
作者
Wang, Peng [1 ,2 ]
Liu, Jingju [1 ,2 ]
Zhong, Xiaofeng [1 ,2 ]
Zhou, Shicheng [1 ,2 ]
机构
[1] Natl Univ Def Technol, Coll Elect Engn, Hefei 230037, Peoples R China
[2] Anhui Prov Key Lab Cyberspace Secur Situat Awarene, Hefei 230037, Peoples R China
关键词
penetration testing; cyberspace situation awareness; cybersecurity; knowledge graph completion;
D O I
10.3390/electronics12081837
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页数:14
相关论文
共 29 条
  • [1] Balazevic I, 2019, 2019 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING AND THE 9TH INTERNATIONAL JOINT CONFERENCE ON NATURAL LANGUAGE PROCESSING (EMNLP-IJCNLP 2019), P5185
  • [2] Balazevic I, 2019, ADV NEUR IN, V32
  • [3] Bordes Antoine, 2013, ADV NEURAL INFORM PR, P787
  • [4] Che F., 2020, P AAAI C ART INT NEW
  • [5] Knowledge Graph Based Hard Drive Failure Prediction
    Chhetri, Tek Raj
    Kurteva, Anelia
    Adigun, Jubril Gbolahan
    Fensel, Anna
    [J]. SENSORS, 2022, 22 (03)
  • [6] Dettmers T, 2018, AAAI CONF ARTIF INTE, P1811
  • [7] TOWARD A THEORY OF SITUATION AWARENESS IN DYNAMIC-SYSTEMS
    ENDSLEY, MR
    [J]. HUMAN FACTORS, 1995, 37 (01) : 32 - 64
  • [8] A medical question answering system using large language models and knowledge graphs
    Guo, Quan
    Cao, Shuai
    Yi, Zhang
    [J]. INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, 2022, 37 (11) : 8548 - 8564
  • [9] Hinton G., 2015, ARXIV
  • [10] Hochreiter S, 1997, NEURAL COMPUT, V9, P1735, DOI [10.1162/neco.1997.9.1.1, 10.1007/978-3-642-24797-2]