An extension of attack trees

Yi-Chih Kao, Yuan Ping Hwang, Shih Chen Wang, Sheng Lung Peng*

*Corresponding author for this work

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

Abstract

Attack trees provide a model to describe the security of a system based on the possibility of various attacks. In this paper, we propose the concept of “attack graphs” as an extension of attack trees, wherein directed acyclic graphs are used to depict possible attacks on a system. By deploying this model, system managers can discern all possible threats to the system and thus are more likely to design efficient countermeasures to thwart those attacks. Within this model, we also propose the concept of the most dangerous path in the attack graph, and finally propose an algorithm to expose it.

Original languageEnglish
Title of host publicationSecurity with Intelligent Computing and Big-data Services
EditorsShiuh-Jeng Wang, Sheng-Lung Peng, Valentina Emilia Balas, Ming Zhao
PublisherSpringer Verlag
Pages79-85
Number of pages7
ISBN (Print)9783319764504
DOIs
StatePublished - 1 Jan 2018
EventInternational Conference on Security with Intelligent Computing and Big-data Services, SICBS 2017 - Hualien City, Taiwan
Duration: 15 Dec 201717 Dec 2017

Publication series

NameAdvances in Intelligent Systems and Computing
Volume733
ISSN (Print)2194-5357

Conference

ConferenceInternational Conference on Security with Intelligent Computing and Big-data Services, SICBS 2017
CountryTaiwan
CityHualien City
Period15/12/1717/12/17

Keywords

  • Attack graph
  • Attack trees
  • Directed acyclic graph
  • The most dangerous path

Fingerprint Dive into the research topics of 'An extension of attack trees'. Together they form a unique fingerprint.

Cite this