Attack--Defense Trees and Two-Player Binary Zero-Sum Extensive Form Games Are Equivalent - Technical Report with Proofs

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 equivalen...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Kordy, Barbara, Mauw, Sjouke, Melissen, Matthijs, Schweitzer, Patrick
Format Paper Journal Article
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 04.05.2011
Subjects
Computer Science - Computer Science and Game Theory
Computer Science - Cryptography and Security
Equivalence
Game theory
Trees
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2331-8422
DOI:10.48550/arxiv.1006.2732