一种基于贪心策略的攻击图模型  

An Attack Graph Model Using Greedy Policy

作　　者：袁桓[1] 陆余良[1] 宋舜宏[1] 黄晖[1] 

机构地区：[1]合肥电子工程学院网络工程系,安徽合肥230037

出　　处：《计算机与现代化》2010年第7期63-67,共5页Computer and Modernization

摘　　要：通过分析网络攻击者在攻击过程中常采取的各种贪心策略,提出一种基于贪心策略的攻击图建模和生成方法,能够有效解决基于攻击图的网络安全分析中存在的规模和环路问题。实验表明使用该方法可明显减少所生成的攻击图的规模且解决了环路问题,同时保留了关键漏洞和攻击路径信息,提高了网络安全分析效率和可视化效果。By analyzing the greedy policies attackers used in their intrusions frequently,the paper proposes an attack graph modeling methodology using greedy policy,which can solve two issues in the process of network security analysis,namely scalability and cycle.The experiment results indicate that AGGP provides a novel solution to the problem of efficient attack graph representation and analysis with less nodes and edges generated,and can help network administrators to find the key vulnerabilities and attack paths effectively and visually.

关 键 词：贪心策略 攻击图 网络安全分析 

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