Squeezing State Spaces of (Attack-Defence) Trees

Petrucci, Laure; Knapik, Michał; Penczek, Wojciech; Sidoruk, Teofil

doi:10.1109/iceccs.2019.00015

Cited by 5 publications

(3 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Petrucci et al extend in [Pet+19] this latter work with a reduction technique dedicated to trees, allowing for a faster checking process. It consists in using the layered structure present in a tree, in particular an attack tree, to ignore some of the interleavings when exploring the tree.…”

Section: Attack-defense Treesmentioning

confidence: 99%

Timed Automata as a Formalism for Expressing Security: A Survey on Theory and Practice

Arcile

André

2022

ACM Comput. Surv.

View full text Add to dashboard Cite

Timed automata are a common formalism for the verification of concurrent systems subject to timing constraints. They extend finite-state automata with clocks, that constrain the system behavior in locations, and to take transitions. While timed automata were originally designed for safety (in the wide sense of correctness w.r.t. a formal property), they were progressively used in a number of works to guarantee security properties. In this work, we review works studying security properties for timed automata in the last two decades. We notably review theoretical works, with a particular focus on opacity, as well as more practical works, with a particular focus on attack trees and their extensions. We derive main conclusions concerning open perspectives, as well as tool support.

show abstract

Section: Attack-defense Treesmentioning

confidence: 99%

Timed Automata as a Formalism for Expressing Security: A Survey on Theory and Practice

Arcile

André

2022

ACM Comput. Surv.

View full text Add to dashboard Cite

show abstract

“…Intuitively, each node of the ADTree corresponds to a single automaton in the resulting network. Specific patterns, embedding reductions to minimise state space explosion [4], are used for different types of ADTree constructs. As the specifics exceed the scope and space of this paper, we refer the reader to [18] for the AMAS semantics, and to [5] for the details on the translation.…”

Section: B Translation To Extended Amasmentioning

confidence: 99%

“…They provide a simple graphical formalism of possible attacker's actions to be taken in order to attack a system and the defender's defences employed to protect the system. Recently, it has been proposed to model ADTrees in the formalism of asynchronous multi-agent systems (AMAS) extended with certain ADTree characteristics [4], [5]. In this setting, one can reason about attack/defence scenarios considering agent distributions over tree nodes and their impact on the feasibility and performance (quantified by metrics such as time and cost) of attacking and defending strategies executed by specific coalitions.…”

Section: Introductionmentioning

confidence: 99%

Minimal Schedule with Minimal Number of Agents in Attack-Defence Trees

Arias¹,

Penczek²,

Petrucci³

et al. 2022

2022 26th International Conference on Engineering of Complex Computer Systems (ICECCS)

Self Cite

View full text Add to dashboard Cite

Expressing attack-defence trees in a multi-agent setting allows for studying a new aspect of security scenarios, namely how the number of agents and their task assignment impact the performance, e.g. attack time, of strategies executed by opposing coalitions. Optimal scheduling of agents' actions, a non-trivial problem, is thus vital. We discuss associated caveats and propose an algorithm that synthesises such an assignment, targeting minimal attack time and using the minimal number of agents for a given attack-defence tree. We also investigate an alternative approach for the same problem using Rewriting Logic, starting with a simple and elegant declarative model, whose correctness (in terms of schedule's optimality) is self-evident. We then refine this specification, inspired by the design of our specialised algorithm, to obtain an efficient system that can be used as a playground to explore various aspects of attack-defence trees. We compare the two approaches on different benchmarks.

show abstract

Quantitative Analysis of Attack Defense Trees

Pekergin

Tan

2021

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

Squeezing State Spaces of (Attack-Defence) Trees

Cited by 5 publications

References 21 publications

Timed Automata as a Formalism for Expressing Security: A Survey on Theory and Practice

Timed Automata as a Formalism for Expressing Security: A Survey on Theory and Practice

Minimal Schedule with Minimal Number of Agents in Attack-Defence Trees

Quantitative Analysis of Attack Defense Trees

Contact Info

Product

Resources

About