Key Pre-distribution Scheme Research Articles

Connected Component in Secure Sensor NetworkInduced by a Random Key Pre-Distribution Scheme

Connected Component in Secure Sensor NetworkInduced by a Random Key Pre-Distribution Scheme

Key pre-distribution using partially balanced designs in wireless sensor networks

We propose two deterministic key predistribution schemes in a wireless sensor network (WSN), in which sensor nodes are deployed randomly. Both the schemes are based on combinatorial designs, called partially balanced incomplete block designs (PBIBD). An important feature of our scheme is that every pair of nodes within communication range can communicate directly, making communication faster and efficient. The number of keys per node is of the order of $\sqrt N$, where $N$ is the number of nodes in the network. Our second design has the added advantage that we can introduce new nodes in the network keeping the key pool fixed. This makes the network scalable. We study the resiliency of the network under node compromise and show that our designs give better results than the existing ones.

An application-driven attack probability-based deterministic pairwise key pre-distribution scheme for non-uniformly deployed sensor networks

Secure communication is a challenging problem in wireless sensor networks. Key pre-distribution is commonly used to establish key sharing among sensor nodes. In this paper, we investigate an attack probability-based deterministic key pre-distribution method for non-uniform sensor deployment aiming mainly at preserving the integrity of the network to ensure the functionality of sensor networks. We first design a model for group-based deployment to estimate the attack probability of each deployment group. The proposed model further considers the motion of the adversaries and the location of the data sink to meet the practical situation. Based on this attack model, a deterministic key pre-distribution mechanism for group-based deployment is proposed. To evaluate the proposed method, the issues of memory overhead, communication overhead, and the fraction of total communication compromised after adversaries launch node capture attacks analytically and empirically. Simulation results show that our approach is superior than some known methods.

Security In Wireless Sensor Networks Using Key Management Schemes

Wireless sensor networks pose new security and privacy challenges. One of the important challenges is how to bootstrap secure communications among nodes. Several key management schemes have been proposed. Key management plays an essential role in achieving security in wireless sensor networks (WSN). Due to resource constraints, achieving such key agreement in wireless sensor networks is nontrivial. Many key agreement schemes used in general networks, such as Diffie-Hellman and publickey based schemes, are not suitable for wireless sensor networks. Pre-distribution of secret keys for all pairs of nodes is not viable due to the large amount of memory used when the network size is large. In this paper, a new key pre-distribution scheme is proposed (DDHV SCHEME), which substantially improves the resilience of the network compared to the existing schemes (EG SCHEME). Our scheme exhibits a nice threshold property: when the number of compromised nodes is less than the threshold, the probability that any node other than these compromised nodes is affected is close to zero. This desirable property lowers the initial payoff of smaller scale network breaches to an adversary, and makes it necessary for the adversary to attack a significant proportion of the network.

Key predistribution for homogeneous wireless sensor networks with group deployment of nodes

Recent literature contains proposals for key predistribution schemes for sensor networks in which nodes are deployed in separate groups. In this article we consider the implications of group deployment for the connectivity and resilience of a key predistribution scheme. We propose a flexible scheme, based on the structure of a resolvable transversal design. We demonstrate that this scheme permits effective trade-offs between resilience, connectivity and storage requirements within a group-deployed environment as compared with other schemes in the literature, and show that group deployment can be used to increase network connectivity, without increasing storage requirements or sacrificing resilience.

Key Predistribution Approach in Wireless Sensor Networks Using LU Matrix

To achieve secure communication between sensor nodes in wireless sensor networks (WSNs), it is important to be able to establish efficient key predistribution mechanisms. Here, a matrix-based key predistribution scheme for WSN is presented, as shown in the following process. First, LU matrix-based method is employed to decompose the polynomial pool, which substitutes for the key pool to establish the shared keys. Second, the shared key is computed by the shared polynomial. Third, we can always compute the common polynomial with mutual authentication. The analysis indicates that the proposed scheme allows 100% connectivity regardless of the number of keys. To evaluate the efficiency of the network-wide memory overhead, each row or column of L and U matrices is divided into two parts: nonzero-element part and zero-element part. The results demonstrate that this method provides references for increasing the efficiency of LU matrix-based algorithms. By introducing polynomial-based key predistribtion, the resilience against node capture has been greatly enhanced as well.

