基于贪心策略的网络攻击图生成方法  

Method of Network Attack Graph Generation Based on Greedy Policy

作　　者：宋舜宏[1] 陆余良[1] 夏阳[1] 袁桓[1] 

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

出　　处：《计算机工程》2011年第2期126-128,131,共4页Computer Engineering

摘　　要：网络攻击者总是希望更快地渗入网络内部,能够直接访问更加重要的主机,获得更高的主机访问权限。基于这一前提,分析各种网络攻击过程中的贪心策略,并建立相应的模型,应用这些贪心策略约束攻击图的生成过程。实验结果表明,生成的攻击图的规模明显减小,且没有丢失重要的网络攻击路径,同时改善了攻击图的可视化效果。Network attacker always wishes to penetrate into internal networks, direct access to more important host computers and get higher privilege on victim computers. Based on this assumption, some kinds of greedy policies are analyzed in network attack. The model is constructed and attack graph is limited under such greedy policy. Experimental results show that the attack graph is smaller in size and easier to understand than normal method without losing key attack paths.

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

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