首页 | 本学科首页   官方微博 | 高级检索  
     

基于攻击图的风险邻接矩阵研究
引用本文:叶云,徐锡山,贾焰,齐治昌,程文聪.基于攻击图的风险邻接矩阵研究[J].通信学报,2011,32(5):112-120.
作者姓名:叶云  徐锡山  贾焰  齐治昌  程文聪
作者单位:国防科技大学计算机学院,湖南,长沙,410073
基金项目:国家高技术研究发展计划(“863”计划)基金资助项目(2009AA01Z436,2007AA01Z474,2007AA010502,2006AA01Z451)~~
摘    要:针对各种已知的工具产生的攻击图十分复杂而且难以理解的问题,提出一种基于攻击图的风险邻接矩阵方法,并通过实验验证了所提方法的合理性和有效性。结果表明风险邻接矩阵方法增强了攻击图可视化的程度,并简洁有效地解决了风险评估中由环和回路带来的重复计算问题。

关 键 词:脆弱性  攻击图  聚集算法  风险邻接矩阵

Research on the risk adjacency matrix based on attack graphs
YE Yun,XU Xi-shan,JIA Yan,QI Zhi-chang,CHENG Wen-cong.Research on the risk adjacency matrix based on attack graphs[J].Journal on Communications,2011,32(5):112-120.
Authors:YE Yun  XU Xi-shan  JIA Yan  QI Zhi-chang  CHENG Wen-cong
Affiliation:YE Yun,XU Xi-shan,JIA Yan,QI Zhi-chang,CHENG Wen-cong(School of Computer Science,National University of Defense Technology,Changsha 410073,China)
Abstract:Aimed at the problem that the difficulty to understand the very complicated attack graphs generated by a variety of existing tools,a method of RAM(risk adjacency matrix) based on attack graphs was proposed,and feasibility and efficient of proposed method was verified in experiment.The experimental results on the network showed that visualization of attack graphs was extended significantly,and the re-computing problem caused by the rings and loops in the risk assessment was solved in a simple and efficient w...
Keywords:vulnerability  attack graphs  clustering algorithm  risk adjacency matrix  
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《通信学报》浏览原始摘要信息
点击此处可从《通信学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号