Random Key Predistribution Research Articles

Random Key Pre-Distribution Scheme Based On Key Updating

Abstract A random key pre-distribution scheme based on key updating (RKKU) was proposed, which is effective in wireless sensor networks. Firstly, the base station will randomly distribute some keys, a hash function and some code slices to each node. Furthermore, the RKKU scheme compares with the information of some random key to find the same key, and computes the communication key between two sensor nodes with one-way hash function. Since the one-way hash function can ensure that the attacker cannot use the obtained communication key to decipher the source key, it affects only two nodes communicate with each other. To assure the communication security, the key updating was designed based on code segment. The analysis shows that the proposed scheme can meet the security requirement of key management, and it also has less computation cost and storage cost than the existing schemes

A novel key pre-distribution approach for high security and efficiency using LU-decomposition of matrix

Wide-spread deployment of wireless sensor network (WSN) is emerging, which allows an economical solution for numerous applications. For the security of communication network, asymmetric cryptography is usually employed. This approach is, however, often unsuitable to WSN due to limited computational and energy power. Among various approaches the random key pre-distribution approach is regarded as the most effective one for WSN. Here one shortcoming is that a common key is not guaranteed to be found between any two communicating nodes. This paper proposes a new key pre-distribution scheme solving this problem by obtaining the keys with LU-decomposition of a symmetric matrix. Mathematical analysis and computer simulation reveal that the proposed scheme significantly reduces the overhead required for secure connectivity and energy efficiency of the sensor nodes compared to the existing approaches. The superiority of the proposed scheme becomes more substantial when the memory size of the sensor nodes is small.

Position-based Key Sharing with Higher Connectivity and Multivariate Optimized Resource Consumption in WSN

Objectives: This paper proposes an efficient Position-based Key Sharing (PKS) scheme to achieve higher connectivity and ideal flexibility with much less consumption of resources in Wireless Sensor Network and improve the network lifetime. Methods: The design of PKS scheme consists of three steps. Initially Random Position-based Key Pre-distribution is designed in PKS scheme with the objective of increasing the connectivity through assignment of random keys and a unique ID for each sensor node in the network. Multivariate Optimization-based Collective Key Detection in PKS optimizes communication resources by assigning priority with smaller distance than to higher distance. Then, Multivariate Optimization is applied in PKS to optimize communication resources that use Message Broadcast Format for collective key detection. Finally, Key Path organization with secured channel is established based on the closest neighboring sensor nodes vertices. The design of Key-Path Detection algorithm provides a secured communication between sensor nodes and therefore supports data traffic in WSN. Findings: The results are simulated in NS2 for efficient management of data traffic in WSN. The simulation results showed that the proposed PKS scheme out performed than the existing state of the art works in terms number of sensor nodes, connectivity, resource consumption, security and network life time. Improvement: The proposed PKS scheme is able to optimize the resource usage and also improve the network lifetime as compared to the state-of-the-art works.Keywords: Connectivity, Collective Key Detection, Key Sharing, Multivariate Optimization, Pre-distribution, Wireless Sensor Network

Toward <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Connectivity of the Random Graph Induced by a Pairwise Key Predistribution Scheme With Unreliable Links

We study the secure and reliable connectivity of wireless sensor networks. Security is assumed to be ensured by the random pairwise key predistribution scheme of Chan, Perrig, and Song, and unreliable wireless links are represented by independent on/off channels. Modeling the network by an intersection of a random $K$-out graph and an Erd\H{o}s-R\'enyi graph, we present scaling conditions (on the number of nodes, the scheme parameter $K$, and the probability of a wireless channel being on) such that the resulting graph contains no nodes with degree less than $k$ with high probability, when the number of nodes gets large. Results are given in the form of zero-one laws and are shown to improve the previous results by Ya\u{g}an and Makowski on the absence of isolated nodes (i.e., absence of nodes with degree zero). Via simulations, the established zero-one laws are shown to hold also for the property of $k$-connectivity; i.e., the property that graph remains connected despite the deletion of any $k-1$ nodes or edges.

Using a Random Secret Pre-Distribution Scheme to Implement Message Authentication in VANETs