Cluster-Based Key Predistribution Using Deployment Knowledge

We present a novel key predistribution scheme that uses deployment knowledge to divide deployment regions into overlapping clusters, each of which has its own distinct key space. Through careful construction of these clusters, network resilience is improved, without compromising connectivity or communications overhead. Experimental results show significant improvement in performance over existing schemes based on deployment knowledge.

A Hybrid Key Predistribution Scheme for Sensor Networks Employing Spatial Retreats to Cope with Jamming Attacks

In order to provide security services in wireless sensor networks, a well-known task is to provide cryptographic keys to sensor nodes prior to deployment. It is difficult to assign secret keys for all pairs of sensor node when the number of nodes is large due to the large numbers of keys required and limited memory resources of sensor nodes. One possible solution is to randomly assign a few keys to sensor nodes and have nodes be able to connect to each other with some probability. This scheme has limitations in terms of the tradeoffs between connectivity and memory requirements. Recently, sensor deployment knowledge has been used to improve the level of connectivity while using lesser amounts of memory space. However, deployment based key predistribution schemes may cause a large number of nodes to be cryptographically isolated if nodes move after key pre-distribution. Mobility may be necessitated for reasons depending on applications or scenarios. In this paper, we consider mobility due to spatial retreat of nodes under jamming attacks as an example. Jamming attacks are easy and efficient means for disruption of the connectivity of sensors and thus the operation of a sensor network. One solution for mobile sensor nodes to overcome the impact of jamming is to perform spatial retreats by moving nodes away from jammed regions. Moved nodes may not be able to reconnect to the network because they do not have any shared secret with new neighbors at new locations if strict deployment knowledge based key predistribution is employed. In this paper, we propose a hybrid key predistribution scheme that supports spatial retreat strategies to cope with jamming attacks. Our scheme combines the properties of random and deployment knowledge based key predistribution schemes. In the presence of jamming attacks, our scheme provides high key connectivity (similar to deployment knowledge based schemes) while reducing the number of isolated nodes. We evaluate the performance of our scheme through simulations and analysis.

Increasing Resiliency in Multi-phase Wireless Sensor Networks: Generationwise Key Predistribution Approach

In wireless sensor networks (WSNs), sensor nodes eventually die due to battery depletion. WSNs in which new nodes are periodically redeployed with certain intervals, called generations, to replace the dead nodes are called multi-phase WSNs. In the literature, there are several key predistribution schemes proposed for secure operation of WSNs. However, these schemes are designed for single-phase networks which are not resilient against continuous node capture attacks; even under temporary attacks on the network, the harm caused by the attacker does not heal in time. However, the periodic deployments in multi-phase sensor networks could be utilized to improve the resiliency of the WSNs by deploying nodes with fresh keys. In the literature, there is limited work done in this area. In this paper, we propose a key predistribution scheme for multi-phase WSNs which is resilient under node capture attacks. In our scheme, called random generation material (RGM) key predistribution scheme, each generation of deployment has its own random keying material and pairwise keys are established between node pairs of particular generations. These keys are specific to these generations. Therefore, a captured node cannot be abused to obtain keys of other generations. We compare the performance of our RGM scheme with a well-known multi-phase key predistribution scheme and show that RGM achieves up to 3-fold more resiliency. Even under heavy attacks, our scheme's resiliency performance is 35 % better in steady state.

The Subset Keys and Identity Tickets (SKIT) Key Distribution Scheme

<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> Probabilistic key predistribution schemes (P-KPSs) which place modest demands on hardware are good candidates for securing interactions between resource limited computers. Collusion susceptible P-KPSs are trade-offs between security and complexity. Some facets of complexity include computation, bandwidth, and storage overhead. Metrics for security include resistance to passive eavesdropping attacks, and active message injection attacks. The contributions of this paper are three-fold: 1) a novel P-KPS, the subset keys and identity tickets (SKIT) scheme; 2) a generic KPS model to facilitate comparison of various facets of the complexity of key predistribution schemes; and 3) a new security model to describe the resistance of P-KPSs to active message-injection attacks. The two models are used to show <emphasis emphasistype="boldital">why</emphasis> SKIT has many compelling advantages over existing P-KPSs in the literature. In particular, while placing lower demands on computation, bandwidth and storage overhead, SKIT realizes substantial improvements in resistance to passive and active attacks. </para>

