Serial model for attack tree computations

  • Authors:
  • Aivo Jürgenson;Jan Willemson

  • Affiliations:
  • Tallinn University of Technology, Tallinn, Estonia and Elion Enterprises Ltd, Tallinn, Estonia;Cybernetica, Tartu, Estonia

  • Venue:
  • ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we extend the standard attack tree model by introducing temporal order to the attacker's decision making process. This will allow us to model the attacker's behaviour more accurately, since this way it is possible to study his actions related to dropping some of the elementary attacks due to them becoming obsolete based on the previous success/failure results. We propose an efficient algorithm for computing the attacker's expected outcome based on the given order of the elementary attacks and discuss the pros and cons of considering general rooted directed acyclic graphs instead of plain trees as the foundations for attack modelling.