111 search results - page 9 / 23 » Minimum-cost network hardening using attack graphs |
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
VIZSEC
2007
Springer
14 years 3 months ago
2007
Springer
Abstract Attack graphs for large enterprise networks improve security by revealing critical paths used by adversaries to capture network assets. Even with simplification, current a...
ISW
2007
Springer
14 years 3 months ago
2007
Springer
In this paper, we study the performance of timeout-based queue management practices in the context of flood denial-of-service (DoS) attacks on connection-oriented protocols, where...
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
— Most existing work uses dual decomposition and subgradient methods to solve network optimization problems in a distributed manner, which suffer from slow convergence rate prope...
CCS
2006
ACM
14 years 24 days ago
2006
ACM
In this paper, we position the correct way of using graphical models for enhancing cyber security analysis in enterprise networks. Graphical models can be powerful in representati...