ASYMPTOTIC DISTRIBUTION OF THE NUMBER OF ISOLATED NODES IN WIRELESS AD HOC NETWORKS WITH UNRELIABLE NODES AND LINKS

In this paper, we study the connectivity of wireless ad hoc networks that are composed of unreliable nodes and links by investigating the distribution of the number of isolated nodes. We assume that a wireless ad hoc network consists of n nodes distributed independently and uniformly in a unit-area disk or square. All nodes have the same maximum transmission radius rn, and two nodes have a link if their distance is at most rn. Nodes are active independently with probability 0 &lt; p1 ≤ 1, and links are up independently with probability 0 &lt; p2 ≤ 1. Nodes are said isolated if they do not have any links to active nodes. We show that if [Formula: see text] for some constant ξ, then the total number of isolated nodes (or isolated active nodes, respectively) is asymptotically Poisson with mean e-ξ (or p1e-ξ, respectively). In addition, in the secure wireless networks that adopt m-composite key predistribution schemes, a node is said isolated if it does not have a secure link. Let p denote the probability of the event that two neighbor nodes have a secure link. If all nodes have the same maximum transmission radius [Formula: see text], the total number of isolated nodes is asymptotically Poisson with mean e-ξ.

Energy-efficient dynamic pairwise key establishment algorithm for sensor network

Concerning the defects in key pre-distribution schemes such as storage heavyload,bad extendibility,a energy-efficient dynamic pairwise key establishment algorithm (EE-DPKEA) was proposed. The algorithm adopted the clustered-based scheme to establish pairwise keys,utilized the energy of each node in equilibrium and prolonged the life of sensor networks. Simulation results show that EE-DPKEA is better than the traditional key pre-distribution scheme in many aspects such as security,storage and communication overhead,key connectivity and energy load balancing.

On the Inefficiency of the Resources Optimal Key Pre-Distribution Scheme for Wireless Sensor Network

In this paper we re-evaluate the resources requirements of the “resources optimal key pre-distribution (RKPD) scheme in wireless sensor networks”. Our evaluation shows that RKPD has excessive requirements in terms of memory, computation, and communication. Thees requirements are problematic for that they make RKPD less beneficial by violating the purpose that it was designed for. Furthermore, because RKPD is a hybrid scheme that uses two well-known schemes in literature, we show that RKPD inherently have two security flows that challenge its chances of being deployment in real wireless sensor network. Detailed analysis, comparisons and examples are provided to evidence our arguments and conclusions.

A novel key pre-distribution scheme for wireless distributed sensor networks

A novel key pre-distribution scheme for sensor networks is proposed, which enables sensor nodes to communicate securely with each other using cryptographic techniques. The approach uses the rational normal curves in the projective space with the dimension n over the finite field \( \mathbb{F}_q \). Both secure connectivity and resilience of the resulting sensor networks are analyzed. By choosing the parameters q and n properly, this key pre-distribution scheme has some advantages over the previous known schemes. In addition, if the number of the rational normal curves in the scheme becomes too large for an application, the size may be reduced by choosing a part of the curves randomly. This reduction has, shown by our experiments, only minimal impact on secure connectivity and resilience of the resulting sensor network.

Key establishment for layered group-based Wireless Sensor Networks

Establishing pairwise keys for sensors is crucial to secure communications in Wireless Sensor Networks (WSNs). Several key pre-distribution schemes have been proposed to establish pairwise keys, but they are not scalable and suffer from a dramatic degradation of security when the number of compromised sensor exceeds a threshold. In this paper, we propose a Layered Group-based Key Establishment (LGKE) scheme, in which a logic top layer ensures the scalability through an Exclusion Basic System (EBS) technique while a logic low layer adopts a group-based key preload scheme to ensure the security. The security analysis and quantitative evaluation show the superiority of LGKE with regard to scalability, resilience, robustness and communication overhead.

Two Distributive Key Management Schemes In Mobile Ad Hoc Networks

