Automated generation and analysis of attack graphs

被引:592
作者
Sheyner, O [1 ]
Haines, J [1 ]
Jha, S [1 ]
Lippmann, R [1 ]
Wing, JM [1 ]
机构
[1] Carnegie Mellon Univ, Dept Comp Sci, Pittsburgh, PA 15213 USA
来源
2002 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS | 2002年
关键词
D O I
10.1109/SECPRI.2002.1004377
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
An integral part of modeling the global view of network security is constructing attack graphs. In practice, attack graphs are produced manually By Red Teams. Construction by hand, however is tedious, error-prone, and impractical for attack graphs larger than a hundred nodes. In this paper We present an automated technique for generating and analyzing attack graphs, We base our technique on symbolic model checking [4] algorithms, letting us construct attack graphs automatically and efficiently. We also describe two analyses to help decide which attacks would be most cost-effective to guard against. We implemented our technique in a tool suite and tested it on a small network example, which includes models of a firewall and an intrusion detection system.
引用
收藏
页码:273 / 284
页数:12
相关论文
共 25 条
[1]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[2]  
[Anonymous], NUSMV NEW SYMB MOD C
[3]  
*AT T LABS, GRAPHV OP SOURC GRAP
[4]  
BRYANT RE, 1986, IEEE T COMPUT, V35, P677, DOI 10.1109/TC.1986.1676819
[5]   SYMBOLIC MODEL CHECKING - 1020 STATES AND BEYOND [J].
BURCH, JR ;
CLARKE, EM ;
MCMILLAN, KL ;
DILL, DL ;
HWANG, LJ .
INFORMATION AND COMPUTATION, 1992, 98 (02) :142-170
[6]  
Clarke E, 2001, Model checking
[7]  
Cormen T. H, 1985, INTRO ALGORITHMS, V1st
[8]  
Cuppens F, 2000, LECT NOTES COMPUT SC, V1907, P197
[9]  
Dacier M., 1994, THESIS I NATL POLYTE
[10]  
Deraison R., NESSUS SCANNER