Pairwise Key Establishment Research Articles

A Matrix-Based Pair-Wise Key Establishment for Secure and Energy Efficient WSN-Assisted IoT

The Internet of Things (IoT) is getting the reputation as one of the most optimistic networking paradigms that is reducing the gap between the cyber world and physical world. Most of the participating nodes in IoT network are sensors, which are limited in terms of resource such as energy, computation power, memory and so on. In IoT network, nodes communicate with each other via wireless medium, which makes the IoT network vulnerable to many security threats including eavesdropping. The IoT network is deployed in a large area and work on 24/7 hours, so an energy efficient scheme is one of the major issues in IoT. To achieve secure and energy efficient network, this article contributes: (1) A hierarchical topology for IoT network deployment; (2) symmetric matrix-based pair-wise key generation for secure communication; (3) A secure and energy efficient secure routing algorithm for the proposed model.

Balancing Trade-off between Data Security and Energy Model for Wireless Sensor Network

<p>An extensive effort to evolve various routing protocol to ensure optimal data delivery in energy efficient way is beneficial only if there is additional means of security process is synchronized. However, the security process consideration introduces additional overhead thus a security mechanism is needed to accomplish an optimal trade-off that exists in-between security as well as resource utilization especially energy. The prime purpose of this paper is to develop a process of security in the context of wireless sensor networks (WSN) by introducing two types of sensor node deployed with different capabilities. The proposed algorithm Novel Model of Secure Paradigm (N-MSP) which is further integrated with WSN. However, this algorithm uses a Hash-based Message Authentication Code (HMAC) authentication followed by pairwise key establishment during data aggregation process in a WSN. The extensive simulation carried out in a numerical platform called MATLAB that depicts that the proposed N-MSP achieves optimal processing time along with energy efficient pairwise key establishment during data aggregation process</p>

Towards Smart Healthcare: Patient Data Privacy and Security in Sensor‐Cloud Infrastructure

Nowadays, wireless body area networks (WBANs) systems have adopted cloud computing (CC) technology to overcome limitations such as power, storage, scalability, management, and computing. This amalgamation of WBANs systems and CC technology, as sensor‐cloud infrastructure (S‐CI), is aiding the healthcare domain through real‐time monitoring of patients and the early diagnosis of diseases. Hence, the distributed environment of S‐CI presents new threats to patient data privacy and security. In this paper, we review the techniques for patient data privacy and security in S‐CI. Existing techniques are classified as multibiometric key generation, pairwise key establishment, hash function, attribute‐based encryption, chaotic maps, hybrid encryption, Number Theory Research Unit, Tri‐Mode Algorithm, Dynamic Probability Packet Marking, and Priority‐Based Data Forwarding techniques, according to their application areas. Their pros and cons are presented in chronological order. We also provide our six‐step generic framework for patient physiological parameters (PPPs) privacy and security in S‐CI: (1) selecting the preliminaries; (2) selecting the system entities; (3) selecting the technique; (4) accessing PPPs; (5) analysing the security; and (6) estimating performance. Meanwhile, we identify and discuss PPPs utilized as datasets and provide the performance evolution of this research area. Finally, we conclude with the open challenges and future directions for this flourishing research area.

False data detection and dynamic selection of aggregator nodes with pair-wise key establishment in homogeneous wireless sensor networks

Compromised sensor nodes inject false data in wireless sensor networks which distorts data integrity and consumes battery power unnecessarily. In the existing false data detection schemes, the aggregator nodes suffer from rapid battery drain due to the computational overhead, leading to reduced network lifetime. To avoid this, the aggregator nodes must be dynamically selected from the sensor nodes in the network. This dynamic selection of aggregator nodes introduces security challenges in symmetric key exchange among the sensor nodes. In this paper, a scheme called, false data detection-dynamic selection of aggregator nodes is proposed to address these issues. This scheme discards the false data injected into the network and also prolongs the network lifetime by the dynamic selection of aggregator nodes. The problem of symmetric key exchange arising due to the dynamic selection of aggregator nodes is resolved by the proposed Chebyshev polynomial-based pair-wise key establishment which has lesser computational overhead and offers better security strength. Simulation results indicate that the scheme eliminates false data injected by multiple compromised nodes and also offers higher network lifetime in homogeneous wireless sensor networks.

