Efficient Algorithms for Quantitative Attack Tree Analysis

Autor: Carlos E. Budde, Mariëlle Stoelinga
Rok vydání: 2021
Předmět:
Zdroj: CSF
CSF 2021: IEEE 34th Computer Security Foundations Symposium, 21-25 June 2021, Dubrovnik, Croatia, pp. 377-391
CSF 2021: IEEE 34th Computer Security Foundations Symposium, 21-25 June 2021, Dubrovnik, Croatia, 377-391. Los Alamitos : IEEE
STARTPAGE=377;ENDPAGE=391;TITLE=CSF 2021: IEEE 34th Computer Security Foundations Symposium, 21-25 June 2021, Dubrovnik, Croatia
2021 IEEE 34th Computer Security Foundations Symposium (CSF)
Popis: Numerous analysis methods for quantitative attack tree analysis have been proposed. These algorithms compute relevant security metrics, i.e. performance indicators that quantify how good the security of a system is, such as the most likely attack, the cheapest, or the most damaging one. This paper classifies attack trees in two dimensions: proper trees vs. directed acyclic graphs (i.e. with shared subtrees); and static vs. dynamic gates. For each class, we propose novel algorithms that work over a generic attribute domain, encompassing a large number of concrete security metrics defined on the attack tree semantics. We also analyse the computational complexity of our methods.
Comment: Public version of CSF'21 paper, including an appendix with all proofs of lemmas and theorems
Databáze: OpenAIRE