Sciweavers

111 search results - page 2 / 23
» Minimum-cost network hardening using attack graphs
Sort
View
CCS
2007
ACM
13 years 11 months ago
Toward measuring network security using attack graphs
In measuring the overall security of a network, a crucial issue is to correctly compose the measure of individual components. Incorrect compositions may lead to misleading results...
Lingyu Wang, Anoop Singhal, Sushil Jajodia
IC
2003
13 years 6 months ago
Denying Denial-of-Service Attacks: A Router Based Solution
Distributed Denial-of-Service (DDoS) attacks prevent users from accessing services on the target network by flooding the target network with a large volume of traffic. In this pap...
Zhang Shu, Partha Dasgupta
ADHOC
2007
115views more  ADHOC 2007»
13 years 5 months ago
Modeling adaptive node capture attacks in multi-hop wireless networks
We investigate the problem of modeling node capture attacks in heterogeneous wireless ad hoc and mesh networks. Classical adversarial models such as the Dolev–Yao model are know...
Patrick Tague, Radha Poovendran
DIMVA
2011
12 years 8 months ago
Code Pointer Masking: Hardening Applications against Code Injection Attacks
In this paper we present an efficient countermeasure against code injection attacks. Our countermeasure does not rely on secret values such as stack canaries and protects against a...
Pieter Philippaerts, Yves Younan, Stijn Muylle, Fr...
NDSS
2009
IEEE
13 years 11 months ago
Analyzing and Comparing the Protection Quality of Security Enhanced Operating Systems
Host compromise is a serious computer security problem today. To better protect hosts, several Mandatory Access Control systems, such as Security Enhanced Linux (SELinux) and AppA...
Hong Chen, Ninghui Li, Ziqing Mao