Hdl Handle:
http://hdl.handle.net/10675.2/621723
Title:
The Mathematical Structure of Attack Trees
Authors:
Bryant, Aubrey
Abstract:
In the kitchen, every cook can start with the same ingredients and end with a different result based on the recipe used. However, without cooking a hundred dishes, how can you tell which recipe is best? This problem of how to compare 'recipes' can be used to imagine the need for testing vulnerabilities in cybersecurity. In the field of cybersecurity, professionals use graphical models called attack trees to determine all the possible attacks on a particular system. These trees are basically recipes, or series of steps to gain a desired result. But they cannot be tested and compared by trial, so instead we need to use more abstract reasoning to weed outduplicates, compare prevention strategies and cost, and many other useful tasks. We are trying to translate the graphical models of attack trees into a mathematical model called POMSETs (partially-ordered multisets), in which each step in the recipe becomes a member of the POMSET. We then use several POMSET operators to build recipes with the proper ordering of steps. In doing this, we hope to be able to use these POMSET tools to better understand and compare the complex recipes that are attack trees.
Affiliation:
School of Computer and Cyber Sciences
Issue Date:
12-Feb-2018
URI:
http://hdl.handle.net/10675.2/621723
Submitted date:
17-JAN-2018 05:45PM
Type:
Oral Presentation
Description:
Presentation given at the 19th Annual Phi Kappa Phi Student Research and Fine Arts Conference
Appears in Collections:
19th Annual PKP Student Research and Fine Arts Conference: Oral Symposia III

Full metadata record

DC FieldValue Language
dc.contributor.authorBryant, Aubreyen
dc.date.accessioned2018-02-12T17:19:34Z-
dc.date.available2018-02-12T17:19:34Z-
dc.date.issued2018-02-12-
dc.date.submitted17-JAN-2018 05:45PM-
dc.identifier.urihttp://hdl.handle.net/10675.2/621723-
dc.descriptionPresentation given at the 19th Annual Phi Kappa Phi Student Research and Fine Arts Conferenceen
dc.description.abstractIn the kitchen, every cook can start with the same ingredients and end with a different result based on the recipe used. However, without cooking a hundred dishes, how can you tell which recipe is best? This problem of how to compare 'recipes' can be used to imagine the need for testing vulnerabilities in cybersecurity. In the field of cybersecurity, professionals use graphical models called attack trees to determine all the possible attacks on a particular system. These trees are basically recipes, or series of steps to gain a desired result. But they cannot be tested and compared by trial, so instead we need to use more abstract reasoning to weed outduplicates, compare prevention strategies and cost, and many other useful tasks. We are trying to translate the graphical models of attack trees into a mathematical model called POMSETs (partially-ordered multisets), in which each step in the recipe becomes a member of the POMSET. We then use several POMSET operators to build recipes with the proper ordering of steps. In doing this, we hope to be able to use these POMSET tools to better understand and compare the complex recipes that are attack trees.en
dc.subjectattack treesen
dc.subjectPOMSETsen
dc.subjectcybersecurityen
dc.titleThe Mathematical Structure of Attack Treesen
dc.typeOral Presentationen
dc.contributor.departmentSchool of Computer and Cyber Sciencesen
dc.contributor.sponsorEades, Harleyen
dc.contributor.sponsorSchool of Computer and Cyber Sciencesen
dc.contributor.affiliationAugusta Universityen
All Items in Scholarly Commons are protected by copyright, with all rights reserved, unless otherwise indicated.