In recent years, the development of the Intelligent Transportation System (ITS) has increased the popularity of vehicular ad hoc networks (VANET). A VANET is designed to enable vehicles to exchange information about traffic or vehicle conditions to help other vehicles avoid traffic accidents or traffic jams. To resist malicious attacks, all vehicles must be anonymous and their routings must be untraceable, but still verifiable. The vehicles must trust each other and communicate confidentially. In a VANET, Road Side Units (RSU) are installed on traffic signs or streetlights to help vehicles maintain anonymity, to authenticate messages, or to support confidentiality. However, the coverage of an RSU is limited and the cost of widespread installation is high. RSU installations are incremental, so messages must be authenticated using dense RSUs or sparse RSUs. In this paper, the concept of random key pre-distribution that is used in Wireless Sensor Networks (WSN) is modified to random secret pre-distribution (RSP), which integrates identity-based cryptography (IBC) to produce a message authentication scheme for VANETs in a sparse RSU environment. In the proposed scheme, vehicles follow a process to determine a common secret, allowing them to authenticate each other and obtain the pairing value as a key for use in message authentication and private communication. Evaluation results show that the proposed scheme outperforms related schemes.

<inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Connectivity in Random Key Graphs With Unreliable Links

Random key graphs form a class of random intersection graphs and are naturally induced by the random key predistribution scheme of Eschenauer and Gligor for securing wireless sensor network (WSN) communications. Random key graphs have received much interest recently, owing in part to their wide applicability in various domains including recommender systems, social networks, secure sensor networks, clustering and classification analysis, and cryptanalysis to name a few. In this paper, we study connectivity properties of random key graphs in the presence of unreliable links. Unreliability of the edges are captured by independent Bernoulli random variables, rendering edges of the graph to be on or off independently from each other. The resulting model is an intersection of a random key graph and an Erdos-Renyi graph, and is expected to be useful in capturing various real-world networks; e.g., with secure WSN applications in mind, link unreliability can be attributed to harsh environmental conditions severely impairing transmissions. We present conditions on how to scale this model's parameters so that i) the minimum node degree in the graph is at least k, and ii) the graph is k-connected, both with high probability as the number of nodes becomes large. The results are given in the form of zeroone laws with critical thresholds identified and shown to coincide for both graph properties. These findings improve the previous results by Rybarczyk on the k-connectivity of random key graphs (with reliable links), as well as the zero-one laws by Yagan on the 1-connectivity of random key graphs with unreliable links.

Reliable Random Key Pre-Distribution Schemes for Wireless Sensor Networks

Reliable Random Key Pre-Distribution Schemes for Wireless Sensor Networks

Key splitting: making random key distribution schemes resistant against node capture

AbstractA large number of random key pre‐distribution (RKD) schemes have been proposed in the literature to secure wireless sensor network applications, relying on symmetric key cryptography. However, sensor nodes are exposed to physical compromise by adversaries, who target the symmetric keys stored at each node. With the stolen keys in their possession, the adversaries are then able to compromise communication links between benign nodes. Here, the big challenge arises: how to increase resilience of RKD schemes for wireless sensor networks to node capture, while maintaining the flexibility and low‐cost features of RKD? We propose the idea of key splitting to address this problem, without the need of any special‐purpose hardware. Our key splitting scheme neither increases per‐node storage nor introduces additional computation and communication overheads. Nevertheless, it can achieve better connectivity. More importantly, it significantly increases resilience to node compromise, when the adversary does not have overwhelming computational power. Copyright © 2014 John Wiley & Sons, Ltd.

An Efficient Grid-Based Pairwise Key Predistribution Scheme for Wireless Sensor Networks

Research on wireless sensor networks (WSNs) has been receiving a lot of attention recently. Because of the constraints on the cost of hardware, there are a lot of restrictions regarding memory, computational ability, and energy consumption, hampering WSN research. So far, many key establishment schemes have been proposed for WSNs. For the proposed schemes, random key predistribution is a practical solution. With this, each sensor shares a common key with its neighbors via predistributed keys. However, it may happen that two sensor nodes do not share a common key. In this paper, an efficient grid-based pairwise key predistribution scheme for WSNs is proposed. In the proposed scheme, multiple polynomials for each row, each column, and each diagonal in the grid are constructed. Then, each sensor node in each row, column, and diagonal in the grid establishes a pairwise key with the other node using the predistributed symmetric polynomial. Simulation results demonstrate the effectiveness of the proposed scheme in increasing the probability of establishing pairwise keys and reducing communication overhead.

