Lightweight Key Management for Adaptive Addressing in Next Generation Internet

2021 ◽  
pp. 1890-1914
Author(s):  
Vinod Vijaykumar Kimbahune ◽  
Arvind V. Deshpande ◽  
Parikshit Narendra Mahalle
Keyword(s):  
Sensor Networks ◽  
Key Management ◽  
Secure Communication ◽  
Resource Constraints ◽  
Sensor Nodes ◽  
Security Requirements ◽  
Next Generation ◽  
Secret Key ◽  
Next Generation Internet ◽  
Node Capture

The continuous evolution of Next Generation Internet (NGI) amplifies the demand for efficient and secure communication capable of responding effectively to the challenges posed by the emerging applications. For secure communication between two sensor nodes, a secret key is needed. Cryptographic key management is a challenging task in sensor networks as the hostile environment of sensor networks makes it more prone to attacks. Apart from resource constraints of the devices, unknown topology of the network, the higher risk of node capture and lack of a fixed infrastructure makes the key management more challenging in Wireless Sensor Network (WSN). Paper surveys different key Management schemes for WSN. The paper presents the efficiency versus security requirements tradeoffs in key management for WSN. Paper also proposes a novel key management protocol which provides strong resistance against replay attacks. The results obtained from the mathematical model based on conditional probability of the scheme suggest that the proposed key management in NGI is efficient and attack resistant.

Lightweight Key Management for Adaptive Addressing in Next Generation Internet

2017 ◽  
Vol 8 (1) ◽  
pp. 50-69 ◽  
Author(s):  
Vinod Vijaykumar Kimbahune ◽  
Arvind V. Deshpande ◽  
Parikshit N Mahalle
Keyword(s):  
Sensor Networks ◽  
Key Management ◽  
Secure Communication ◽  
Resource Constraints ◽  
Sensor Nodes ◽  
Security Requirements ◽  
Next Generation ◽  
Secret Key ◽  
Next Generation Internet ◽  
Management Protocol

The continuous evolution of Next Generation Internet (NGI) amplifies the demand for efficient and secure communication capable of responding effectively to the challenges posed by the emerging applications. For secure communication between two sensor nodes, a secret key is needed. Cryptographic key management is a challenging task in sensor networks as the hostile environment of sensor networks makes it more prone to attacks. Apart from resource constraints of the devices, unknown topology of the network, the higher risk of node capture and lack of a fixed infrastructure makes the key management more challenging in Wireless Sensor Network (WSN). Paper surveys different key Management schemes for WSN. The paper presents the efficiency versus security requirements tradeoffs in key management for WSN. Paper also proposes a novel key management protocol which provides strong resistance against replay attacks. The results obtained from the mathematical model based on conditional probability of the scheme suggest that the proposed key management in NGI is efficient and attack resistant.

Key Management in WSN Security

2019 ◽  
pp. 303-325 ◽  
Author(s):  
Priyanka Ahlawat ◽  
Mayank Dave
Keyword(s):  
Key Management ◽  
Secure Communication ◽  
Sensor Nodes ◽  
Security Requirements ◽  
Wireless Sensor ◽  
Actual Behavior ◽  
Sensor Field ◽  
Node Capture Attack ◽  
Network Operation ◽  
Node Capture

To create a secure communication among the sensor nodes, a key establishment scheme is very important. Wireless sensor networks (WSN) are usually left unattended and thus may attract the adversary to launch several attacks to the network operation. The exposure of the key during a node capture may disturb a large part of network communication. If there is a reliable, efficient, and secure KMS, disruption in the network to such an extent may not occur during a node capture attack. Several researchers have presented several key agreement schemes, but still the area is open to design an efficient attack resistant KMS. Sometimes, during the design of security protocols, the assumptions taken for the adversary behavior in sensor field may not reflect their actual behavior of the adversary in sensor field making these schemes less feasible in many real-world WSN applications. This chapter first discusses the challenges and security requirements, node capture attacks, its impact on the network, and some open issues of KMS solutions to this problem.

scholarly journals Key Management and Cryptography in Wireless Sensor Networks

2020 ◽  
Vol 8 (5) ◽  
pp. 3847-4851
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Key Management ◽  
Secure Communication ◽  
Data Communication ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Secret Key ◽  
Healthcare Applications ◽  
Intended Receiver

