New efficient utility upper bounds for the fully adaptive model of attack trees

Ahto Buldas, Aleksandr Lenin

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

    11 Citations (Scopus)


    We present a new fully adaptive computational model for attack trees that allows attackers to repeat atomic attacks if they fail and to play on if they are caught and have to pay penalties. The new model allows safer conclusions about the security of real-life systems and is somewhat (computationally) easier to analyze. We show that in the new model optimal strategies always exist and finding the optimal strategy is (just) an np-complete problem. We also present methods to compute adversarial utility estimation and utility upper bound approximated estimation using a bottom-up approach.
    Original languageEnglish
    Title of host publicationDecision and Game Theory for Security
    Subtitle of host publication4th International Conference, GameSec 2013, Fort Worth, TX, USA, November 11-12, 2013. Proceedings
    EditorsSajal K. Das, Cristina Nita-Rotaru, Murat Kantarcioglu
    Place of PublicationBerlin
    Number of pages14
    ISBN (Electronic)978-3-319-02786-9
    ISBN (Print)978-3-319-02785-2
    Publication statusPublished - Nov 2013
    Event4th International Conference on Decision and Game Theory for Security, GameSec 2013 - Fort Worth, United States
    Duration: 11 Nov 201312 Nov 2013
    Conference number: 4

    Publication series

    NameLecture notes in computer science
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349


    Conference4th International Conference on Decision and Game Theory for Security, GameSec 2013
    Abbreviated titleGameSec
    Country/TerritoryUnited States
    CityFort Worth


    • EC Grant Agreement nr.: FP7/2007-2013
    • EC Grant Agreement nr.: FP7/318003

    Cite this