False data detection and dynamic selection of aggregator nodes with pair-wise key establishment in homogeneous wireless sensor networks

Compromised sensor nodes inject false data in wireless sensor networks which distorts data integrity and consumes battery power unnecessarily. In the existing false data detection schemes, the aggregator nodes suffer from rapid battery drain due to the computational overhead, leading to reduced network lifetime. To avoid this, the aggregator nodes must be dynamically selected from the sensor nodes in the network. This dynamic selection of aggregator nodes introduces security challenges in symmetric key exchange among the sensor nodes. In this paper, a scheme called, false data detection-dynamic selection of aggregator nodes is proposed to address these issues. This scheme discards the false data injected into the network and also prolongs the network lifetime by the dynamic selection of aggregator nodes. The problem of symmetric key exchange arising due to the dynamic selection of aggregator nodes is resolved by the proposed Chebyshev polynomial-based pair-wise key establishment which has lesser computational overhead and offers better security strength. Simulation results indicate that the scheme eliminates false data injected by multiple compromised nodes and also offers higher network lifetime in homogeneous wireless sensor networks.

Hypercube Bivariate-Based Key Management for Wireless Sensor Networks

Wireless sensor networks are composed of very small devices, called sensor nodes,for numerous applications in the environment. In adversarial environments, the securitybecomes a crucial issue in wireless sensor networks (WSNs). There are various securityservices in WSNs such as key management, authentication, and pairwise keyestablishment. Due to some limitations on sensor nodes, the previous key establishmenttechniques are unsuitable for WSNs. To overcome these problems, researchers proposeseveral key pre-distribution schemes. Our proposed approach uses a combinatorialframework in the hypercube-based (HB) scheme to pre-distribute keys to each sensornode. By this way, the number of common keys between two nodes in a wirelesscommunication range increases. Therefore, the level of security in terms of resilienceagainst node capture attack and the probability of re-establishing an indirect key will beimproved.

Polynomial and multivariate mapping-based triple-key approach for secure key distribution in wireless sensor networks

Distribution of cryptographic key plays a vital role to improve the security and integrity in Wireless Sensor Networks (WSN). Due to high resilience to the attacks, the pairwise key distribution schemes are highly preferred than other schemes. However, due to the resource constraints on the nodes and the threat of node capture, pairwise key establishment in the sensor networks is a challenging task. The security performance of these schemes decreases with the increase in the number of compromised nodes. To overcome these issues, a Polynomial and Multivariate Mapping-Based Triple-Key (PMMTK) distribution approach is proposed in this paper. It involves calculation of individual key of the nodes and common triple-key. Our proposed method achieves higher data freshness, throughput, average number of clusters, overall network lifetime, network connectivity, better packet delivery ratio and lower end-to-end delay, average number of key establishment and total authentication overhead.

Secure device-to-device communications over WiFi direct

D2D communications facilitate proximal devices to directly communicate with each other, bypassing cellular base stations or access points, and bring many benefits such as improvement in both spectral efficiency and energy efficiency. Among existing D2D enabling techniques, the recently released WiFi Direct is one promising protocol that offers high data rate D2D communications in local areas. However, WiFi Direct is susceptible to security threats due to the open access of wireless channels and lack of security infrastructures. In this article, we identify several attacks that challenge WiFi-Direct-based D2D communications. Since pairwise key establishment lies in the area of securing D2D communications, we introduce a short authentication-string-based key agreement protocol and analyze its security performance. We also integrate the SAS-based key agreement protocol into the existing WiFi Direct protocol, and implement it using Android smartphones.

An Empirical Study on Key Management Schemes of Wireless Sensor Network

The ample use of Wireless Sensor Network demands highly effective security mechanism for its sound operation in any hostile environment. The security of encrypted information greatly dependents on the rigidity of underlying Key Management techniques. Hence, key management becomes the most significant issue in case of security of Wireless Sensor Networks. The purpose of this paper is to assess most significant key management schemes of wireless sensor networks e.g. single network-wide key scheme, pairwise key establishment scheme, random key pre-distribution and Qcomposite random key pre-distribution scheme. The overall analysis is performed based on a number of criteria such as: loaded key utilization, resource consumption and rigidity against node capture. Besides, to identify the best one, a result based comparison among the schemes is also presented.

