In 2008, Wan et al. presented an anonymous ID-based group key agreement scheme for wireless networks, for which they claim that it ensures anonymity and unlinkability of the group members, as well as forward and backward secrecy of the group session key. In this paper, we show that forward and backward secrecy do not hold for the protocol. We propose a correction that introduces a shielding fac...

Key management plays a very important role in the data communications. CBCEGKM is a key management scheme that provides more efficient and secure methods for key generation and utilization. This papers deals with the analysis of CBCEGKM with respect to communication overhead, computation cost, etc. The analysis shows that CBCEGKM comprises of the most reliable methods for key generations and he...

ID-based public key systems allow the user to use his/her identity as the public key, which can simplify key management procedure compared with CA-based public key systems. However, there is an inherent disadvantage in such systems: the problem of private key escrow, i.e., the “trusted” Private Key Generator (PKG) can easily impersonate any user at any time without being detected. Although the ...

Many group key agreement protocols (GKA) for secure group communication (SGC) based on the Diffie-Hellman key exchange principle have been proposed in literature. All of these protocols require member serialization and/or existence of a central entity. In this paper, we propose a simple group Diffie-Hellman key agreement protocol which removes these two limitations. Moreover, the new protocol n...

Many applications of wireless sensor network require secure data communications, especially in a hostile environment. In order to protect the sensitive data and the sensor readings, secret keys should be used to encrypt the exchanged messages between communicating nodes. Traditional asymmetric key cryptosystems are infeasible in WSN due to its low capacity at each senor node. In this paper, we ...

This paper investigates the use of the number of Goldbach triples, or the number of three prime partitions of an odd number, for use in the generation and distribution of cryptographic keys. In addition to presenting randomness properties of these triples, which turn out to be similar to that of prime partitions of even numbers, we explore the question of restricted partition sets. We propose a...

The problem of'controlling access to multimedia multicasts requires the distribution and maintenance of keying information. The conventional approach to distributing keys is to use a channel independent of the multimedia content. We propose a second approach that involves the use of an data-dependent channel, and can be achieved for multimedia by using data embedding techniques. Using data embe...

The HMQV protocols are ‘hashed variants’ of the MQV key agreement protocols. They were introduced at CRYPTO 2005 by Krawczyk, who claimed that the HMQV protocols have very significant advantages over their MQV counterparts: (i) security proofs under reasonable assumptions in the (extended) Canetti-Krawczyk model for key exchange; and (ii) superior performance in some situations. In this paper w...