Sciweavers

2304 search results - page 68 / 461
» On the Vulnerability of Large Graphs
Sort
View
ACSAC
2003
IEEE
15 years 5 months ago
Efficient Minimum-Cost Network Hardening Via Exploit Dependency Graphs
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
Steven Noel, Sushil Jajodia, Brian O'Berry, Michae...
DBSEC
2009
122views Database» more  DBSEC 2009»
15 years 28 days ago
An Approach to Security Policy Configuration Using Semantic Threat Graphs
Managing the configuration of heterogeneous enterprise security mechanisms is a wholly complex task. The effectiveness of a configuration may be constrained by poor understanding a...
Simon N. Foley, William M. Fitzgerald
ICDE
2003
IEEE
129views Database» more  ICDE 2003»
16 years 1 months ago
Representing Web Graphs
A Web repository is a large special-purpose collection of Web pages and associated indexes. Many useful queries and computations over such repositories involve traversal and navig...
Sriram Raghavan, Hector Garcia-Molina
ESORICS
2004
Springer
15 years 5 months ago
ARCHERR: Runtime Environment Driven Program Safety
Parameters of a program’s runtime environment such as the machine architecture and operating system largely determine whether a vulnerability can be exploited. For example, the m...
Ramkumar Chinchani, Anusha Iyer, Bharat Jayaraman,...
CCS
2003
ACM
15 years 5 months ago
Anomaly detection of web-based attacks
Web-based vulnerabilities represent a substantial portion of the security exposures of computer networks. In order to detect known web-based attacks, misuse detection systems are ...
Christopher Krügel, Giovanni Vigna