Adversarial Formal Semantics of Attack Trees and Related Problems - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Adversarial Formal Semantics of Attack Trees and Related Problems

Résumé

Security is a subject of increasing attention in our actual society in order to protect critical resourcesfrom information disclosure, theft or damage. The informal model of attack trees introduced bySchneier, and widespread in the industry, is advocated in the 2008 NATO report to govern the evaluationof the threat in risk analysis. Attack-defense trees have since been the subject of many theoreticalworks addressing different formal approaches.In 2017, M. Audinot et al. introduced a path semantics over a transition system for attack trees.Inspired by the latter, we propose a two-player interpretation of the attack-tree formalism. To doso, we replace transition systems by concurrent game arenas and our associated semantics consistof strategies. We then show that the emptiness problem, known to be NP-complete for the pathsemantics, is now PSPACE-complete. Additionally, we show that the membership problem is CONPcompletefor our two-player interpretation while it collapses to P in the path semantics.

Dates et versions

hal-04047591 , version 1 (27-03-2023)

Identifiants

Citer

Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko. Adversarial Formal Semantics of Attack Trees and Related Problems. 13th International Symposium on Games, Automata, Logics and Formal Verification (GandALF 22), Sep 2022, Madrid, Spain. pp.162-177, ⟨10.4204/EPTCS.370.11⟩. ⟨hal-04047591⟩
15 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More