Research on key establishment for Distributed Sensor Networks (DSNs) focuses on lightweight protocols that are feasible for the sensor nodes, which by default have restricted capabilities. Although the most efficient protocols for key establishment are based on symmetric key encryption, these protocols are unable to provide adequate security against attacks, such as node impersonation and fake ...

Predicate encryption is a new encryption paradigm which gives a master secret key owner fine-grained control over access to encrypted data. The master secret key owner can generate secret key tokens corresponding to predicates. An encryption of data x can be evaluated using a secret token corresponding to a predicate f ; the user learns whether the data satisfies the predicate, i.e., whether f(...

Recently, Sun proposed a private-key encryption scheme based on the product codes with the capability of correcting a special type of structured errors. In this paper, we present a novel method to improve the information rate of Sun’s scheme. This method uses the added error vector to carry additional information. Some information bits are mapped into an error vector with the special structure ...

Because of limited resources at sensor nodes, sensor networks typically adopt symmetric-key algorithms to provide security functions such as protecting communications between nodes. In order to use symmetric-key algorithms, two nodes need to establish a secret session key first. In this chapter, we describe a novel chord-based key establishment (CBKE) protocol that allows any pair of nodes in a...

This paper provides the first analytical and practical treatment of entity authentication and authenticated key exchange in the framework of Tree Parity Machines (TPMs). The interaction of TPMs has been discussed as an alternative concept for secure symmetric key exchange. Several attacks have been proposed on the non-authenticated principle. Adding and some extra entity authentication method i...

In the secure group communication, data is transmitted in such a way that only the group members are able to receive the messages. The main problem in the solution using symmetric key is heavy re-keying cost. To reduce re-keying cost tree based architecture is used. But it requires extra overhead to balance the keytree in order to achieve logarithmic re-keying cost. The main challenging issue i...

The aim of this paper is to propose an efficient and simpler Contributory Group Key Agreement protocol (CGKA) based on Elliptic Curve Diffie Hellman (ECDH). In this CGKA protocol, a member acts as a group controller (GC) and forms two-party groups with remaining group members and generates an ECDH-style shared key per each two-party group. It then combines these keys into a single group key and...

One way to use Diffie-Hellman’s 1976 secret key exchange protocol is to create a key to be used in later rounds for symmetric encryption. This requires multiple rounds of communication. Rivest, Shamir, and Adleman in 1978 developed the one round communication scheme discussed earlier. Namely, in order for Bob to receive messages Bob produces an integer N = pq where p and q are primes of equal l...