University of Twente Student Theses
Crunching Attack Trees : efficient algorithms for computation of metrics
Karsten, Jarik (2020) Crunching Attack Trees : efficient algorithms for computation of metrics.
|
PDF
459kB |
| Abstract: | Attack Trees are used to analyze system attacks. Their analysis provides security metrics that can be used as a resource to protect systems and increase their security levels. As the complexity of attacks and systems increases, Attack Trees become complex by incorporating DAG structures and attack orderings. This paper develops and implements algorithms to compute important security metrics such as Attack Values, Attack Paths, and Pareto Curves compared to existing model checking solutions, with EXPcomplexity as opposed to the PSPACE-complexity of the current state-of-the-art. We achieve these complexity bounds by using efficient BDD data structures and abstractions regarding the total orderings of basic attack steps. |
| Item Type: | Essay (Bachelor) |
| Faculty: | EEMCS: Electrical Engineering, Mathematics and Computer Science |
| Subject: | 54 computer science |
| Programme: | Computer Science BSc (56964) |
| Link to this item: | https://purl.utwente.nl/essays/82148 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page