Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Upper Bounds for Adversaries’ Utility in Attack Trees

From MaRDI portal
Publication:4909433
Jump to:navigation, search

DOI10.1007/978-3-642-34266-0_6zbMath1284.91086OpenAlexW126865974WikidataQ62048360 ScholiaQ62048360MaRDI QIDQ4909433

Roman Stepanenko, Ahto Buldas

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)


Related Items

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



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4909433&oldid=19301104"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 07:19.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki