Authenticated Multiple Key Establishment Protocol for Wireless Sensor Networks

The article proposes a provably secure authenticated multiple key establishment protocol for Wireless Sensor Network. Security of the protocol is based on the computational infeasiblity of solving Elliptic Curve Discrete Logarithm Problem and Computational Diffie-Hellman Problem on Bilinear Pairing. User authentication is a one of the most challenging security requirement in wireless sensor networks (WSN). It is required to establish the correct session key between two adjacent nodes of WSNs to achieve this security goal. Here we prove that, the proposed protocol is secure against the attack on data integrity and known key security attack on session key. It also provides perfect forward secrecy

A formally verified decentralized key management architecture for wireless sensor networks

We present a decentralized key management architecture for wireless sensor networks, covering the aspects of key deployment, key refreshment and key establishment. Our architecture is based on a clear set of assumptions and guidelines. Balance between security and energy consumption is achieved by partitioning a system into two interoperable security realms: the supervised realm trades off simplicity and resources for higher security whereas in the unsupervised realm the vice versa is true. Key deployment uses minimal key storage while key refreshment is based on the well-studied scheme of Abdalla et al. The keying protocols involved use only symmetric cryptography and have all been verified with our constraint solving-based protocol verification tool CoProVe

How not to secure wireless sensor networks revisited: Even if you say it twice it's still not secure

Two recent papers describe almost exactly the same group key establishment protocol for wireless sensor networks. Quite part from the duplication issue, we show that both protocols are insecure and should not be used - a member of a group can successfully impersonate the key generation centre and persuade any other group member to accept the wrong key value. This breaks the stated objectives of the schemes.Comment: Minor typos fixe

SECURITY IN WIRELESS SENSOR NETWORKS USING ASSYMETRIC KEY BASED TECHNIQUES

Wireless sensor networks (WSNs) have recently attracted a lot of interest in the research community due their wide range of applications in our lives ranging from military applications to civilian ones.. 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. In this current paper, we fundamentally focus on the security issue of WSNs and propose a protocol based on public key cryptography for external agent authentication and session key establishment. The proposed protocol is efficient and secure in compared to other public key based protocols in WSNs

Implementation of an On-Demand Routing Protocol for Wireless Sensor Networks

We present our experiences in implementing and validating the on-demand EYES Source Routing protocol (ESR) in a real wireless sensor network (WSN) environment. ESR has a fast recovery mechanism relying on MAC layer feedback to overcome frequent network topology changes resulting from node mobility and unreliability. A geographically restricted directional flooding scheme reduces energy consumption in the route re-establishment. ESR is implemented in our WSN environment consisting of EYES sensor node prototypes using the Lightweight Medium Access Control protocol (LMAC) on top of the AmbientRT operating system. We describe the key design and implementation features of our protocol and report experiment results of ESR and Ad hoc On-demand Distance Vector protocol (AODV), a conventional routing protocol for ad hoc networks

LMGROUP: A Lightweight Multicast Group Key Management for IoT Networks

Due to limitations of IoT networks including limited bandwidth, memory, battery, etc., secure multicast group communication has gained more attention, and to enable that a group key establishment scheme is required to share the secret key among the group members. The current group key establishment protocols were mostly designed for Wireless Sensor Network, and they require device interaction, high computation costs, or high storage on the device side. To address these drawbacks, in this paper we design LMGROUP, a lightweight and multicast group key establishment protocol for IoT networks, that is based on Elliptic Curve Integrated Encryption Scheme and HMAC verification and does not require device interaction. We also suggest an algorithm for unpredictable group member selection. Our experimental result of implementing LMGROUP indicates it has low storage, low computation, and low communication costs. Furthermore, the formal security verification indicates LMGROUP is secure and robust against different attacks

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