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.
Original language | English |
---|---|
Title of host publication | Decision and Game Theory for Security |
Subtitle of host publication | 4th International Conference, GameSec 2013, Fort Worth, TX, USA, November 11-12, 2013. Proceedings |
Editors | Sajal K. Das, Cristina Nita-Rotaru, Murat Kantarcioglu |
Place of Publication | Berlin |
Publisher | Springer |
Pages | 192-205 |
Number of pages | 14 |
ISBN (Electronic) | 978-3-319-02786-9 |
ISBN (Print) | 978-3-319-02785-2 |
DOIs | |
Publication status | Published - Nov 2013 |
Event | 4th International Conference on Decision and Game Theory for Security, GameSec 2013 - Fort Worth, United States Duration: 11 Nov 2013 → 12 Nov 2013 Conference number: 4 |
Publication series
Name | Lecture notes in computer science |
---|---|
Publisher | Springer |
Volume | 8252 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 4th International Conference on Decision and Game Theory for Security, GameSec 2013 |
---|---|
Abbreviated title | GameSec |
Country/Territory | United States |
City | Fort Worth |
Period | 11/11/13 → 12/11/13 |
Keywords
- EC Grant Agreement nr.: FP7/2007-2013
- EC Grant Agreement nr.: FP7/318003