Attack time analysis of attack trees via integer linear programming by Milan Lopuhaä-Zwakenberg, Postdoc, University of Twente

Abstract: Attack trees (ATs) are a flexible and well-established method of mapping a system's vulnerability against an adversary. An important metric of ATs is min time, the minimum amount of time an adversary needs to compromise the system. Unfortunately, no efficient method to calculate min time exists. In this talk, I will introduce two powerful tools to help calculate min time. First, I show how min time can be found using a novel method based on integer linear programming. Second, I show how modular analysis can split up the calculation into smaller sub-problems, considerably shortening computation time.