Random key graphs represent topologies of secure wireless sensor networks that apply the seminal Eschenauer– Gligor random key predistribution scheme to secure communication between sensors. These graphs have received much attention and also been used in diverse application areas beyond secure sensor networks; e.g., cryptanalysis, social networks, and recommender systems. Formally, a random key...

Random key graphs have been introduced about a decade ago in the context of key predistribution schemes for securing wireless sensor networks (WSNs). They have received much attention recently with applications spanning the areas of recommender systems, epidemics in social networks, cryptanalysis, and clustering and classification analysis. This paper is devoted to analyzing various properties ...

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...

In a wireless sensor network (WSN), pre-distribution of secret keys is possibly the most practical approach to protect network communications. To meet the stringent resource constraints of the sensor nodes, key pre-distribution schemes should be highly efficient, require as little storage space as possible, and at the same time, maintain a strong security strength, that is, high resilience agai...

Abstract—We consider secure and reliable connectivity in wireless sensor networks that utilize a heterogeneous random key predistribution scheme. We model the unreliability of wireless links by an on-off channel model that induces an Erdős-Rényi graph, while the heterogeneous scheme induces an inhomogeneous random key graph. The overall network can thus be modeled by the intersection of both gr...

The constraints of lightweight distributed computing environments such as wireless sensor networks lend themselves to the use of symmetric cryptography to provide security services. The lack of central infrastructure after deployment of such networks requires the necessary symmetric keys to be predistributed to participating nodes. The rich mathematical structure of combinatorial designs has re...

Key predistribution schemes for distributed sensor networks have received significant attention in the recent literature. In this paper we propose a new construction method for these schemes based on combinations of duals of standard block designs. Our method is a broad spectrum one which works for any intersection threshold. By varying the initial designs, we can generate various schemes and t...