Automated generation of attack trees with optimal shape and labelling
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913423847063552 |
|---|---|
| author | Gadyatskaya, Olga Mauw, Sjouke Trujillo-Rasuac, Rolando Willemse, Tim A. C. |
| author_facet | Gadyatskaya, Olga Mauw, Sjouke Trujillo-Rasuac, Rolando Willemse, Tim A. C. |
| contents | This article addresses the problem of automatically generating attack trees that soundly and clearly describe the ways the system can be attacked. Soundness means that the attacks displayed by the attack tree are indeed attacks in the system; clarity means that the tree is efficient in communicating the attack scenario. To pursue clarity, we introduce an attack-tree generation algorithm that minimises the tree size and the information length of its labels without sacrificing correctness. We achieve this by i) introducing a system model that allows to reason about attacks and goals in an efficient manner, and ii) by establishing a connection between the problem of factorising algebraic expressions and the problem of minimising the tree size. To the best of our knowledge, we introduce the first attack-tree generation framework that optimises the labelling and shape of the generated trees, while guaranteeing their soundness with respect to a system specification. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_13331 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Automated generation of attack trees with optimal shape and labelling Gadyatskaya, Olga Mauw, Sjouke Trujillo-Rasuac, Rolando Willemse, Tim A. C. Cryptography and Security Formal Languages and Automata Theory This article addresses the problem of automatically generating attack trees that soundly and clearly describe the ways the system can be attacked. Soundness means that the attacks displayed by the attack tree are indeed attacks in the system; clarity means that the tree is efficient in communicating the attack scenario. To pursue clarity, we introduce an attack-tree generation algorithm that minimises the tree size and the information length of its labels without sacrificing correctness. We achieve this by i) introducing a system model that allows to reason about attacks and goals in an efficient manner, and ii) by establishing a connection between the problem of factorising algebraic expressions and the problem of minimising the tree size. To the best of our knowledge, we introduce the first attack-tree generation framework that optimises the labelling and shape of the generated trees, while guaranteeing their soundness with respect to a system specification. |
| title | Automated generation of attack trees with optimal shape and labelling |
| topic | Cryptography and Security Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2311.13331 |