吉林大学学报(理学版) ›› 2019, Vol. 57 ›› Issue (04): 917-926.

• 计算机科学 • 上一篇    下一篇

基于OptimizedAG的节点攻击路径预测方法

王辉, 戴田旺, 茹鑫鑫, 娄亚龙, 敖山   

  1. 河南理工大学 计算机科学与技术学院, 河南 焦作 454000
  • 收稿日期:2018-10-31 出版日期:2019-07-26 发布日期:2019-07-11
  • 通讯作者: 敖山 E-mail:15639708820@163.com

Prediction Method of Node Attack Path Based on OptimizedAG

WANG Hui, DAI Tianwang, RU Xinxin, LOU Yalong, AO Shan   

  1. College of Computer Science & Technology, Henan Polytechnic University, Jiaozuo 454000, Henan Province, China
  • Received:2018-10-31 Online:2019-07-26 Published:2019-07-11
  • Contact: AO Shan E-mail:15639708820@163.com

摘要: 针对传统攻击图中因对节点分析考虑不全面而导致的攻击路径预测不准确问题, 提出一种基于攻击图攻击行为分析的攻击路径预测方法. 先通过节点攻击距离权重对传统的攻击图进行优化, 决策出可能的攻击路径, 并计算其路径的节点攻击行为成本, 然后基于估计函数判断出优先考虑的攻击路径. 实验结果表明, 该方法有效消除了攻击图路径冗余, 能筛选出可靠的攻击路径, 提高了攻击图攻击路径预测的准确性.

关键词: 攻击图, 路径冗余, 攻击距离权重, 攻击行为成本

Abstract: Aiming at the problem of inaccuracy of attack path prediction caused by incomplete node analysis in traditional attack graph, we proposed a prediction method of attack path based on attack graph attack behavior analysis. First, the traditional attack graph was optimized by the node attack distance weight, the possible attack path was decided, and the node attack behavior cost of the path was calculated. Then, the priority attack path was determined based on the estimation function. The experimental results show that the method can effectively eliminate the path redundancy of the attack graph and filter out reliable attack path, which improves the accuracy of the attack graph attack path prediction.

Key words: attack graph, path redundancy, attack distance weight, attack behavior cost

中图分类号: 

  • TP393