111 search results - page 11 / 23 » Minimum-cost network hardening using attack graphs |
163
click to vote
ICICS
2009
Springer
15 years 10 months ago
2009
Springer
We propose a novel approach for statistical risk modeling of network attacks that lets an operator perform risk analysis using a data model and an impact model on top of an attack ...
144
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract—We propose a novel algorithm for detecting wormhole attacks in wireless multi-hop networks. The algorithm uses only connectivity information to look for forbidden substr...
160
click to vote
GAMESEC
2010
15 years 2 months ago
2010
We study the strategic interaction between a network manager whose goal is to choose (as communication infrastructure) a spanning tree of a network given as an undirected graph, an...
129
click to vote
SIGMOD
2010
ACM
15 years 9 months ago
2010
ACM
Serious concerns on privacy protection in social networks have been raised in recent years; however, research in this area is still in its infancy. The problem is challenging due ...
122
click to vote
NDSS
2006
IEEE
15 years 10 months ago
2006
IEEE
Enterprise networks today carry a range of mission critical communications. A successful worm attack within an enterprise network can be substantially more devastating to most com...