Sciweavers

92 search results - page 2 / 19
» Minimizing Expected Attacking Cost in Networks
Sort
View
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
IPL
2008
72views more  IPL 2008»
13 years 5 months ago
Reducing communication costs in robust peer-to-peer networks
Several recent research results describe how to design Distributed Hash Tables (DHTs) that are robust to adversarial attack via Byzantine faults. Unfortunately, all of these resul...
Jared Saia, Maxwell Young
ICDCSW
2005
IEEE
13 years 11 months ago
Increasing Attack Resiliency of Wireless Ad Hoc and Sensor Networks
An ad hoc or sensor network that is employed for security sensitive applications is expected to tolerate a certain quantity of maliciously behaving nodes. Algorithms must be desig...
Harald Vogt
CCS
2007
ACM
13 years 11 months ago
Optimal security hardening using multi-objective optimization on attack tree models of networks
Researchers have previously looked into the problem of determining if a given set of security hardening measures can effectively make a networked system secure. Many of them also...
Rinku Dewri, Nayot Poolsappasit, Indrajit Ray, Dar...
CCE
2007
13 years 5 months ago
Water networks security: A two-stage mixed-integer stochastic program for sensor placement under uncertainty
This work describes a stochastic approach for the optimal placement of sensors in municipal water networks to detect maliciously injected contaminants. The model minimizes the exp...
Vicente Rico-Ramírez, Sergio Frausto-Hern&a...