• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2011, Vol. 33 ›› Issue (7): 18-24.

• 论文 • 上一篇    下一篇

基于攻击模式的反向搜索攻击图生成算法

赵豹1,张怡2,孟源1   

  1. (1.95972部队,甘肃 九泉 735018;2.国防科学技术大学计算机学院,湖南 长沙 410073)
  • 收稿日期:2009-05-22 修回日期:2009-09-14 出版日期:2011-07-21 发布日期:2011-07-25
  • 作者简介:赵豹(1984),男,河北涿州人,硕士,助理工程师,研究方向为信息安全。张怡(1973),女,四川成都人,博士,副研究员,研究方向为信息安全。孟源(1972),男,陕西兴平人,工程师,研究方向为信息安全。
  • 基金资助:

    国家863计划资助项目(2009AA01Z432)

A Backward Search Approach to Attack Graph Generation Based on Attack Patterns

ZHAO Bao1,ZHANG Yi2,MENG Yuan1   

  1. (1.Corps 95972,Jiuquan 735018;
    2.School of Computer Science,National University of Defense Technology,Changsha 410073,China)
  • Received:2009-05-22 Revised:2009-09-14 Online:2011-07-21 Published:2011-07-25

摘要:

在使用攻击图方法分析网络中脆弱性之间关系时,网络规模一直是制约攻击图生成算法效率的根本因素。本文提出了一个基于攻击模式的高效攻击图反向生成算法。首先,对已有网络模型做出改进,提出了新型的基于网络中关键属性的模型,该模型使用子网掩码压缩网络连接关系,达到缩小网络规模的目的。其次,使用网络模型中的关键属性对脆弱性进行描述,进而抽象出攻击模式,使攻击图生成算法建立在有限的攻击模式上,提高了算法效率。再次,提出了基于攻击模式的属性攻击图自动生成算法,该算法根据攻击目标反向推导出攻击路径。此外,算法在生成属性攻击图时,能够识别攻击路径中的“圈”,只保留有意义的“圈”,且不进入“圈”的循环之中。最后,通过实验和分析表明,算法生成的属性攻击图相比正向算法生成的攻击图在节点数量上要少,不存在与达到攻击目标无关的节点。算法具有较好的时间复杂度O(|H|2)~O(|H|3),相比同类算法具有较高的效率,可以应用于大规模网络。

关键词: 脆弱性, 属性攻击图, 攻击模式

Abstract:

Automated generation of attack graphs always encounters efficiency problem when using attack graphs to analyse the vulnerabilities of large networks. This paper proposes a backward approach to attack graphs generation based on attack patterns with great efficiency. Firstly, we propose a novel model of network based on the key attributes of networks, which is improved upon the  previous models. This model optimizes the network connections and downsizes the network. Secondly, after abstracting a large number of vulnerabilities, we sum up a few attack patterns, based on which we build an efficiency approach to attribute attack graphs generation. Thirdly, the backward approach we propose solves the problem of loop attack paths. Finally, the experimental result shows that, our backward approach generates partial attack graphs which illustrate the potential interrelations among the known vulnerabilities just related to the given attack goal in the targeted network, while other forward approaches generate full attack graphs. And we show the experimental evidence that our attribute attack graph generation algorithm is very efficient, the complexity of the algorithm is between O(|H|2) and O(|H|3).

Key words: vulnerability;attribute attack graph;attack pattern