Random Predistribution Research Articles

A Light Weight Secure Communication Scheme for Wireless Sensor Networks

The majority of security systems for wireless sensor networks are based on symmetric encryption. The main open issue for these approaches concerns the establishment of symmetric keys. A promising key distribution technique is the random pre-distribution of secret keys. Despite its effectiveness, this approach presents considerable memory overheads, in contrast with the limited resources of wireless sensor networks. A new scheme, called Seed based Min–Max Composite (S2MC), is proposed that exploits the best features of random pre-distribution with lower memory requirements and higher resilience. The novelty of the S2MC scheme lies in the organization of the secret material that uses the limited number of light weight pre-distributed seeds in a certain range and generating keys from the seeds during communication. The simulative analysis demonstrates that the introduced approach provides a higher level of security in terms of resilience than the existing schemes since the keys are erased after communication in the presence of compromised nodes.

A Key Distribution Scheme for Mobile Wireless Sensor Networks: $q$ - $s$ -Composite

The majority of security systems for wireless sensor networks are based on symmetric encryption. The main open issue for these approaches concerns the establishment of symmetric keys. A promising key distribution technique is the random predistribution of secret keys. Despite its effectiveness, this approach presents considerable memory overheads, in contrast with the limited resources of wireless sensor networks. In this paper, an in-depth analytical study is conducted on the state-of-the-art key distribution schemes based on random predistribution. A new protocol, called $q$ - $s$ - composite , is proposed in order to exploit the best features of random predistribution and to improve it with lower requirements. The main novelties of $ q$ - $ s$ -composite are represented by the organization of the secret material that allows a storing reduction, by the proposed technique for pairwise key generation, and by the limited number of predistributed keys used in the generation of a pairwise key. A comparative analysis demonstrates that the proposed approach provides a higher level of security than the state-of-the-art schemes.

Hash Chain Based Random Keys Pre-Distribution Scheme in Wireless Sensor Networks

Key management is the cornerstones of many security mechanisms and services in wireless sensor networks.Random pre-distribution of secret key is one of the most practical schemes in such networks due to its instinct property.These schemes,however,face a challenging problem,that is,it can not acquire the high network connectivity probability and reach strong resilience against the nodes compromise simultaneously.To address this limitation,a hash chain based random key pre-distribution scheme is proposed in the paper.Nodes only need to preload a few of secret keys and can establish pair-wise keys amongst its neighboring nodes with high probability through tuning some system parameters,such as the length of hash chain,the number of common auxiliary nodes,the number of hash chain.Moreover,the proposed scheme can maintain strong security strength even though there are a lot of compromised nodes.The theoretical analysis and simulation experiments show that the proposed scheme performs well in terms of network connectivity and security strength.

Redoubtable Sensor Networks

We give, for the first time, a precise mathematical analysis of the connectivity and security properties of sensor networks that make use of the random predistribution of keys. We also show how to set the parameters---pool and key ring size---in such a way that the network is not only connected with high probability via secure links but also provably resilient, in the following sense: We formally show that any adversary that captures sensors at random with the aim of compromising a constant fraction of the secure links must capture at least a constant fraction of the nodes of the network. In the context of wireless sensor networks where random predistribution of keys is employed, we are the first to provide a mathematically precise proof, with a clear indication of parameter choice, that two crucial properties---connectivity via secure links and resilience against malicious attacks---can be obtained simultaneously. We also show in a mathematically rigorous way that the network enjoys another strong security property. The adversary cannot partition the network into two linear size components, compromising all the links between them, unless it captures linearly many nodes. This implies that the network is also fault tolerant with respect to node failures. Our theoretical results are complemented by extensive simulations that reinforce our main conclusions.