Attack-defense trees and two-player binary zero-sum extensive form games are equivalent

DOI10.1007/978-3-642-17197-0_17MaRDI QIDQ3056873zbMATH OpenOpenAlexFDO

Authors Barbara Kordy, Sjouke Mauw, Matthijs Melissen, Patrick Schweitzer

Publication date 23 November 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-17197-0_17

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) 2-person games (91A05) Games in extensive form (91A18) Applications of game theory (91A80)

Recommendations

• Attack-defense trees
• Information Security and Cryptology - ICISC 2005
• On quantitative analysis of attack-defense trees with repeated labels
• Attack trees vs. fault trees: two sides of the same coin from different currencies
• Is my attack tree correct?

Cited in

(5)

• Probabilistic reasoning with graphical security models
• A review of attack graph and attack tree visual syntax in cyber security
• Genetic approximations for the failure-free security games
• DAG-based attack and defense modeling: don't miss the forest for the attack trees
• Adversarial formal semantics of attack trees and related problems

This page was built for publication: Attack-defense trees and two-player binary zero-sum extensive form games are equivalent

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3056873)