The use of Wireless Sensor Networks (WSN) in the field of military, battlefield, healthcare applications etc has seen a plethora of growth towards variety of sensory devices. Irrespective of different locations, the sensor nodes has to do its task. Hence, the dynamic wireless sensor networks should ensure better quality of sensor nodes that covers wider network area and additional services in relative to static WSNs systems. By doing so, it requires secure data communication among the sensor nodes in wireless environment. Key Management is the recent security concept enabled to provide secure communication between sender and receiver nodes. In this paper, we have proposed efficient key updates systems between the nodes. In any scenario, the nodes may join or leaves the network environment which facilitates to initiate a secret key between intended sender and intended receiver. A certificate less key secrecy system is designed for secure communication in wireless links. By designing so, we have addressed the issues like node authentication, data confidentiality and data integrity. Experimental analyses have shown the effectiveness of proposed system.

A Novel Key Management Scheme for Next Generation Internet: An Attack Resistant and Scalable Approach

2018 ◽  
Vol 9 (1) ◽  
pp. 92-121
Author(s):  
Vinod Vijaykumar Kimbahune ◽  
Arvind V. Deshpande ◽  
Parikshit N. Mahalle
Keyword(s):  
Key Management ◽  
Secure Communication ◽  
Large Scale ◽  
Gap Analysis ◽  
Resource Constraints ◽  
Next Generation ◽  
Replay Attack ◽  
Next Generation Internet ◽  
Management Scheme ◽  
Key Management Scheme

The computational complexity of the next generation internet (NGI) is increasing at a faster rate. Due to the large scale of ubiquitous devices, effective and secure communication and addressing mechanism is vulnerable to several threats. Apart from resource constraints of the devices, the unknown topology of the network and the higher risk of device capture make the key management a more challenging task in NGI. In this context, a novel attack resistant and salable key management scheme must be in place to enable end-to-end secure communication. In the first part of the article, is a detailed analysis of various threats along with behavioral modeling of attack. Further, this article presents comprehensive literature survey and the gap analysis. The proposed key management scheme has been evaluated in two scenarios viz. centralized and decentralized and its formal security analysis also proves that it is safe from replay attack. The proposed key management scheme has been evaluated with a performance metric like delay and the results shows that it is salable in nature.

scholarly journals Clique Size in Sensor Networks with Key Pre-Distribution Based on Transversal Design

2005 ◽  
Vol 1 (3-4) ◽  
pp. 345-354 ◽  
Author(s):  
Dibyendu Chakrabarti ◽  
Subhamoy Maitra ◽  
Bimal Roy
Keyword(s):  
Sensor Networks ◽  
Distributed Computing ◽  
Secure Communication ◽  
Sensor Nodes ◽  
Transversal Design ◽  
Secret Key ◽  
Distributed Sensor Networks ◽  
Distributed Sensor

Key pre-distribution is an important area of research in Distributed Sensor Networks (DSN). Two sensor nodes are considered connected for secure communication if they share one or more common secret key(s). It is important to analyse the largest subset of nodes in a DSN where each node is connected to every other node in that subset (i.e., the largest clique). This parameter (largest clique size) is important in terms of resiliency and capability towards efficient distributed computing in a DSN. In this paper, we concentrate on the schemes where the key pre-distribution strategies are based on transversal design and study the largest clique sizes. We show that merging of blocks to construct a node provides larger clique sizes than considering a block itself as a node in a transversal design.

scholarly journals Using bivariate polynomial to design a dynamic key management scheme for wireless sensor networks

2013 ◽  
Vol 10 (2) ◽  
pp. 589-609 ◽  
Author(s):  
Chin-Ling Chen ◽  
Yu-Ting Tsai ◽  
Aniello Castiglione ◽  
Francesco Palmieri
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Key Management ◽  
Base Station ◽  
Sensor Nodes ◽  
Security Requirements ◽  
Wireless Sensor ◽  
Bivariate Polynomial ◽  
Management Scheme ◽  
Key Management Scheme

Wireless sensor networks (WSN) have become increasingly popular in monitoring environments such as: disaster relief operations, seismic data collection, monitoring wildlife and military intelligence. The sensor typically consists of small, inexpensive, battery-powered sensing devices fitted with wireless transmitters, which can be spatially scattered to form an ad hoc hierarchically structured network. Recently, the global positioning system (GPS) facilities were embedded into the sensor node architecture to identify its location within the operating environment. This mechanism may be exploited to extend the WSN?s applications. To face with the security requirements and challenges in hierarchical WSNs, we propose a dynamic location-aware key management scheme based on the bivariate polynomial key predistribution, where the aggregation cluster nodes can easily find their best routing path to the base station, by containing the energy consumption, storage and computation demands in both the cluster nodes and the sensor nodes. This scheme is robust from the security point of view and able to work efficiently, despite the highly constrained nature of sensor nodes.

