• Login
    View Item 
    •   Home
    • Conferences, Workshops, Lecture Series, and Symposiums
    • Phi Kappa Phi Student Research and Fine Arts Conference
    • 19th Annual Phi Kappa Phi Student Research and Fine Arts Conference (2018)
    • 19th Annual PKP Student Research and Fine Arts Conference: Oral Symposia III
    • View Item
    •   Home
    • Conferences, Workshops, Lecture Series, and Symposiums
    • Phi Kappa Phi Student Research and Fine Arts Conference
    • 19th Annual Phi Kappa Phi Student Research and Fine Arts Conference (2018)
    • 19th Annual PKP Student Research and Fine Arts Conference: Oral Symposia III
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of Scholarly CommonsCommunitiesTitleAuthorsIssue DateSubmit DateSubjectsThis CollectionTitleAuthorsIssue DateSubmit DateSubjects

    My Account

    LoginRegister

    About

    AboutCreative CommonsAugusta University LibrariesUSG Copyright Policy

    Statistics

    Display statistics

    The Mathematical Structure of Attack Trees

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    pkp_paper_Bryant_2018.pdf
    Size:
    1.514Mb
    Format:
    PDF
    Download
    Authors
    Bryant, Aubrey
    Issue Date
    2018-02-12
    URI
    http://hdl.handle.net/10675.2/621723
    
    Metadata
    Show full item record
    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
    Description
    Presentation given at the 19th Annual Phi Kappa Phi Student Research and Fine Arts Conference
    Collections
    19th Annual PKP Student Research and Fine Arts Conference: Oral Symposia III

    entitlement

     
    DSpace software (copyright © 2002 - 2019)  DuraSpace
    Quick Guide | Contact Us
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.