基于攻击距离的攻击图优化方法  

Attack Graph Optimization Based on Attack Distance

作　　者：贺志强[1] 楼芳[1] 李亮[1] 

机构地区：[1]中国工程物理研究院,四川绵阳621900

出　　处：《计算机工程与科学》2012年第2期9-12,共4页Computer Engineering & Science

基　　金：中国工程物理研究院科学技术发展基金(2007A12001)

摘　　要：传统网络攻击图的生成随着网络规模扩大存在状态爆炸问题,网络安全管理员往往拿着冗余的攻击图不知所措。为了消除攻击图中不必要的攻击路径,保留下最优的攻击路径以供管理员防御参考,本文利用攻击距离对复杂的攻击图进行了优化。实验结果表明,利用此方法优化后的攻击图保留了最有可能的攻击路径,降低了攻击图的规模,随着网络规模的扩大,效果也越来越明显。Traditional attack graph generation methods have the problem of state explosion with the network scale expansion.Network security administrators are often overwhelmed by holding redundant attack graphs.The complex attack graph is optimized by using attack distance,which can eliminate unnecessary attack paths and choose the optimal attack paths.The administrators can refer to the optimized attack graph and get the defense information.The experimental results show that it retains the most likely attack path and simplifies the attack graph.With the expansion of network scale,the effect has become increasingly evident.

关 键 词：网络攻击 网络安全 攻击距离 攻击图 

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