A Combinational Approach Using Matrix Based Pairwise Key Establishment and Post Deployment Approach in Wireless Sensor Networks

A Combinational Approach Using Matrix Based Pairwise Key Establishment and Post Deployment Approach in Wireless Sensor Networks

A lightweight key management scheme for wireless sensor networks

The use of wireless sensor networks (WSNs) in any real-world application requires a certain level of security. To provide security of operations such as message exchange, key management schemes have to be well adapted to the particularities of WSNs. This paper proposes a novel key management scheme called SKM for sequence-based key management in WSNs. In SKM, sensor nodes are pre-distributed with the first term and the recursive formula of a numerical sequence. This two tiny pre-distributed information will ensure the establishment of pairwise keys to each sensor node with its neighbors after its deployment with a small amount of computation. The security analysis of SKM shows its efficiency. Simulation results confirm that SKM is lightweight in term of node's resources and has a good resilience against node compromising attacks compared to the main existing schemes.

A Key Distribution Scheme for WSN Based on Hash Chains and Deployment Knowledge

Based on the deployment knowledge and the irreversibility of some hash chains, a novel pairwise key distribution scheme (DKH-KD) for wireless sensor networks is proposed. In DKH-KD scheme, before the nodes in the network are deployed, the offline server constructs a number of hash chains and uses the values from a pair of reverse hash chains to establish their pairwise keys among the nodes in the same region, while, among the neighbor nodes in the different regions, some pairs of the hash chains based on the deployment knowledge are employed to establish the pairwise keys. These procedures make the attackers hard to break the network and ensure that the probability of the pairwise key establishment is close to 1. Compared with the Dai scheme and the q-composite's scheme, our analyses show that DKH-KD scheme can improve the probability of the pairwise key establishment and the invulnerability more efficiently.

Efficient and Secure Hierarchical Key Management Scheme for Wireless Sensor Networks using QR Decomposition Scheme

Wireless Sensor Network (WSN) assures to revolutionize sensing in a spatially dispersed and dedicated manner in various applications. It requires adopting a security mechanism for critical applications. Though many cryptographic algorithms are available it strength depends upon the key used for encrypting and decrypting the collected data. Key Management Scheme (KMS), a technique for establishing and maintaining the key relation, play a vital role in any security mechanism. The proposed work was focused on pairwise key establishment using QR based matrix Decomposition method. Though many metrics are available the prime factor for any WSN is key connectivity. The proposed KMS focuses on 100% key connectivity compared to probabilistic approach. For each communications different symmetric matrices are generated and are decomposed into Q and R matrix. This scheme is implemented in LPC2148 with Xbee to check its feasibility in realtime applications. Performance analysis shows that the proposed method achieves 100% key connectivity, better resilience and scalability.Keywords: Key Connectivity, Key Management Scheme (KMS), Security, Wireless Sensor Network (WSN), QR Decomposition

Matrix-based key pre-distribution schemes in WMNs using pre and post deployment knowledge

Like other types of wireless networks, wireless communication in wireless mesh networks (WMNs) is vulnerable to many malicious activities. Thus it is a must to protect wireless transmission by proper security measures. As a fundamental security technology, symmetric key pre-distribution has been widely studied to ensure the security of wireless communication. This paper presents two matrix-based pairwise key establishment schemes for mesh clients. In our schemes, a mesh client only needs to pre-load an independent key seed which can be used to generate a column of secret matrix. It can establish pairwise keys with neighbour clients after mesh routers broadcast public matrices. Motivated by this heterogeneity (mesh routers are much more powerful than mesh clients, both in communication and storage), energy-consuming operations can be delegated to mesh routers to alleviate the overhead of mesh clients when they establish pairwise keys. By using pre and post deployment knowledge, neighbour mesh clients in our scheme can directly establish pairwise keys with a very light communication and storage cost.

A Key Distribution Scheme for WSN Based on Deployment Knowledge and Dual-Key Pools

