Performance Analysis of Scalable Attack Representation Models

被引:0
作者
Hong, Jin B. [1 ]
Kim, Dong Seong [1 ]
机构
[1] Univ Canterbury, Comp Sci & Software Engn, Christchurch 1, New Zealand
来源
SECURITY AND PRIVACY PROTECTION IN INFORMATION PROCESSING SYSTEMS | 2013年 / 405卷
关键词
Attack Graph; Attack Tree; Complexity Analysis; Security Model; Scalability;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Attack graphs (AGs) have been widely used for security analysis. The construction of the graph-based attack models including the AG have been studied, but the security evaluation considering the full attack paths cannot be computed using existing attack models due to the scalability problem. To solve this, we propose to use hierarchical attack representation models (HARMs). First, we formulate key questions that need to be answered to compare the scalability of existing attack models. We show the scalability of the HARMs via simulations, by taking into account practical attack scenario based on various network topologies.
引用
收藏
页码:330 / 343
页数:14
相关论文
共 23 条
[21]  
Schneier B., 2000, Secrets and Lies: Digital Security in a Networked World
[22]  
Sheyner O, 2002, TECHNICAL REPORT
[23]  
Xie A., 2009, P COMP SEC APPL C AC