Next SSL Seminar will take place on Tuesday, April 11th at 1.30 pm in rooms B001 – B013.
Axel Legay (Irisa) will give a presentation entitled “Modelling Attack-Defense Trees using Timed Automata“.
Performing a thorough security risk assessment of an organisation has always been challenging, but with the increased reliance on outsourced and o-site third-party services, i.e., \cloud services”, combined with internal (legacy) IT-infrastructure and -services, it has become a very dicult and time-consuming task. One of the traditional tools available to ease the burden of performing a security risk assessment and structure security analyses in general is attack trees, a tree-based formalism inspired by fault trees, a well-known formalism used in safety engineering.
In this talk we study an extension of traditional attack trees, called attack-defense trees, in which not only the attacker’s actions are modelled, but also the defensive actions taken by the attacked party. In this work we use the attack-defense tree as a goal an attacker wants to achieve, and separate the behaviour of the attacker and defender from the attack-defense-tree. We give a fully stochastic timed semantics for the behaviour of the attacker by introducing attacker proles that choose actions probabilistically and execute these according to a probability density. Lastly, the stochastic semantics provides success probabilities for individual actions. Furthermore, we show how to introduce costs of attacker actions. Finally, we show how to automatically encode it all with a network of timed automata, an encoding that enables us to apply state-of-the-art model checking tools and techniques to perform fully automated quantitative and qualitative analyses of the modelled system.