Exploring risk flow attack graph for security risk assessment

被引:24
作者
Dai, Fangfang [1 ]
Hu, Ying [2 ]
Zheng, Kangfeng [1 ]
Wu, Bin [1 ]
机构
[1] Beijing Univ Posts & Telecommun, Informat Secur Ctr, Beijing 100876, Peoples R China
[2] Armed Police Beijing Command Acad, Beijing 100012, Peoples R China
基金
中国国家自然科学基金;
关键词
risk management; graph theory; security of data; fuzzy set theory; risk flow attack graph; security risk assessment; invasive events; network risk; RFAG-based risk assessment approach; biobjective sorting algorithm; fuzzy comprehensive evaluation; risk path priority; synthetic network scenario; network security situation; critical risk assessment;
D O I
10.1049/iet-ifs.2014.0272
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Researchers have previously looked into the problem of determining the connection between invasive events and network risk, and attack graph (AG) was proposed to seek countermeasures. However, AG has proved to have various limitations in practical applications. To overcome such defects, this study presents a risk flow attack graph (RFAG)-based risk assessment approach. In particular, this approach applies a RFAG to represent network and attack scenarios, which are then fed to a network flow model for computing risk flow. A bi-objective sorting algorithm is employed to automatically infer the priority of risk paths and assist risk assessment, and a fuzzy comprehensive evaluation is performed to determine risk severity. Via the aforementioned processes, the authors simplify AG and follow the risk path of originating, transferring, redistributing and converging to assess security risk. The authors use a synthetic network scenario to illustrate this approach and evaluate its performance through a set of simulations. Experiments show that the approach is capable of effectively identifying network security situations and assessing critical risk.
引用
收藏
页码:344 / 353
页数:10
相关论文
共 12 条
[1]   Optimal security hardening on attack tree models of networks: a cost-benefit analysis [J].
Dewri, Rinku ;
Ray, Indrajit ;
Poolsappasit, Nayot ;
Whitley, Darrell .
INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 2012, 11 (03) :167-188
[2]   Multiobjective immune algorithm with nondominated neighbor-based selection [J].
Gong, Maoguo ;
Jiao, Licheng ;
Du, Haifeng ;
Bo, Liefeng .
EVOLUTIONARY COMPUTATION, 2008, 16 (02) :225-255
[3]   Algebraic methods applied to shortest path and maximum flow problems in stochastic networks [J].
Hastings, K. C. ;
Shier, D. R. .
NETWORKS, 2013, 61 (02) :117-127
[4]   Extending Attack Graph-Based Security Metrics and Aggregating Their Application [J].
Idika, Nwokedi ;
Bhargava, Bharat .
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2012, 9 (01) :75-85
[5]  
Jinyu W., 2011, J COMPUT RES DEV, V48, P1497
[6]   Simplifying maximum flow computations: The effect of shrinking and good initial flows [J].
Liers, F. ;
Pardella, G. .
DISCRETE APPLIED MATHEMATICS, 2011, 159 (17) :2187-2203
[7]   Common vulnerability, scoring system [J].
Mell, Peter ;
Scarfone, Karen ;
Romanosky, Sasha .
IEEE SECURITY & PRIVACY, 2006, 4 (06) :85-89
[8]  
Noel S, 2010, INT J NEXT-GENER COM, V1, P113
[9]  
Ravindra K.Ahuja., 1993, NETWORK FLOWS THEORY
[10]   The value of information in stochastic maximum flow problems [J].
Tahmasbi, Rasool ;
Nasrabadi, Ebrahim ;
Hashemi, S. Mehdi .
COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (07) :1744-1751