Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Computing Partitions with Applications to the Knapsack Problem
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
SPINS: security protocols for sensor networks
Wireless Networks
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Resilient aggregation in sensor networks
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Sensor Networks for Emergency Response: Challenges and Opportunities
IEEE Pervasive Computing
Distributed Detection of Node Replication Attacks in Sensor Networks
SP '05 Proceedings of the 2005 IEEE Symposium on Security and Privacy
Deploying a Wireless Sensor Network on an Active Volcano
IEEE Internet Computing
VigilNet: An integrated sensor network system for energy-efficient surveillance
ACM Transactions on Sensor Networks (TOSN)
Secure hierarchical in-network aggregation in sensor networks
Proceedings of the 13th ACM conference on Computer and communications security
Efficient and Robust Secure Aggregation for Sensor Networks
NPSEC '07 Proceedings of the 2007 3rd IEEE Workshop on Secure Network Protocols
A proactive data security framework for mission-critical sensor networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
On the security of cluster-based communication protocols for wireless sensor networks
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
Resilient data aggregation for unattended WSNs
LCN '11 Proceedings of the 2011 IEEE 36th Conference on Local Computer Networks
| Hi-index | 0.00 |
Security is important for mission-critical wireless sensor networks (WSNs). This is especially so because powerful adversaries could compromise and control a significant fraction of the network nodes. A plethora of schemes has been developed to secure wireless sensor networks and resilience to sophisticated attacks has been analyzed. However, the question of how the adversary could deploy her resources to maximally affect the attacked system has remained largely unaddressed. This is the problem this paper is concerned with: Given a number of compromised entities (nodes) and cryptographic keys, how can the adversary devise a close-to-optimal attack tactic? To the best of our knowledge, this is the first investigation of its kind: while the basic adversarial behavior is well-known, the problem of how the adversary can optimally deploy her resources to maximize the attack impact has not been considered for WSNs. We consider an abstract model of the mission-critical WSN and the adversary, and we find that the determination of an optimal attack is computationally hard, thus, we devise an efficient heuristic approach. An intelligent adversarial resource allocation indeed yields disproportional gains for the attacker. Our analysis is the first necessary step to comprehend how to best address vulnerabilities.