Ranking attack graphs with graph neural networks

Liang Lu, R Safavi-Naini, Markus Hagenbuchner, W Susilo, J Horton, Sweah Liang Yong, Ah Tsoi

Research output: Chapter in Book/Report/Conference proceedingChapter (Book)Researchpeer-review

8 Citations (Scopus)

Abstract

Network security analysis based on attack graphs has been applied extensively in recent years. The ranking of nodes in an attack graph is an important step towards analyzing network security. This paper proposes an alternative attack graph ranking scheme based on a recent approach to machine learning in a structured graph domain, namely, Graph Neural Networks (GNNs). Evidence is presented in this paper that the GNN is suitable for the task of ranking attack graphs by learning a ranking function from examples and generalizes the function to unseen possibly noisy data, thus showing that the GNN provides an effective alternative ranking method for attack graphs.
Original languageEnglish
Title of host publicationInformation Security Practice and Experience
EditorsF Bao, H Li, G Wang
Place of PublicationBerlin, Heidelberg
PublisherSpringer
Pages345 - 359
Number of pages15
ISBN (Print)9783642008429
DOIs
Publication statusPublished - 2009

Cite this