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 条
  • [11] Ji GL, 2015, PROCEEDINGS OF THE 53RD ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS AND THE 7TH INTERNATIONAL JOINT CONFERENCE ON NATURAL LANGUAGE PROCESSING, VOL 1, P687
  • [12] Self-Knowledge Distillation with Progressive Refinement of Targets
    Kim, Kyungyul
    Ji, ByeongMoon
    Yoon, Doyoung
    Hwang, Sangheum
    [J]. 2021 IEEE/CVF INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV 2021), 2021, : 6547 - 6556
  • [13] MEduKG: A Deep-Learning-Based Approach for Multi-Modal Educational Knowledge Graph Construction
    Li, Nan
    Shen, Qiang
    Song, Rui
    Chi, Yang
    Xu, Hao
    [J]. INFORMATION, 2022, 13 (02)
  • [14] Li Z, 2022, Arxiv, DOI arXiv:2211.16231
  • [15] Lin YK, 2015, AAAI CONF ARTIF INTE, P2181
  • [16] Nickel M., 2011, P INT C MACH LEARN, P809
  • [17] Rashid T, 2018, PR MACH LEARN RES, V80
  • [18] Controllable Music Playlist Generation Based on Knowledge Graph and Reinforcement Learning
    Sakurai, Keigo
    Togo, Ren
    Ogawa, Takahiro
    Haseyama, Miki
    [J]. SENSORS, 2022, 22 (10)
  • [19] Self-Distillation from the Last Mini-Batch for Consistency Regularization
    Shen, Yiqing
    Xu, Liwu
    Yang, Yuzhe
    Li, Yaqian
    Guo, Yandong
    [J]. 2022 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2022, : 11933 - 11942
  • [20] Sun Z., 2018, 7 INT C LEARNING REP, DOI DOI 10.48550/ARXIV.1902.10197