Chinese Remainder Theorem Based Key Management for Secured Data Transmission in Wireless Sensor Networks

2020 ◽  
Vol 17 (5) ◽  
pp. 2163-2171
Author(s):  
G. Manikandan ◽  
U. Sakthi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Key Management ◽  
Secure Communication ◽  
Positive Impact ◽  
Chinese Remainder Theorem ◽  
Wireless Sensor ◽  
Secret Key ◽  
Secured Data

In secure communication key management plays an important role. Ensuring of security and trust worthiness in any transmission taking place via Wireless Sensor Networks (WSN) can be done using thoughtfully designed key management models. Here, the method of clustering is used to increase the system performance. Also, an effective key generation method is proposed for secured data transmission for the clustered wireless sensor networks. This method uses Chinese Remainder Theorem (CRT) for generating secret key for each cluster and merges with cluster head ID to generate a unique 144-bit encryption keys. Since, CRT uses random numbers for generating keys, separate active keys that are dynamic to ensure secured data transmission. The proposed model provides a positive impact by improving the lifetime, reducing the delay time, memory requirements and energy consumption, when compared with other existing state of art methods. Moreover, it protects data from brute-force attack, forward as well as backward secrecy and node compromised attack.

scholarly journals Safe Data Transfer Using Logic Gate Based Cryptographic Technique in Wireless Sensor Network

2021 ◽  
Vol 10 (4) ◽  
pp. 2877-2884
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Key Management ◽  
Secure Communication ◽  
Data Transfer ◽  
Logic Gate ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cryptographic Techniques

Wireless Sensor Networks consist of independent sensor nodes attached to one base station. In wireless sensor networks, nodes are connected to sensing environment and communicate the data to the base station. As WSNs continues to grow, they become vulnerable to attacks and hence the need for operative security techniques. Applications of wireless sensor networks demands for the well-organized and secure communication. For the solution of well-organized and reliable security, we need cryptography algorithms which provide good solutions. For providing reliable security techniques mainly data confidentiality, key management is used. Identification of suitable cryptographic techniques for WSNs is an important challenge due to limitation of energy, computation capability and memory of the sensor nodes. Symmetric cryptography techniques do not act well when the number of sensor nodes increases. Hence asymmetric key cryptographic techniques are widely used. Here we propose an electronic logic gate based symmetric Cryptographic technique which is more suitable for small and medium WSNs.

Delaunay Triangulation Based Key Distribution for Three-Dimensional Wireless Sensor Networks

2021 ◽  
pp. 2150009
Author(s):  
Monjul Saikia
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Delaunay Triangulation ◽  
Secure Communication ◽  
Three Dimensional ◽  
Key Distribution ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Secret Key ◽  
Symmetric Key

The security of wireless sensor networks is a significant concern and can be achieved by the application of cryptographic algorithms. The symmetric key encryption techniques are widely used cryptographic mechanisms for the security of sensor networks due to its low computational complexity. A symmetric key encryption technique requires a secret key to be shared between both parties for confidential communication. In a wireless sensor network, it is difficult to know which node is going to be in its communication range at the deployment phase. If prior knowledge of sensor location exists, it is an added advantage and helps in the distribution of secret keys among nodes. Even if with the expected location information, distributing the keys properly among the nodes is a challenging task. A proper algorithm must be used so that it gives the adequate utilization of the distributed keys with a minimal number of keys per sensor node. In this paper, we propose a location-dependent key distribution scheme. We use Delaunay Triangulation for the efficient distribution of keys among sensor nodes. The method gives a high probability of secure communication links among nodes with high resilience to the network.

Establishing Different Pairwise Keys Based-On LEACH for Securing Wireless Sensor Networks

2014 ◽  
Vol 568-570 ◽  
pp. 546-549
Author(s):  
Yan Ling Cui
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Key Management ◽  
Secure Communication ◽  
Group Key Management ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Management Scheme ◽  
Communication Policies ◽  
Power And Energy

The communication security problems for wireless sensor networks are exacerbated by the limited power and energy of the sensor devices. The focus of this paper is to design a lightweight group key management scheme to safeguard the data packet passing on the sensor networks. The design of the protocol is motivated by the observation that many sensor nodes in the network play different roles. We describe the design and implementation of establishing different pairwise keys based on LEACH. The protocol contains group communication policies, group membership requirements for secure communication under different types of attacks.

Sign in / Sign up

Export Citation Format

Share Document