By using deployment Knowledge and cellular model, a novel key distribution scheme based on deployment and dual-key pools is proposed for WSN. Each sub-key pool in the network contains two types of key pools: one doubled by the offline server is shared by three adjacent cells before the deployment and the other one distributed to each cell is non-overlapping. The server distributes four random numbers for each cell and ensures each adjacent cell sharing one random number. In order to improve the network security, nodes among the neighboring cells adopt a binary hash function and a corresponding random number to generate pair-wise keys. Compared with Du scheme and q-composite scheme, the simulation results show that our proposed scheme not only has efficiently improved the probability of pair-wise key establishment and invulnerability, but also has certain advantage on the nodes’ storage space.

False Data Elimination in Heterogeneous Wireless Sensor Networks Using Location-Based Selection of Aggregator Nodes

ABSTRACTThe false data injected by the compromised sensor nodes in heterogeneous wireless sensor networks are not only a threat to data integrity but also consume bandwidth and power unnecessarily. The existing mechanisms for eliminating the injected false data are carried out with a fixed set of aggregator nodes. This causes battery drain at the aggregator nodes, leading to reduced network lifetime. Hence, it is necessary to reduce the battery drain by changing the aggregator nodes at regular intervals. The periodic change of aggregator nodes introduces the problem of pair-wise key establishment among the sensor nodes. This paper aims at eliminating the injected false data in heterogeneous wireless sensor networks. It also addresses the issue of battery drain at the aggregator nodes by periodically selecting the aggregator nodes based on location, exploiting the heterogeneity of the sensor nodes in the network. The problem of pair-wise key establishment is resolved by using a suitably modified cryptographic scheme based on Jacobian elliptic Chebyshev rational map. This modification is due to the fact that the original scheme is easily breakable.

Pairwise and group key setup mechanism for secure machine-to-machine communication

In the ubiquitous environment, more and more devices are deployed in our daily life, and need to communicate with one another. M2M (Machine-to-Machine) communication is considered to be one of the major issues in future networks. M2M is expected to bring various benefits in wireless communications when it is interconnected with cellular networks. Considering the characteristics of cellular M2M networks, traditional security solutions are not proper to be applied to cellular M2M networks because the M2M network itself is vulnerable to various attacks. We consider security aspects for cellular M2M communications and propose a key management mechanism including the pairwise key and group key establishment. Our proposal could provide reliability and efficiency for the cellular M2M communication network in the secure manner.

A New Key Predistribution Scheme for Multiphase Sensor Networks Using a New Deployment Model

During the lifecycle of sensor networks, making use of the existing key predistribution schemes using deployment knowledge for pairwise key establishment and authentication between nodes, a new challenge is elevated. Either the resilience against node capture attacks or the global connectivity will significantly decrease with time. In this paper, a new deployment model is developed for multiphase deployment sensor networks, and then a new key management scheme is further proposed. Compared with the existing schemes using deployment knowledge, our scheme has better performance in global connectivity, resilience against node capture attacks throughout their lifecycle.

Matrix-based pairwise key establishment for wireless mesh networks

Wireless communication in wireless mesh networks (WMNs), like other types of wireless networks, is vulnerable to many malicious activities such as eavesdropping. As one of the fundamental security ...

A Matrix-Based Pairwise Key Establishment Scheme for Wireless Mesh Networks Using Pre Deployment Knowledge

Due to the nature of wireless transmission, communication in wireless mesh networks (WMNs) is vulnerable to many adversarial activities including eavesdropping. Pairwise key establishment is one of the fundamental issues in securing WMNs. This paper presents a new matrix based pairwise key establishment scheme. Mesh client in our scheme only needs to prestore a key seed, which can be used to generate a column of secret matrix. It can establish pairwise keys with other clients after mesh routers broadcast public matrices. Our scheme is motivated by the fact that in WMNs, mesh routers are more powerful than mesh clients, both in computation and communication. Besides, we employ the pre deployment knowledge to reduce the computational cost of mesh clients. Security and complexity analysis show that the new scheme possesses several desirable features: 1) neighbor mesh clients can directly establish pairwise keys; 2) the new scheme is updatable, scalable, and robust against node capture attacks; and 3) communication and storage costs at mesh clients are significantly reduced.