基于属性邻接矩阵的攻击图表示方法研究  

Research on Attack Graph Based on Attributes Adjacncy Matrix

作　　者：苏婷婷[1] 潘晓中[1] 肖海燕[1] 申军伟[1] 

机构地区：[1]武警工程大学网络与信息安全武警部队重点实验室,西安710086

出　　处：《电子与信息学报》2012年第7期1744-1747,共4页Journal of Electronics & Information Technology

基　　金：国家自然科学基金项目(61103230;61103231)资助课题

摘　　要：为降低攻击图的复杂度,方便安全人员的理解分析,该文提出了属性邻接矩阵的表示方法,并设计了多步邻接矩阵的算法。利用邻接矩阵元素表示目标网络中各属性的连接关系,通过矩阵算法得到多步攻击路径,对邻接矩阵进行概率计算可得攻击成功的概率。实验环境验证了所提方法能提高攻击图的可视性,降低安全分析的难度。In order to extend visualization of attack graphs, a method of adjacency matrix based on attributes is proposed, and the arithmetic of multi-step adjacency matrix is designed. The elements of the matrix shows connections of the network. The probability of attack paths is obtained through numeration of probability of the adjacency matrix. Experiment results show that the proposed method can efficiently decrease the complexity of attack graphs, and make it easier to analyze the network vulnerability.

关 键 词：网络安全 攻击图 邻接矩阵 脆弱性 

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