2005Unpublished venueRequires access

Efficient Group Key Management Protocol with One-Way Key Derivation

Jen-Chiun Lin, Feipei Lai, Hung‐Chang Lee

Open publisher page 46 citations

Abstract

The growth of the Internet inspires lots of new network applications, and many of them are based on group communication models. Key trees are ideal for a group of users to efficiently and securely share a common secret key, the group key, which can encrypt transmitted data, or other session keys that protect group communication. An efficient group key management protocol is proposed for centralized dynamic groups, and one-way key derivation is integrated with key trees to reduce the communication overhead of rekeying operations. The server does not have to send new keys to those members who can derive the keys by themselves, and the total number of encrypted keys transmitted per rekeying operation becomes fewer. It is shown that the technique can be applied to both synchronous and asynchronous rekeying operations. The proposed protocol outperforms the other group key management protocols from our analysis and simulation, and is suitable for practical systems.

About this research paper

What this paper is about

The growth of the Internet inspires lots of new network applications, and many of them are based on group communication models. Key trees are ideal for a group of users to efficiently and securely share a common secret key, the group key, which can encrypt transmitted data, or other session keys that protect group communication. An efficient group key management protocol is proposed for centralized dynamic groups, and one-way key derivation is integrated with key trees to reduce the communication overhead of rekeying operations. The server does not have to send new keys to those members who can derive the keys by themselves, and the total number of encrypted keys transmitted per rekeying operation becomes fewer. It is shown that the technique can be applied to both synchronous and asynchronous rekeying operations. The proposed protocol outperforms the other group key management protocols from our analysis and simulation, and is suitable for practical systems.

Why it matters

OpenAlex reports 46 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The growth of the Internet inspires lots of new network applications, and many of them are based on group communication models. Key trees are ideal for a group of users to efficiently and securely share a common secret key, the group key, which can encrypt transmitted data, or other session keys that protect group communication. An efficient group key management protocol is proposed for centralized dynamic groups, and one-way key derivation is integrated with key trees to reduce the communication overhead of rekeying operations. The server does not have to send new keys to those members who can derive the keys by themselves, and the total number of encrypted keys transmitted per rekeying operation becomes fewer. It is shown that the technique can be applied to both synchronous and asynchronous rekeying operations. The proposed protocol outperforms the other group key management protocols from our analysis and simulation, and is suitable for practical systems.

Key concepts: Rekeying, Session key, Computer science, Key management, Group key, Key (lock), Computer network, Encryption

Related papers

Back to paper searchBrowse research topicsOriginal source
Efficient Group Key Management Protocol with One-Way Key Derivation — Research Paper | ScholarLens