Attack–Defense Trees and Two-Player Binary Zero-Sum Extensive Form Games Are Equivalent
From MaRDI portal
Publication:3056873
DOI10.1007/978-3-642-17197-0_17zbMath1298.91066OpenAlexW2973135414MaRDI QIDQ3056873
Matthijs Melissen, Patrick Schweitzer, Barbara Kordy, Sjouke Mauw
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
2-person games (91A05) Applications of game theory (91A80) Games in extensive form (91A18) Data encryption (aspects in computer science) (68P25)
Related Items (3)
Probabilistic reasoning with graphical security models ⋮ A review of attack graph and attack tree visual syntax in cyber security ⋮ DAG-based attack and defense modeling: don't miss the forest for the attack trees
This page was built for publication: Attack–Defense Trees and Two-Player Binary Zero-Sum Extensive Form Games Are Equivalent
