111 search results - page 7 / 23 » Minimum-cost network hardening using attack graphs |
HIS
2009
13 years 6 months ago
2009
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
IJNGC
2010
13 years 3 months ago
2010
LCN
2007
IEEE
14 years 3 months ago
2007
IEEE
Abstract— Black Hole Attacks are a serious threat to communication in tactical MANETs. In this work we present TOGBAD a new centralised approach, using topology graphs to identif...
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
ACSAC
2006
IEEE
14 years 3 months ago
2006
IEEE
Attack graphs are a valuable tool to network defenders, illustrating paths an attacker can use to gain access to a targeted network. Defenders can then focus their efforts on patc...