A Scalable Approach to Analyzing Network Security using Compact Attack Graphs

2010 ◽  
Vol 5 (5) ◽  
Author(s):  
Feng Chen ◽  
Dehui Liu ◽  
Yi Zhang ◽  
Jinshu Su
2017 ◽  
pp. 1-23 ◽  
Author(s):  
Marcel Frigault ◽  
Lingyu Wang ◽  
Sushil Jajodia ◽  
Anoop Singhal

Author(s):  
Anming Xie ◽  
Zhuhua Cai ◽  
Cong Tang ◽  
Jianbin Hu ◽  
Zhong Chen

2015 ◽  
Vol 12 (1) ◽  
pp. 45-61 ◽  
Author(s):  
Chao Zhao ◽  
Huiqiang Wang ◽  
Junyu Lin ◽  
Hongwu Lv ◽  
Yushu Zhang

Analyzing attack graphs can provide network security hardening strategies for administrators. Concerning the problems of high time complexity and costly hardening strategies in previous methods, a method for generating low cost network security hardening strategies is proposed based on attack graphs. The authors' method assesses risks of attack paths according to path length and the common vulnerability scoring system, limits search scope with a threshold to reduce the time complexity, and lowers cost of hardening strategies by using a heuristic algorithm. The experimental results show that the authors' method has good scalability, and significantly reduces cost of network security hardening strategies with reasonable running time.


Author(s):  
Anming Xie ◽  
Weiping Wen ◽  
Li Zhang ◽  
Jianbin Hu ◽  
Zhong Chen

Sign in / Sign up

Export Citation Format

Share Document