Sensor nodes are tiny, low-power and battery constrained electromechanical devices that are usually deployed for sensing some type of data in different types of areas. Because of their memory and computational restrictions, public key cryptography (PKC) systems are not suited for sensor nodes to provide security. Instead, private key cryptography is preferred to be used with sensor networks and...

Random Key Distribution (RKD) schemes have been widely accepted to enable low-cost secure communications in Wireless Sensor Networks (WSNs). However, efficiency of secure link establishment comes with the risk of compromised communications between benign nodes by adversaries who physically capture sensor nodes. The challenge is to enhance resilience of WSN against node capture, while maintainin...

Key establishment in sensor networks is a challenging problem because of resource constraints of the sensors. The classical public-key routines are impractical in most sensor network architectures. In this paper, we propose a new random key pre-distribution scheme which is based on the identity-based approach for key establishment between two neighbor nodes in wireless sensor networks. Our prop...

⎯In recent years, several random key predistribution schemes have been proposed to bootstrap keys for encryption, but the problem of key and node revocation has received relatively little attention. In this paper, based on a random key pre-distribution scheme using clustering, we present a novel random key revocation protocol, which is suitable for large scale networks greatly and removes compr...

Security for wireless sensor networks (WSNs) has become an increasingly serious concern due to the requirement level of applications and hostile deployment areas. To enable secure services, cryptographic keys must be agreed upon by communicating nodes. Unfortunately, due to resource constraints, the key agreement problem in wireless sensor networks has become quite complicated. To tackle this p...

In this paper, the random key pre-distribution scheme introduced in ACM CCS'02 by Eschenauer and Gligor is reexamined, and a generalized form of key establishment is introduced. As the communication overhead is one of the most critical constraints of any successful protocol design, we introduce an alternative scheme in which the connectivity is maintained at the same level as in the original wo...

We introduce an efficient random key pre-distribution scheme (RKPS) whose performance is 2 to 3 orders of magnitude better than schemes of comparable complexity in the literature. This dramatic improvement is achieved by increasing insecure storage complexity (for example using external flash memory). The proposed scheme is a combination of the Kerberos-like key distribution scheme (KDS) propos...