
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
In this paper, a greedy algorithm is proposed, to find optimal set of
countermeasures that
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.
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment