Ranking Attack Graphs with Graph Neural Networks

  • Authors:
  • Liang Lu;Rei Safavi-Naini;Markus Hagenbuchner;Willy Susilo;Jeffrey Horton;Sweah Liang Yong;Ah Chung Tsoi

  • Affiliations:
  • University of Wollongong, Wollongong, Australia;Department of Computer Science, University of Calgary, Canada;University of Wollongong, Wollongong, Australia;University of Wollongong, Wollongong, Australia;University of Wollongong, Wollongong, Australia;University of Wollongong, Wollongong, Australia;Hong Kong Baptist University, Kowloon, Hong Kong

  • Venue:
  • ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.