Refinement-aware generation of attack trees

O. Gadyatskaya, R. Jhawar, S. Mauw, R. Trujillo-Rasua, T.A.C. Willemse

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

11 Citations (Scopus)

Abstract

Attack trees allow a security analyst to obtain an overview of the potential vulnerabilities of a system. Due to their refinement structure, attack trees support the analyst in understanding the system vulnerabilities at various levels of abstraction. However, contrary to manually synthesized attack trees, automatically generated attack trees are often not refinement-aware, making subsequent human processing much harder. The generation of attack trees in which the refined nodes correspond to semantically relevant levels of abstraction is still an open question. In this paper, we formulate the attack-tree generation problem and propose a methodology to, given a system model, generate attack trees with meaningful levels of abstraction.

Original languageEnglish
Title of host publicationSecurity and Trust Management
Subtitle of host publication13th International Workshop, STM 2017, Oslo, Norway, September 14–15, 2017, Proceedings
EditorsG. Livraga, C. Mitchell
Place of PublicationDordrecht
PublisherSpringer
Pages164-179
Number of pages16
ISBN (Electronic)978-3-319-68063-7
ISBN (Print)978-3-319-68062-0
DOIs
Publication statusPublished - 2017
Event13th International Workshop on Security and Trust Management, STM 2017 - Oslo, Norway
Duration: 14 Sept 201715 Sept 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10547 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th International Workshop on Security and Trust Management, STM 2017
Country/TerritoryNorway
CityOslo
Period14/09/1715/09/17

Fingerprint

Dive into the research topics of 'Refinement-aware generation of attack trees'. Together they form a unique fingerprint.

Cite this