Upper bounds for adversaries' utility in attack trees

DOI10.1007/978-3-642-34266-0_6zbMATH Open1284.91086OpenAlexW126865974WikidataQ62048360 ScholiaQ62048360MaRDI QIDQ4909433FDOQ4909433

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

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

Mathematics Subject Classification ID

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

Cited In (8)

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

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)