About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
Cloud Computing. 11th EAI International Conference, CloudComp 2021, Virtual Event, December 9–10, 2021, Proceedings

Research Article

Heuristic Network Security Risk Assessment Based on Attack Graph

Download(Requires a free EAI acccount)
2 downloads
Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.1007/978-3-030-99191-3_14,
        author={Wei Sun and Qianmu Li and Pengchuan Wang and Jun Hou},
        title={Heuristic Network Security Risk Assessment Based on Attack Graph},
        proceedings={Cloud Computing. 11th EAI International Conference, CloudComp 2021, Virtual Event, December 9--10, 2021, Proceedings},
        proceedings_a={CLOUDCOMP},
        year={2022},
        month={3},
        keywords={Attack graph Attack paths Heuristic algorithm CVE Cyber security},
        doi={10.1007/978-3-030-99191-3_14}
    }
    
  • Wei Sun
    Qianmu Li
    Pengchuan Wang
    Jun Hou
    Year: 2022
    Heuristic Network Security Risk Assessment Based on Attack Graph
    CLOUDCOMP
    Springer
    DOI: 10.1007/978-3-030-99191-3_14
Wei Sun, Qianmu Li,*, Pengchuan Wang, Jun Hou1
  • 1: School of Social Science
*Contact email: qianmu@njust.edu.cn

Abstract

With the development of attack technology, attackers prefer to exploit multiple vulnerabilities with a combination of several attacks instead of simply using violent cracking and botnets. In addition, enterprises tend to adopt microservices architectures and multi-cloud environments to obtain high efficiency, high reliability and high scalability. It makes modeling attack scenarios and mapping the actions of potential adversaries an urgent and difficult task. There have been many improvements that can automatically generate attack graphs for complex networks. However, extracting enough effective information from such complex attack graphs is still a problem to be solved. Traditional algorithms can’t always accomplish this task because of variable and complex attack graph inputs. In contrast, heuristic algorithms have the advantages of adaptability, self-learning ability, robustness and high efficiency. In this paper, we present heuristic algorithms to complete the analysis of attack graphs, including fusion algorithm of particle swarm optimization (PSO) algorithm and grey wolf optimization (GWO) algorithm for finding the spanning arborescence of maximum weight and improved genetic simulated annealing (GA-SA) algorithm for finding attack path with the biggest risk. Also, we present a method for node importance evaluation based on the interpretive structural modeling (ISM) method. We test our methods on a multi-cloud enterprise network, and the result shows that our methods perform well.

Keywords
Attack graph Attack paths Heuristic algorithm CVE Cyber security
Published
2022-03-23
Appears in
SpringerLink
http://dx.doi.org/10.1007/978-3-030-99191-3_14
Copyright © 2021–2025 ICST
EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL