Todaypsilas serious attacks are complex, multi-stage scenarios and can involve bypassing multiple security mechanisms and the use of numerous computer systems. A host which has been controlled by an attacker can become a stepping stone for further intrusion and destruction. Providing attack graphs is one of the most direct and effective way to analyze interactions among network components and sequences of vulnerabilities. However, the findings obtained from an attack graph highly depend on the quality of modeling. In this paper, attack modeling based on Petri nets is extended and an approach based on hierarchical Colored Petri nets is provided. We will use Colored Petri nets to describe attacks in two levels, those being generally and specifically. These treatments can facilitate the understanding of network vulnerabilities further, and enhance effective protection measures.
[1]
James P. McDermott,et al.
Attack net penetration testing
,
2001,
NSPW '00.
[2]
Daniel Geer,et al.
Penetration testing: a duet
,
2002,
18th Annual Computer Security Applications Conference, 2002. Proceedings..
[3]
Richard P. Lippmann,et al.
An Annotated Review of Past Papers on Attack Graphs
,
2005
.
[4]
Kurt Jensen,et al.
Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Vol. 2, Analysis Methods
,
1992
.
[5]
Kurt Jensen,et al.
Coloured Petri Nets
,
1997,
Monographs in Theoretical Computer Science An EATCS Series.
[6]
Stefan Axelsson,et al.
Intrusion Detection Systems: A Survey and Taxonomy
,
2002
.