Abstract
This commit is contained in:
parent
d846ac644b
commit
e2c2bf4d05
@ -185,9 +185,7 @@
|
||||
%
|
||||
% Place the text of the abstract here
|
||||
%
|
||||
In order to prepare a perfect thesis or dissertation, we do hereby
|
||||
follow these illustrious instructions to the
|
||||
letter.
|
||||
Attack graphs have historically been used to represent the state of a system or set of systems, and illustrate ways that attackers can carry out exploits to put the systems in a critical position. By refining the information and format of Attack Graphs, a similar process can be applied for compliance and regulation representations to illustrate ways that systems may violate or fall out of compliance in a format called compliance graphs. Like attack graphs, compliance graphs also suffer from the state space explosion problem, and generated graphs quickly become very large even for small networks. This work introduces extensions to an attack graph generator, RAGE, to support compliance graph generation, and these extensions have led to successfully generating compliance graphs that can then be analyzed through an independent process. Additional extensions have been introduced to support the utility of RAGE, and also implements a synchronous firing feature to prevent generation of states where assets deviate from a shared, inseparable feature such as time. The attack graph generation algorithm has also been modified in different two approaches to expand the generation process to function for distributed computing environments using Message Passing Interface (MPI).
|
||||
|
||||
\acknowledgementsp
|
||||
%
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user