Reference Hub1
A Generation Method of Network Security Hardening Strategy Based on Attack Graphs

A Generation Method of Network Security Hardening Strategy Based on Attack Graphs

Chao Zhao, Huiqiang Wang, Junyu Lin, Hongwu Lv, Yushu Zhang
Copyright: © 2015 |Volume: 12 |Issue: 1 |Pages: 17
ISSN: 1545-7362|EISSN: 1546-5004|EISBN13: 9781466675711|DOI: 10.4018/IJWSR.2015010104
Cite Article Cite Article

MLA

Zhao, Chao, et al. "A Generation Method of Network Security Hardening Strategy Based on Attack Graphs." IJWSR vol.12, no.1 2015: pp.45-61. http://doi.org/10.4018/IJWSR.2015010104

APA

Zhao, C., Wang, H., Lin, J., Lv, H., & Zhang, Y. (2015). A Generation Method of Network Security Hardening Strategy Based on Attack Graphs. International Journal of Web Services Research (IJWSR), 12(1), 45-61. http://doi.org/10.4018/IJWSR.2015010104

Chicago

Zhao, Chao, et al. "A Generation Method of Network Security Hardening Strategy Based on Attack Graphs," International Journal of Web Services Research (IJWSR) 12, no.1: 45-61. http://doi.org/10.4018/IJWSR.2015010104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.