On the Connectivity of Sensor Networks Under Random Pairwise Key Predistribution

We investigate the connectivity of wireless sensor networks under the random pairwise key predistribution scheme of Chan Under the assumption of full visibility, this reduces to studying the connectivity in the so-called random K-out graph H (n;K); here, n is the number of nodes and K <; n is an integer parameter affecting the number of keys stored at each node. We show that if K ≥ 2 (respectively, K=1), the probability that H (n;K) is a connected graph approaches 1 (respectively, 0) as n goes to infinity. For the one-law this is done by establishing an explicitly computable lower bound on the probability of connectivity. Using this bound, we see that with high probability, network connectivity can already be guaranteed (with K ≥ 2) by a relatively small number of sensors. This corrects earlier predictions made on the basis of a heuristic transfer of connectivity results available for Erdos-Renyi graphs.

A Novel Key Management Strategy for Heterogeneous Wireless Sensor Networks

A key management strategy is presented for heterogeneous wireless sensor networks. The wireless sensor networks have some sensor nodes which have greater power and transmission capability than other nodes have. Both ordinary nodes and heterogeneous nodes are evenly distributed in sensing square area respectively. The pairwise keys between nodes are established through utilizing the concept of the overlap key sharing and the random key predistribution scheme. Analysis and comparison demonstrate that the connectivity and security of wireless sensor networks have been improved obviously even with some heterogeneous nodes.

An Energy-Efficient Key Predistribution Scheme for Secure Wireless Sensor Networks Using Eigenvector

Currently, sensor networks are widely used in various fields. Here secure operations are required for critical applications since the damages are significant if the network is compromised or disrupted. For the security of wireless sensor network, the earlier schemes typically employ asymmetric cryptography. These schemes are, however, often unsuitable for wireless sensor network due to the limited computational power and energy of the sensor nodes. To address this issue, various approaches have been developed, and the random key predistribution approach has been recognized as an effective approach. One shortcoming, however, is that a common key is not guaranteed to be found between any two nodes wanting to communicate. This paper proposes a new robust key predistribution scheme solving this problem, with which the security is not compromised even though the data exchanged between the nodes are tapped by an adversary. This is achieved by using the keys assigned based on the notion of eigenvalue and eigenvector of a square matrix of a pool of keys. Mathematical analysis and computer simulation reveal that the proposed scheme significantly reduces the overhead required for secure connectivity and energy consumption of sensor nodes compared to the existing approaches.

On the scalability of the random pairwise key predistribution scheme: Gradual deployment and key ring sizes

The pairwise key distribution scheme of Chan et al. is a randomized key predistribution scheme which enables cryptographic protection in wireless sensor networks (WSNs). Although this pairwise scheme has several advantages over other randomized key predistribution schemes, including the original scheme of Eschenauer and Gligor, it has been deemed non-scalable for the following two reasons: (i) There are implementation difficulties when sensors need to be deployed in multiple stages; and (ii) the possibly large number of keys stored at each sensor node is random and may vary from sensor to sensor. Here, we explore these issues as follows: (i) We propose an implementation of the pairwise scheme that supports the gradual deployment of sensor nodes in several consecutive phases; (ii) We show how the scheme parameters should scale with the maximum number n of sensor nodes in the network so that a.a.s. secure connectivity is maintained throughout every deployment phase of the network; (iii) We derive scaling conditions on the scheme parameters for all the sensors in the network to have O(logn) many keys with very high probability as n grows large. This dimensioning of the key rings can be made to support a.a.s. secure connectivity at every step of deployment.

Modeling the Pairwise Key Predistribution Scheme in the Presence of Unreliable Links

We investigate the secure connectivity of wireless sensor networks under the random pairwise key predistribution scheme of Chan, Perrig, and Song. Unlike recent work carried out under the assumption of full visibility, here we assume a (simplified) communication model where unreliable wireless links are represented as independent on/off channels. We present conditions on how to scale the model parameters so that the network 1) has no secure node that is isolated and 2) is securely connected, both with high probability, when the number of sensor nodes becomes large. The results are given in the form of zero-one laws, and exhibit significant differences with corresponding results in the full-visibility case. Through simulations, these zero-one laws are shown to also hold under a more realistic communication model, namely the disk model.

