基于攻击图及蚁群算法的安全评估  

Security Evaluation Based On Attack Graph and Ant Algorithm

作　　者：金晶[1] 孙东来[1] 陈秀真[1] 

机构地区：[1]上海交通大学信息安全工程学院,上海200240

出　　处：《信息安全与通信保密》2009年第4期79-81,共3页Information Security and Communications Privacy

基　　金：国家自然科学基金:60605019;教育部博士点基金:20070248002;国家863计划:2007AA01Z473

摘　　要：攻击图是网络安全分析人员常用的分析工具之一,文章重点研究了基于攻击图模型的系统安全分析架构,并结合攻击难度提出了应用蚁群算法,在攻击图中获取最小关键攻击集的优化解。同时,文章将实验结果与贪婪算法进行了比较,证明了蚁群算法在该应用上是一种高效的优化算法。Attack graph is a common tool for analyzing network security. This paper focuses on analyzing attack graph model in system security evaluation, and in combination of attack difficulty, proposes the ant algorithm to obtain minimal critical attack set in specific attack graph. Furthermore, the results of ant algorithm are compared with those of greed algorithm, and the experiment proves that the ant algorithm is an optimal and effective algorithm in this application.

关 键 词：攻击图 最小关键攻击集 最小碰撞集 蚁群算法 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]