680 research outputs found
A Survey on Wireless Sensor Network Security
Wireless sensor networks (WSNs) have recently attracted a lot of interest in
the research community due their wide range of applications. Due to distributed
nature of these networks and their deployment in remote areas, these networks
are vulnerable to numerous security threats that can adversely affect their
proper functioning. This problem is more critical if the network is deployed
for some mission-critical applications such as in a tactical battlefield.
Random failure of nodes is also very likely in real-life deployment scenarios.
Due to resource constraints in the sensor nodes, traditional security
mechanisms with large overhead of computation and communication are infeasible
in WSNs. Security in sensor networks is, therefore, a particularly challenging
task. This paper discusses the current state of the art in security mechanisms
for WSNs. Various types of attacks are discussed and their countermeasures
presented. A brief discussion on the future direction of research in WSN
security is also included.Comment: 24 pages, 4 figures, 2 table
An Identity Based Key Management Scheme in Wireless Sensor Networks
Pairwise key establishment is one of the fundamental security services in
sensor networks which enables sensor nodes in a sensor network to communicate
securely with each other using cryptographic techniques. It is not feasible to
apply traditional public key management techniques in resource-constrained
sensor nodes, and also because the sensor nodes are vulnerable to physical
capture. In this paper, we introduce a new scheme called the identity based key
pre-distribution using a pseudo random function (IBPRF), which has better
trade-off between communication overhead, network connectivity and resilience
against node capture compared to the other key pre-distribution schemes. Our
scheme can be easily adapted in mobile sensor networks. This scheme supports
the addition of new sensor nodes after the initial deployment and also works
for any deployment topology. In addition, we propose an improved version of our
scheme to support large sensor networks.Comment: 7 pages, Published in Proceedings of 4th Asian International Mobile
Computing Conference (AMOC 2006), Kolkata, India, pp. 70-76, January 4-7,
200
A Key Establishment Scheme for Mobile Wireless Sensor Networks Using Post-Deployment Knowledge
Establishment of pairwise keys between sensor nodes in a sensor network is a
difficult problem due to resource limitations of sensor nodes as well as
vulnerability to physical captures of sensor nodes by the enemy. Public-key
cryptosystems are not much suited for most resource-constrained sensor
networks. Recently, elliptic curve cryptographic techniques show that public
key cryptosystem is also feasible for resource-constrained sensor networks.
However, most researchers accept that the symmetric key cryptosystems are
viable options for resource-constrained sensor networks. In this paper, we
first develop a basic principle to address the key pre-distribution problem in
mobile sensor networks. Then, using this developed basic principle, we propose
a scheme which takes the advantage of the post-deployment knowledge. Our scheme
is a modified version of the key prioritization technique proposed by Liu and
Ning. Our improved scheme provides reasonable network connectivity and
security. Moreover, the proposed scheme works for any deployment topology.Comment: Published in International Journal of Computer Networks &
Communications (IJCNC) Vol.3, No.4, July 201
Key Management Building Blocks for Wireless Sensor Networks
Cryptography is the means to ensure data confidentiality, integrity and authentication in wireless sensor networks (WSNs). To use cryptography effectively however, the cryptographic keys need to be managed properly. First of all, the necessary keys need to be distributed to the nodes before the nodes are deployed in the field, in such a way that any two or more nodes that need to communicate securely can establish a session key. Then, the session keys need to be refreshed from time to time to prevent birthday attacks. Finally, in case any of the nodes is found to be compromised, the key ring of the compromised node needs to be revoked and some or all of the compromised keys might need to be replaced. These processes, together with the policies and techniques needed to support them, are called key management. The facts that WSNs (1) are generally not tamper-resistant; (2) operate unattended; (3) communicate in an open medium; (4) have no fixed infrastructure and pre-configured topology; (5) have severe hardware and resource constraints, present unique challenges to key management. In this article, we explore techniques for meeting these challenges. What distinguishes our approach from a routine literature survey is that, instead of comparing various known schemes, we set out to identify the basic cryptographic principles, or building blocks that will allow practitioners to set up their own key management framework using these building blocks
Hierarchical Grid-Based Pairwise Key Pre-distribution in Wireless Sensor Networks
The security of wireless sensor networks is an active topic of research where
both symmetric and asymmetric key cryptography issues have been studied. Due to
their computational feasibility on typical sensor nodes, symmetric key
algorithms that use the same key to encrypt and decrypt messages have been
intensively studied and perfectly deployed in such environment. Because of the
wireless sensor's limited infrastructure, the bottleneck challenge for
deploying these algorithms is the key distribution. For the same reason of
resources restriction, key distribution mechanisms which are used in
traditional wireless networks are not efficient for sensor networks.
To overcome the key distribution problem, several key pre-distribution
algorithms and techniques that assign keys or keying material for the networks
nodes in an offline phase have been introduced recently. In this paper, we
introduce a supplemental distribution technique based on the communication
pattern and deployment knowledge modeling. Our technique is based on the
hierarchical grid deployment. For granting a proportional security level with
number of dependent sensors, we use different polynomials in different orders
with different weights. In seek of our proposed work's value, we provide a
detailed analysis on the used resources, resulting security, resiliency, and
connectivity compared with other related works.Comment: 13 pages, 9 figures, 2 tables, to appear in the International Journal
of Networks and Securit
Efficient And Secure Key Distribution Protocol For Wireless Sensor Networks
Modern wireless sensor networks have adopted the IEEE 802.15.4 standard. This standard defines the first two layers, the physical and medium access control layers; determines the radio wave used for communication, and defines the 128-bit advanced encryption standard (AES-128) for encrypting and validating transmitted data. However, the standard does not specify how to manage, store, or distribute encryption keys. Many solutions have been proposed to address this problem, but the majority are impractical in resource-constrained devices such as wireless sensor nodes or cause degradation of other metrics. Therefore, we propose an efficient and secure key distribution protocol that is simple, practical, and feasible to implement on resource-constrained wireless sensor nodes. We conduct simulations and hardware implementations to analyze our work and compare it to existing solutions based on different metrics, such as energy consumption, storage overhead, key connectivity, replay attack, man-in-the-middle attack, and resiliency to node capture attack. Our findings show that the proposed protocol is secure and more efficient than other solutions
TKP: Three level key pre-distribution with mobile sinks for wireless sensor networks
Wireless Sensor Networks are by its nature prone to various forms of security attacks. Authentication and secure communication have become the need of the day. Due to single point failure of a sink node or base station, mobile sinks are better in many wireless sensor networks applications for efficient data collection or aggregation, localized sensor reprogramming and for revoking compromised sensors. The existing sytems that make use of key predistribution schemes for pairwise key establishment between sensor nodes and mobile sinks, deploying mobile sinks for data collection has drawbacks. Here, an attacker can easily obtain many keys by capturing a few nodes and can gain control of the network by deploying a node preloaded with some compromised keys that will be the replica of compromised mobile sink. We propose an efficient three level key predistribution framework that uses any pairwise key predistribution in different levels. The new framework has two set of key pools one set of keys for the mobile sink nodes to access the sensor network and other set of keys for secure communication among the sensor nodes. It reduces the damage caused by mobile sink replication attack and stationary access node replication attack. To further reduce the communication time it uses a shortest distance to make pair between the nodes for comunication. Through results, we show that our security framework has a higher network resilience to a mobile sink replication attack as compared to the polynomial pool-based scheme with less communication tim
- …