Cooperative secret delivery in wireless sensor networks

In the technical literature, many random key pre–distribution techniques have been proposed to secure wireless sensor networks (WSNs). Such techniques only establish keys for some pairs of physically connected sensors. On the contrary, in many WSN applications, a source node must securely communicate with all of its neighbours. In this work, we address the issue of delivering secret link keys to each of the source's neighbours in WSNs. We propose a scheme called cooperative secret delivery (CSD) that finds bridge nodes to deliver keys to the insecure neighbours, which share no prior keys with the source. The novelty of our scheme is to deliver multiple keys through these bridge nodes and regular paths instead of multi–hop secure paths. Since the secret link keys are delivered cooperatively by the bridge nodes in the CSD scheme, secret disclosure probability is significantly lower compared to other delivery techniques. We perform extensive theoretical analysis and performance evaluation on the CSD scheme and demonstrate its salient features.

Attack Wireless Sensor Network Using Compromised Key Redistribution

Wireless sensor networks have been widely used in many areas, such as earthquake monitoring, building structure monitoring, and military surveillance. In this work, we focus on the wireless sensor network deployed in the battlefield, using random key predistribution scheme. Based on the node cloning attack, we proposed a new attack scheme, called compromised key redistribution attack, and discussed related attack scenarios. Furthermore, we have exposed that, when the overlapping factor of compromised key set is larger than 0.05, it is almost 90% that the number of distinct compromised keys is 10.5% of the original key pool. This result helps the adversary estimate the approximated size of original key pool by calculating the overlapping factor, thus calculate the probability that malicious nodes successfully establish malicious connections with legitimate nodes.

Exact Formulae for Resilience in Random Key Predistribution Schemes

As wireless sensor networks are often deployed in adverse or hostile environments, key management schemes are required for sensor nodes. The random key predistribution (RKP) scheme is a probabilistic key management scheme where each node is preloaded with a subset of keys that are randomly selected from a pool of keys. If a pair of neighbor nodes have a common key, it can be used to establish a secure link between the nodes. The q-composite RKP scheme requires that a pair of neighbor nodes have at least q common keys for a secure link. In this article, we show that the previous security analysis (i.e., resilience against node capture) of the q-composite RKP scheme is inaccurate and present new formulae for resilience in the RKP scheme and the q-composite RKP scheme.

Zero–One Laws for Connectivity in Random Key Graphs

The random key graph is a random graph naturally associated with the random key predistribution scheme of Eschenauer and Gligor for wireless sensor networks. For this class of random graphs we establish a new version of a conjectured zero-one law for graph connectivity as the number of nodes becomes unboundedly large. The results reported here complement and strengthen recent work on this conjecture by Blackburn and Gerke. In particular, the results are given under conditions which are more realistic for applications to wireless sensor networks.

Threshold behavior of multi-path random key pre-distribution for sparse wireless sensor networks

Wireless sensor network (WSN) has been an active research topic because its application encompasses various domains. In particular, a lot of attention have been paid to the common feature of WSN to show that every node in a large enough network contains certain properties. Real-world applications of random key pre-distribution naturally involve geometric and combinatorial techniques and are even more challenging technically. This paper presents an efficient scheme, which can approximate a complex network by a much simpler object such that the approximation is “regular” between most pairs of partition of this network. Once a more traceable network is obtained, bounds for the probability of the property that a random key pre-distribution subgraph satisfies that each node has a path of length ℓ to its ℓth-hop neighbors are established. Then, by using the sparse version of Szemerédi’s regularity lemma and letting C be a constant, n the number of vertices, p the probability of any two nodes sharing at least one common key, a sharp threshold p≥Cn−(ℓ−1)/ℓ that satisfies this property is shown. Moreover, computer simulations are also given to show the performance of the proposed scheme.

Performance Analysis of Random key Pre-distribution Scheme for Multi-Phase Wireless Sensor Networks

Performance Analysis of Random key Pre-distribution Scheme for Multi-Phase Wireless Sensor Networks