The Information Battlespace preparation experiment

Moore, Ronald A.; Kewley, D.L.; Parks, Raymond C.; Tinnel, Laura

doi:10.1109/discex.2001.932230

Cited by 3 publications

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to [9] attack trees can be us as a checklist to help analysts detect attacks and train novice analysts. and the generated attack trees can be stored in a repository and later reused as a productivity aid [9].…”

Section: Proceedings Of the 2006 Ieee Workhop On Information Assurancementioning

confidence: 99%

Analyzing Attack Trees using Generalized Stochastic Petri Nets

Dalton

Mills

Colombi

et al.

2006 IEEE Information Assurance Workshop

View full text Add to dashboard Cite

In recent years, attack trees have been developed to describe processes by which malicious users attempt to exploit or break computer software and/or networks. Attack trees are a way of decomposing, visualizing, and determining the cost or likeliness of attacks. Similarly, Petri Nets (PNs) are graphical representations of a system or process used for modeling, formal analysis, and design verification. PNs are easy to build and simulate using a myriad of available tools. There are a number of subclasses of PNs, including Colored, Timed, Stochastic, etc. This paper focuses on the use of Generalized Stochastic PNs (GSPNs) to model and analyze Attack Trees with the ultimate goal of automating the analysis using simulation tools.The results of this simulation and analysis can be used to further refine the Attack Tree or to develop countermeasures.

show abstract

Section: Proceedings Of the 2006 Ieee Workhop On Information Assurancementioning

confidence: 99%