Abstract Today’s ever smaller computing systems are increasingly spreading in our ubiquitous environrnent. Being available ubiquitously in the devices and appliances that we use everyday and everywhere, these embedded computing systems are accessible to mobile users via hand-held devices connected over wireless networks. A mobile ad hoc network (MANET) is one of the important wireless networks. In a MANET a reliable key management system is required to generate and distribute symmetric encryption/ decryption keys. The key management schemes proposed in MANETs so far have used trusted third parties (TTP) which have limitations because of the mobility of nodes. A Distributed Key Pre-distribution Scheme was proposed based on a probabilistic method without relying on any TTP but with results identical to TTP-based schemes. The scheme utilized cover-free family (CFF) properties. However, the precondition of the probabilistic method was claimed to be falsely deduced. In this paper, we propose two distributive k...

Key pre-distribution scheme based on block design for wireless sensor networks

Key management is paramount for wireless sensor networks.A key distributing protocol based on block design and Blom's scheme was proposed.With the advantage of the block design,this scheme can substantially improve the network's connectivity.In contrast to other key pre-distribution schemes,this one has higher resilience to node compromise

Key predistribution using combinatorial designs for grid-group deployment scheme in wireless sensor networks

We propose a new grid-group deployment scheme in wireless sensor networks. We use combinatorial designs for key predistribution in sensor nodes. The deployment region is divided into square regions. The predistribution scheme has the advantage that all nodes within a particular region can communicate with each other directly and nodes which lie in a different regions can communicate via special nodes called agents which have more resources than the general nodes. The number of agents in a region is always three, whatever the size of the network. We give measures of resiliency taking the Lee distance into account. Apart from considering the resiliency in terms of fraction of links broken, we also consider the resiliency as the number of nodes and regions disconnected when some sensor are compromised. This second measure, though very important, had not been studied so far in key predistribution schemes which use deployment knowledge. We find that the resiliency as the fraction of links compromised is better than existing schemes. The number of keys preloaded in each sensor node is much less than all existing schemes and nodes are either directly connected or connected via two hop paths. The deterministic key predistribution schemes result in constant-time computation overhead for shared key discovery and path key establishment.

Improved Key Predistribution Scheme in Wireless Sensor Networks Using Cell Splitting in Hexagonal Grid Based Deployment Model

Security in wireless sensor networks is an upcoming field which is quite different from traditional network security mechanisms. Many applications are dependent on the secure operation of a wireless sensor network, and have serious effects if the network is disrupted. Therefore, it is necessary to protect communication between sensor nodes. Key management plays an essential role in achieving security in wireless sensor networks. To achieve security, various key predistribution schemes have been proposed without deployment knowledge. Deployment knowledge can benefit the key predistribution scheme, as the nodes that are likely to be neighbors of each sensor node are assumed, and hence each node does not need to waste its memory to store unnecessary secret information. However, the existing key predistribution schemes require more memory and larger transmission range to achieve the desired connectivity. In order to enhance secure communication among sensor nodes, grid and hexagon deployment models are used. In both the deployment models, the sensor field is divided into equal grids. The keys are distributed from a large key pool randomly and pairwise keys are generated for each pair of sensor nodes. Once the pairwise keys are generated among neighboring nodes, they establish a secure connection and transmit data. We propose a new scheme based on cell splitting concept to improve the security level, in which a hexagon is subdivided in to smaller groups. The performance is evaluated in terms of connectivity and resilience against node capture. The analysis show that the performance is better using cell splitting concept compared to normal hexagon based scheme.

An Authentic Key Management Scheme for Hierarchical Wireless Sensor Networks

Key Management is a critical security service in wireless sensor networks (WSNs). It is an essential cryptographic primitive upon which other security primitives are built. The most critical security requirements in WSNs include authentication and confidentiality. These security requirements can be provided by a key management but it is difficult due to the ad hoc nature, intermittent connectivity, and resource limitations of the sensor networks. In this paper we propose an authenticated key management (AKM) scheme for hierarchical networks based on the random key pre-distribution. Further, a secure cluster formation algorithm is proposed. The base station periodically refreshes the network key, which provides the following: a) the authenticated network communication, and b) a global and continuous authentication of each network entity. Multiple level of encryption is provided by using two keys: 1) a pair-wise shared key between nodes, and 2) a network key. The AKM scheme is more resilient to node capture as compared to other random key pre-distribution schemes. The proposed key management scheme can be applied for different routing and energy efficient data dissemination techniques for sensor networks.