To achieve security in wireless sensor networks, it is important to be able to encrypt messages sent among sensor nodes. Keys for encryption purposes must be agreed upon by communicating nodes. Due to resource constraints, achieving such key agreement in wireless sensor networks is non-trivial. Many key agreement schemes used in general networks, such as Diffie-Hellman and public-key based sche...

Key pre-distribution is a well-known technique for ensuring secure communication among sensors deployed in an ad-hoc manner to form a sensor network. Secure paths can be established between any two sensors, where adjacent sensors on the path share a (predistributed) secret key. Several results have been presented recently on random key predistribution schemes [6] and [2]. In this paper, we prop...

Key predistribution schemes for resource-constrained networks are methods for allocating symmetric keys to devices in such a way as to provide an efficient trade-off between key storage, connectivity and resilience. While there have been many suggested constructions for key predistribution schemes, a general understanding of the design principles on which to base such constructions is somewhat ...

The random key graph is a random graph naturally associated with the random key predistribution scheme of Eschenauer and Gligor for wireless sensor networks. For this class of random graphs we establish a new version of a conjectured zero-one law for graph connectivity as the number of nodes becomes unboundedly large. The results reported here complement and strengthen recent work on this conje...

Key predistribution is a well-known technique for ensuring secure communication via encryption among sensors deployed in an ad-hoc manner to form a sensor network. In this paper, we propose a novel 2-Phase technique for key predistribution based on a combination of inherited and random key assignments from the given key pool to individual sensor nodes. We also develop an analytical framework fo...

Resource constraints of the nodes make security protocols difficult to implement. Thus key management is an important area of research in Wireless Sensor Networks (WSN). Key predistribution (kpd) which involves preloading keys in sensor nodes, has been considered as the best solution for key management when sensor nodes are battery powered and have to work unattended. This paper proposes a meth...

The random key graph is a random graph naturally associated with the random key predistribution scheme introduced by Eschenauer and Gligor in the context of wireless sensor networks. For this class of random graphs we establish a new version of a conjectured zero-one law for graph connectivity as the number of nodes becomes unboundedly large. The results reported here complement and strengthen ...

We address a challenge to developing the Future Force — Army tactical networks require cryptographic keys to implement security services such as encryption and authentication, but current pairwise key establishment approaches using interactive public key techniques are too time-consuming. This paper describes identity-based cryptographic solutions that enable strong security and significantly r...

Key management is an essential functionality for developing secure cryptosystems; particularly for implementations to low cost devices of a distributed sensor networks (DSN)–a prototype of Internet of Things (IoT). Low cost leads to constraints in various resources of constituent devices of a IoT (sensors of a DSN); thereby restricting implementations of computationally heavy public key cryptos...