基于攻击图的空间复杂性优化算法研究  

Spatial Complexity Optimization Algorithm based on Attack Graph

作　　者：蔡勇平 朱士瑞[2] 许晓东[2] CAI Yong-ping;ZHU Shi-rui;XU Xiao-dong(School of Computer Science&Communication Engineering,Jiangsu University,Zhenjiang Jiangsu 212013,China;Information Center of Jiangsu University,Jiangsu University,Zhenjiang Jiangsu 212013,China)

机构地区：[1]江苏大学计算机科学与通信工程学院,江苏镇江212013 [2]江苏大学信息化中心,江苏镇江212013

出　　处：《通信技术》2018年第7期1671-1677,共7页Communications Technology

摘　　要：攻击图模型是网络脆弱性评估的重要手段。但是,通常生成的攻击图过于庞大和复杂,无法准确找到关键漏洞。针对此问题,提出了一种攻击图空间复杂性优化算法。该算法结合攻击路径和漏洞结点的个数,删除现实意义不大的攻击路径,只保留攻击者、含有漏洞以及攻击目标的结点的攻击路径,简化攻击图,增加了攻击图的可用性。此外,通过一定规模的网络环境实验验证表明,经该算法优化后得到的简化图可用性更高。The attack graph model is an important means for network vulnerability assessment.However,the usually-generated attack graph is too large and complex to accurately identify critical vulnerabilities.Aiming at this problem,an attack-graph space-complexity optimization algorithm is proposed.This algorithm,by combining the number of attack paths and vulnerability nodes,deletes the attack path with little meaning in reality,only preserves the attack paths of the attacker,the vulnerability-involved and the attack target-involved node simplifies the attack graph and improves the usability of the attack graph.Experiment in a network environment of certain scale indicates that the simplified graph acquired via algorithm optimization has even higher usability.

关 键 词：网络安全 攻击路径 脆弱性评估 攻击图 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]