基于转换的攻击图分析方法研究  

Study on Analysis of Attack Graphs Based on Conversion

作　　者：闫峰[1,2] 刘淑芬[1] 冷煌 

机构地区：[1]吉林大学计算机科学与技术学院,吉林长春130012 [2]吉林省福利彩票发行管理中心,吉林长春130061

出　　处：《电子学报》2014年第12期2477-2480,共4页Acta Electronica Sinica

基　　金：国家863高技术研究发展计划重点项目(No.2009AA010314863);国家自然科学基金(No.60973041)

摘　　要：攻击图是一种分析计算机网络脆弱性的有效工具,它以图的方式描述了攻击者利用系统漏洞和单元间脆弱性信息综合入侵目标网络的行为过程.针对攻击图的最优弥补集问题,文章论证了最优弥补集问题与加权碰集问题之间的等价性,并提供了相应的形式化转换方法.在不增大问题规模的前提下,本文将最优弥补集问题形式化地转换为单一的加权碰集问题以进行求解.理论和实验均表明,在收敛于全局最优解方面,基于转换的分析方法较传统方法有更好的性能.Attack graph analysis is an effective tool for analyzing network vulnerability,representing the process that attack-ers penetrate networks using the complex interdependence between vulnerabilities and network configurations .In this paper,we prove the equivalence of the optimization security measure problem and the weighted hitting set problem,and present the method which converts the optimization security measure problem to the weighted hitting set problem on the premise of not increasing the problem scale .Theoretical analysis and experiments show that the method based on conversion has better performance than the method based on critical attack sets in converging to the global optimal solution .

关 键 词：攻击图 最优弥补集 转换 全局最优解 

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