Key management plays fundamental role in research on security service in wireless sensor networks (WSNs). However, due to the resource constraints, establishing pairwise keys in WSNs is not a trivial tasks. Several exiting key management schemes have been proposed in literature to establish pairwise keys between sensor nodes, but they either can not offer strong resilience against node capture ...

In random key predistribution techniques for wireless sensor networks, a relatively small number of keys are randomly chosen from a large key pool and are loaded on the sensors prior to deployment. After deployment, each sensor tries finding a common key shared by itself and each of its neighbors to establish a link key to protect the wireless communication between themselves. One intrinsic dis...

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 pre-distribution 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 secure, in the following sense: we formally ...

Node capture attack is one of the most dreadful security attack exist in wireless sensor networks. An adversary steals cryptographic key information from a captured node to compromise entire network. So, Security of wireless sensor network is an important issue for maintaining confidentiality and integrity of wireless links. Now-a-days, researchers are paying attention towards developing securi...

Many applications of wireless sensor networks (WSNs) require deploying sensors in hostile environments, where an adversary may eavesdrop communications. To secure communications WSNs, the q-composite key predistribution scheme has been proposed literature. In this paper, we investigate k-connectivity WSNs operating under scheme, consideration unreliability links. Secure ensures that any two can...

We study two closely related primitives: Broadcast Encryption and Key Predistribution Schemes (KPS). Broadcast Encryption allows a broadcaster to broadcast an encrypted message so that only a designated group of users can decrypt it. KPS allows a designated group of users to establish a common key non-interactively. We discover a generic method to construct efficient broadcast encryption scheme...

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ős-Rényi graph, we present scaling conditions (on the numbe...