Be the first to like this
In this paper, a greedy algorithm is proposed, to find optimal set of
minimizes total cost of Security Investment subject to constraint
that it covers entire set of attack events.
This algorithm makes use of Birnbaum’s
Structural Importance Measure to find compute criticality of basic attack events in
achieving the goal. It helps in prioritizing the countermeasures covering the attack events.