Affiliations: [a] School of Computer Science and Engineering, Nanyang Technological University, Singapore. [email protected] | [b] CSC/SnT, University of Luxembourg, Luxembourg. [email protected] | [c] School of Computer Science and Engineering, Nanyang Technological University, Singapore. [email protected]
Correspondence:
[*]
Address for correspondence: School of Computer Science and Engineering, Nanyang Technological University, Singapore
Abstract: Attack trees profile the sub-goals of the proponent of an attack. Attack trees have a variety of semantics depending on the kind of question posed about the attack, where questions are captured by an attribute domain. We observe that one of the most general semantics for attack trees, the multiset semantics, coincides with a semantics expressed using linear logic propositions. The semantics can be used to compare attack trees to determine whether one attack tree is a specialisation of another attack tree. Building on these observations, we propose two new semantics for an extension of attack trees named causal attack trees. Such attack trees are extended with an operator capturing the causal order of sub-goals in an attack. These two semantics extend the multiset semantics to sets of series-parallel graphs closed under certain graph homomorphisms, where each semantics respects a class of attribute domains. We define a sound logical system with respect to each of these semantics, by using a recently introduced extension of linear logic, called MAV, featuring a non-commutative operator. The non-commutative operator models causal dependencies in causal attack trees. Similarly to linear logic for attack trees, implication defines a decidable preorder for specialising causal attack trees that soundly respects a class of attribute domains.
Keywords: attack trees, semantics, causality, linear logic, calculus of structures
