Because of the resource-constrained nature of Wireless Sensor Networks (WSNs), it is easier to use a security system based on symmetric key cryptography. However, the distribution and management of cryptographic keys pose challenges of their own. In this paper, we study some deterministic methods of distribution of keys to nodes. We propose and analyze a polynomial-based scheme and a complete c...

Key management represents a major and the most sensitive part of cryptographic systems. It includes key generation, key distribution, key storage, and key deletion. It is also considered the hardest part of cryptography. Designing secure cryptographic algorithms is hard, and keeping the keys secret is much harder. Cryptanalysts usually attack both symmetric and public key cryptosystems through ...

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

We introduce a new cryptographic technique that we call universal re-encryption. A conventional cryptosystem that permits re-encryption, such as ElGamal, does so only for a player with knowledge of the public key corresponding to a given ciphertext. In contrast, universal reencryption may be performed without knowledge of public keys. We demonstrate an asymmetric cryptosystem with universal re-...

So far, you have seen an overview of the basic cryptographic protocols that are used to secure a variety of modern systems. In 5430, you talked about symmetric encryption (e.g., AES), asymmetric encryption (e.g., RSA, El Gamal), hybrid encryption, MACs, digital signatures, and key agreement protocols. This means you are now familiar with many of the essential cryptographic building blocks that ...

A mobile ad hoc network is a group of nodes which are communicating with each other with the use of radio frequencies. When there is high movement of mobile nodes, the nodes find difficult to reach other nodes. If the data are exchanged between nodes when there is high mobility, the data may be lost in transit. Therefore the security of data is needed for the transmission of data. Since the hig...