Attack--Defense Trees and Two-Player Binary Zero-Sum Extensive Form Games Are Equivalent - Technical Report with Proofs
Cryptography and Security
2011-05-05 v4 Computer Science and Game Theory
Abstract
Attack--defense trees are used to describe security weaknesses of a system and possible countermeasures. In this paper, the connection between attack--defense trees and game theory is made explicit. We show that attack--defense trees and binary zero-sum two-player extensive form games have equivalent expressive power when considering satisfiability, in the sense that they can be converted into each other while preserving their outcome and their internal structure.
Cite
@article{arxiv.1006.2732,
title = {Attack--Defense Trees and Two-Player Binary Zero-Sum Extensive Form Games Are Equivalent - Technical Report with Proofs},
author = {Barbara Kordy and Sjouke Mauw and Matthijs Melissen and Patrick Schweitzer},
journal= {arXiv preprint arXiv:1006.2732},
year = {2011}
}
Comments
Added link to springerlink; Proceedings of GameSec 2010