Decentralized group key management schemes for supporting secure group communication systems have been studied in the two flavors of contributory key agreement and decentralized key distribution. However, the primary focus has been on the former because the latter have been criticized for additional overheads of establishing secure channels and for the possibility of weak keys produced by the g...

Secure communication over the Internet becomes an essential requirement for any value-added Internet application. The use of cryptography for secure communication brings out the requirement of cryptographic key management. This paper examines some security issues on the Internet Key Exchange (IKE) protocol specified in RFC 2409. The investigation is intended for clarifying some specification am...

Secure communication over the Internet becomes an essential requirement for any value-added Internet application. The use of cryptography for secure communication brings out the requirement of cryptographic key management. This paper examines some security issues on the Internet Key Exchange (IKE) protocol specified in RFC 2409. The investigation is intended for clarifying some specification am...

Recently, wireless sensor networks have been used extensively in different domains. For example, if the wireless sensor node of a wireless sensor network is distributed in an insecure area, a secret key must be used to protect the transmission between the sensor nodes. Most of the existing methods consist of preselecting m keys from a key pool and forming a key chain. Then, the sensor nodes mak...

Contributory group key management schemes are popularly used for dynamic peer group communications in collaborative environments. Previous contributory group key management schemes require every group member to perform a number of expensive Diffie-Hellman operations whenever the group membership changes. This is not always affordable for devices in resource-constrained networks. In this paper, ...

Secure group key distribution and efficient rekeying is one of the most challenging security issues in sensor networks at present. In this paper, Latin square is firstly used to construct orthogonal arrays in order to obtain t-packing designs quickly. Based on cover-free family properties, t-packing designs are adopted in key predistribution phase. Then based secure key-shared method, the pre-d...

Scalable group key management solutions are crucial for supporting Internet applications that are based on a group communication model. Many solutions have been proposed and of these the most efficient and scalable ones are based on logical key hierarchies (LKH) with symmetric keys organized in a tree. However, these solutions centralize trust in the group controller and make it an attractive a...

Traditional analysis of group key protocol performance is based on the cost of performing a single operation. We extend this analysis to examine the performance behavior of five group key protocols after execution of multiple operation. This paper reports the results of our experiments for 100 operations consist of combinations of join, leave, mass add and mass leave operations. The results of ...

549 Abstract— Lim et al. proposed a Hybrid Group Key Management scheme for Hierarchical Self-Organizing Sensor Network in 2008 to provide a secure way to pass down the group key for cluster-based communication. This paper presents two practical attacks on the scheme proposed by Lim et al. by tampering sensor nodes of a cluster to recover necessary secret keys and by exploiting the IDS employed ...