Upper bounds for adversaries' utility in attack trees

DOI10.1007/978-3-642-34266-0_6MaRDI QIDQ4909433zbMATH OpenOpenAlexWikidataFDO

Authors Ahto Buldas, Roman Stepanenko

Publication date 13 March 2013

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-34266-0_6

Mathematics Subject Classification ID

Applications of game theory (91A80) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• New Efficient Utility Upper Bounds for the Fully Adaptive Model of Attack Trees
• Limiting adversarial budget in quantitative security assessment
• Attack-defense trees
• Model Checking Exact Cost for Attack Scenarios
• OWA trees and their role in security modeling using attack trees

Cited in

(10)

• Simple infeasibility certificates for attack trees
• A review of attack graph and attack tree visual syntax in cyber security
• OWA trees and their role in security modeling using attack trees
• Limiting adversarial budget in quantitative security assessment
• New Efficient Utility Upper Bounds for the Fully Adaptive Model of Attack Trees
• Model Checking Exact Cost for Attack Scenarios
• Genetic approximations for the failure-free security games
• DAG-based attack and defense modeling: don't miss the forest for the attack trees
• Towards modelling adaptive attacker's behaviour
• Expected Cost Analysis of Attack-Defense Trees

This page was built for publication: Upper bounds for adversaries' utility in attack trees

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