A scheme of grouping key distribution based on polynomial protocol is proposed and experimentally demonstrated. The grouping idea is ingeniously used in the design of key distribution. The performance is experimental demonstrated by comparing with kinds of random key pre-distribution schemes. The results show that it can not only guarantee the key connected rate but also strengthen the security...

Encryption and key distribution are important primitives to build secure Wireless Sensor Networks (WSN). Different block ciphers were proposed in literature to provide encryption in resource constraint distributed networks. A large amount of different key distribution schemes were implemented, targeting different types of WSNs. These schemes face issues with respect to their requirements, imple...

Semi-device-independent quantum protocols realize information tasks – e.g. secure key distribution, random access coding, and randomness generation – in a scenario where no assumption on the internal working of the devices used in the protocol is made, except their dimension. These protocols offer two main advantages: first, their implementation is often less demanding than fully-device-indepen...

Providing security services for wireless sensor networks plays a vital role in secure network operation especially when sensor networks are deployed in hostile areas. In order to pave the way for these mechanisms, cryptographic keys must be agreed on by communicating nodes. Unfortunately, due to resource constraints, the key agreement problem in wireless sensor networks becomes quite intricate....

In this paper, we propose a novel identity-based random key pre-distribution scheme called the identity based key pre-distribution using a pseudo random function (IBPRF), which has better trade-off between communication overhead, network connectivity and resilience against node capture compared to the other existing key predistribution schemes. IBPRF always guarantees that no matter how many se...

We investigate the secure connectivity of wireless sensor networks under the random key distribution scheme of Eschenauer and Gligor. Unlike recent work which was carried out under the assumption of full visibility, here we assume a (simplified) communication model where unreliable wireless links are represented as on/off channels. We present conditions on how to scale the model parameters so t...

Random key pre-distribution schemes are vulnerable to collusion attacks. In this paper, we propose a new key management scheme for ubiquitous heterogeneous sensor networks consisting of a small number of powerful high-end H-sensors and a large number of ordinary low-end L-sensors. The collusion attack on key pre-distribution scheme mainly takes advantage of the globally applicable keys, which a...

Purpose Random key pre-distribution schemes are vulnerable to collusion attacks. The purpose of this research is to propose an efficient collusion resistant security mechanism for heterogeneous sensor networks (HSN). As large-scale homogeneous networks suffer from high costs of communication, computation, and storage requirements, the HSNs are preferred because they provide better performance a...

In wireless sensor networks (WSNs), for secure communications, the random key pre-distribution arises as the practical solution for sharing common keys between sensor nodes. Since sensor networks suffer from the resource constraints, we should consider the small computation, small number of keys, etc. while supporting the same security level, i.e., high resilience against node capture. In this ...