Sciweavers

110 search results - page 5 / 22
» Building Evidence Graphs for Network Forensics Analysis
Sort
View
CCS
2003
ACM
14 years 20 days ago
Learning attack strategies from intrusion alerts
Understanding the strategies of attacks is crucial for security applications such as computer and network forensics, intrusion response, and prevention of future attacks. This pap...
Peng Ning, Dingbang Xu
UAI
2004
13 years 8 months ago
Evidence-invariant Sensitivity Bounds
The sensitivities revealed by a sensitivity analysis of a probabilistic network typically depend on the entered evidence. For a real-life network therefore, the analysis is perfor...
Silja Renooij, Linda C. van der Gaag
ACSAC
2004
IEEE
13 years 11 months ago
Correlating Intrusion Events and Building Attack Scenarios Through Attack Graph Distances
We map intrusion events to known exploits in the network attack graph, and correlate the events through the corresponding attack graph distances. From this, we construct attack sc...
Steven Noel, Eric Robertson, Sushil Jajodia
TIFS
2010
127views more  TIFS 2010»
13 years 5 months ago
Audio authenticity: detecting ENF discontinuity with high precision phase analysis
—This paper addresses a forensic tool used to assess audio authenticity. The proposed method is based on detecting phase discontinuity of the power grid signal; this signal, refe...
Daniel Patricio Nicolalde Rodríguez, Jos&ea...
CCS
2005
ACM
14 years 27 days ago
Fast and automated generation of attack signatures: a basis for building self-protecting servers
Large-scale attacks, such as those launched by worms and zombie farms, pose a serious threat to our network-centric society. Existing approaches such as software patches are simpl...
Zhenkai Liang, R. Sekar