We consider one-round key exchange protocols secure in the standard model. The security analysis uses the powerful security model of Canetti and Krawczyk and a natural extension of it to the ID-based setting. It is shown how KEMs can be used in a generic way to obtain two different protocol designs with progressively stronger security guarantees. A detailed analysis of the performance of the pr...

Proxy re-encryption (PRE) allows a semi-trusted proxy to convert a ciphertext originally intended for Alice into one encrypting the same plaintext for Bob. The proxy only needs a re-encryption key given by Alice, and cannot learn anything about the plaintext encrypted. This adds flexibility in various applications, such as confidential email, digital right management and distributed storage. In...

The establishing of a pairwise key between two nodes for encryption in a wireless sensor network is a challenging issue. To do this, we propose a new deterministic key pre-distribution scheme which has modified the multiple key space scheme (MKSS). In the MKSS, the authors define two random parameters to make better resilience than existing schemes. Instead of a random selection of these parame...

Providing security services for wireless sensor networks plays a vital role in secure network operation especially when sensor networks are deployed in hostile areas. In order to pave the way for these mechanisms, cryptographic keys must be agreed on by communicating nodes. Unfortunately, due to resource constraints, the key agreement problem in wireless sensor networks becomes quite intricate....

We introduce two new Kirchhoff-law–Johnson-noise (KLJN) secure key distribution schemes, which are the generalization of the original KLJN version. The first system, the Random-Resistor (RR-) KLJN scheme is using random resistors chosen from a quasi-continuum set of resistance values. It is well known since the creation of the KLJN concept that such system could work because Alice and Bob can c...

In this paper, we propose a novel identity-based random key pre-distribution scheme called the identity based key pre-distribution using a pseudo random function (IBPRF), which has better trade-off between communication overhead, network connectivity and resilience against node capture compared to the other existing key predistribution schemes. IBPRF always guarantees that no matter how many se...

The extension problem is solved for the Lee and Euclidean weights over three families of rings of the form Z/NZ: N = 2, N = 3, or N = p = 2q + 1 with p and q prime. The extension problem is solved for the Euclidean PSK weight over Z/NZ for all N . 2010 MSC: 94B05