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

TitleNew efficient utility upper bounds for the fully adaptive model of attack trees
Publication TypeConference Paper
Year of Publication2013
AuthorsBuldas A., Lenin A.
Conference Name4th International Conference on Decision and Game Theory for Security (GameSec), Fort Worth, TX
Date PublishedNovember
PublisherSpringer
Conference LocationBerlin
Abstract

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.

DOI10.1007/978-3-319-02786-9_12