Sciweavers

111 search results - page 17 / 23
» Minimum-cost network hardening using attack graphs
Sort
View
CN
2007
133views more  CN 2007»
13 years 7 months ago
Automatic high-performance reconstruction and recovery
Self-protecting systems require the ability to instantaneously detect malicious activity at run-time and prevent execution. We argue that it is impossible to perfectly self-protec...
Ashvin Goel, Wu-chang Feng, Wu-chi Feng, David Mai...
CCS
2007
ACM
14 years 2 months ago
Non-intrusive IP traceback for DDoS attacks
The paper describes a Non-Intrusive IP traceback scheme which uses sampled traffic under non-attack conditions to build and maintains caches of the valid source addresses transiti...
Vrizlynn L. L. Thing, Morris Sloman, Naranker Dula...
ACSAC
2005
IEEE
14 years 1 months ago
Building Evidence Graphs for Network Forensics Analysis
In this paper, we present techniques for a network forensics analysis mechanism that includes effective evidence presentation, manipulation and automated reasoning. We propose the...
Wei Wang, Thomas E. Daniels
ICITS
2011
12 years 11 months ago
Homogeneous Faults, Colored Edge Graphs, and Cover Free Families
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements...
Yongge Wang, Yvo Desmedt
CISC
2009
Springer
148views Cryptology» more  CISC 2009»
13 years 5 months ago
Using Strategy Objectives for Network Security Analysis
The anticipation game framework is an extension of attack graphs based on game theory. It is used to anticipate and analyze intruder and administrator concurrent interactions with ...
Elie Bursztein, John C. Mitchell