DAG-based attack and defense modeling: don't miss the forest for the attack trees

DOI10.1016/j.cosrev.2014.07.001zbMath1300.68026arXiv1303.7397OpenAlexW2156607688MaRDI QIDQ473215

Barbara Kordy, Ludovic Piètre-Cambacédès, Patrick Schweitzer

Publication date: 24 November 2014

Published in: Computer Science Review (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.7397

zbMATH Keywords

Bayesian networksattack and defense modelingattack treesgraphical models for securityqualitative security assessmentquantitative security assessmentsecurity measures

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (14)

Assessing security of cryptocurrencies with attack-defense trees: proof of concept and future directions ⋮ The marriage between safety and cybersecurity: still practicing ⋮ Attack trees vs. fault trees: two sides of the same coin from different currencies ⋮ A polytope-based approach to measure the impact of events against critical infrastructures ⋮ Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model ⋮ Is my attack tree correct? ⋮ Probabilistic reasoning with graphical security models ⋮ Quantitative Attack Tree Analysis via Priced Timed Automata ⋮ Risk framework for bitcoin custody operation with the revault protocol ⋮ From attack graph analysis to attack function analysis ⋮ A review of attack graph and attack tree visual syntax in cyber security ⋮ Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs ⋮ Parametric Analyses of Attack-fault Trees* ⋮ Fault tree analysis: a survey of the state-of-the-art in modeling, analysis and tools

Uses Software

• bnlearn
• ADTool
• AttackTree
• MulVAL
• RRE
• SeaMonster
• SecurITree
• ADEPTS

Cites Work

• Unnamed Item
• Unnamed Item
• Fusion, propagation, and structuring in belief networks
• Advances in information and computer security. Second international workshop on security, IWSEC 2007, Nara, Japan, October 29--31, 2007. Proceedings
• Computer network security. 5th international conference on mathematical methods, models and architectures for computer network security, MMM-ACNS 2010, St. Petersburg, Russia, September 8--10, 2010. Proceedings
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
• Attribution of attack trees
• OWA trees and their role in security modeling using attack trees
• Attack–Defense Trees and Two-Player Binary Zero-Sum Extensive Form Games Are Equivalent
• Generic Inference
• New Efficient Utility Upper Bounds for the Fully Adaptive Model of Attack Trees
• An improved model of attack probability prediction system
• Bayesian Networks and Decision Graphs
• Dynamic fault-tree models for fault-tolerant computer systems
• Additive decomposition for the product of two θ3 functions and modular equations
• Upper Bounds for Adversaries’ Utility in Attack Trees
• Quantitative Questions on Attack–Defense Trees
• A linear time algorithm for finding tree-decompositions of small treewidth
• Attack-defense trees
• Information Security and Cryptology - ICISC 2005

This page was built for publication: DAG-based attack and defense modeling: don't miss the forest for the attack trees