IDEAS home Printed from https://ideas.repec.org/a/igg/jwsr00/v12y2015i1p45-61.html
   My bibliography  Save this article

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

Author

Listed:
  • Chao Zhao

    (College of Computer Science and Technology, Harbin Engineering University, Harbin, China)

  • Huiqiang Wang

    (College of Computer Science and Technology, Harbin Engineering University, Harbin, China)

  • Junyu Lin

    (College of Computer Science and Technology, Harbin Engineering University, Harbin, China)

  • Hongwu Lv

    (College of Computer Science and Technology, Harbin Engineering University, Harbin, China)

  • Yushu Zhang

    (College of Computer Science and Technology, Harbin Engineering University, Harbin, China)

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.

Suggested Citation

  • Chao Zhao & Huiqiang Wang & Junyu Lin & Hongwu Lv & Yushu Zhang, 2015. "A Generation Method of Network Security Hardening Strategy Based on Attack Graphs," International Journal of Web Services Research (IJWSR), IGI Global, vol. 12(1), pages 45-61, January.
    • Handle: RePEc:igg:jwsr00:v:12:y:2015:i:1:p:45-61
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJWSR.2015010104
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jwsr00:v:12:y:2015:i:1:p:45-61. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.