[en] 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 game 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.
Disciplines :
Sciences informatiques
Identifiants :
UNILU:UL-CONFERENCE-2013-042
Auteur, co-auteur :
KORDY, Barbara ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
MAUW, Sjouke ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
MELISSEN, Matthijs ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
SCHWEITZER, Patrick ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Langue du document :
Anglais
Titre :
Attack-Defense Trees and Two-Player Binary Zero-Sum Extensive Form Games Are Equivalent
Date de publication/diffusion :
2010
Nom de la manifestation :
Conference on Decision and Game Theory for Security (GameSec 2010)
Lieu de la manifestation :
Berlin, Allemagne
Date de la manifestation :
22-23 November, 2010
Titre de l'ouvrage principal :
Proceedings of GameSec 2010
Maison d'édition :
Springer
ISBN/EAN :
978-3-642-17196-3
Collection et n° de collection :
LNCS 6442
Pagination :
245-256
Peer reviewed :
Peer reviewed
Commentaire :
Extended version available at http://arxiv.org/abs/1006.2732
