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

J4 ›› 2012, Vol. 34 ›› Issue (2): 9-12.

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

贺志强，楼芳，李亮

（中国工程物理研究院，四川绵阳 621900）

收稿日期:2010-07-30 修回日期:2010-10-25 出版日期:2012-02-25 发布日期:2012-02-25

Attack Graph Optimization Based on Attack Distance

HE Zhiqiang，LOU Fang，LI Liang

(China Academy of Engineering Physics,Mianyang 621900,China)

Received:2010-07-30 Revised:2010-10-25 Online:2012-02-25 Published:2012-02-25

摘要/Abstract

摘要：

传统网络攻击图的生成随着网络规模扩大存在状态爆炸问题，网络安全管理员往往拿着冗余的攻击图不知所措。为了消除攻击图中不必要的攻击路径，保留下最优的攻击路径以供管理员防御参考，本文利用攻击距离对复杂的攻击图进行了优化。实验结果表明, 利用此方法优化后的攻击图保留了最有可能的攻击路径，降低了攻击图的规模，随着网络规模的扩大，效果也越来越明显。

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

Abstract:

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.

Key words: network attack;network security;attack distance;attack graph

贺志强，楼芳，李亮. 基于攻击距离的攻击图优化方法[J]. J4, 2012, 34(2): 9-12.

HE Zhiqiang，LOU Fang，LI Liang. Attack Graph Optimization Based on Attack Distance[J]. J4, 2012, 34(2): 9-12.