2012Information Technology And ControlOpen access

Towards scalable key management for secure multicast communication

Yuh Min Tseng, Chen Hung Yu, Tsu‐Yang Wu

Open full text 10 citations

Abstract

A secure multicast communication is used to deliver encrypted messages from a sender to a group of authorized receivers. A practical approach is to use a common key only known by the authorized users to encrypt the transmitted messages. The common key must be renewed to ensure forward/backward secrecy when a group member joins/ leaves the group. In this case, the rekeying problem becomes a critical issue for secure multicast communication. Many researchers have focused on solving the rekeying problem. In 2010, Lin et al. proposed two multicast key management schemes without the rekeying process. However, the transmission size in their schemes is dependent on the number of group members. In this article, we adopt the time-bound concept to propose two new key management schemes without the rekeying process. The point is that the required transmission size in the proposed schemes is constant. Performance analysis is given to demonstrate that our schemes have better performance as compared with the recently proposed key management schemes in terms of transmission size and computational cost. Under several security assumptions, we prove that the proposed schemes are secure key management schemes for multicast communication.DOI: http://dx.doi.org/10.5755/j01.itc.41.2.846

Open-access reader

About this research paper

What this paper is about

A secure multicast communication is used to deliver encrypted messages from a sender to a group of authorized receivers. A practical approach is to use a common key only known by the authorized users to encrypt the transmitted messages. The common key must be renewed to ensure forward/backward secrecy when a group member joins/ leaves the group. In this case, the rekeying problem becomes a critical issue for secure multicast communication. Many researchers have focused on solving the rekeying problem. In 2010, Lin et al. proposed two multicast key management schemes without the rekeying process. However, the transmission size in their schemes is dependent on the number of group members. In this article, we adopt the time-bound concept to propose two new key management schemes without the rekeying process. The point is that the required transmission size in the proposed schemes is constant. Performance analysis is given to demonstrate that our schemes have better performance as compared with the recently proposed key management schemes in terms of transmission size and computational cost. Under several security assumptions, we prove that the proposed schemes are secure key management schemes for multicast communication.DOI: http://dx.doi.org/10.5755/j01.itc.41.2.846

Why it matters

OpenAlex reports 10 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

A secure multicast communication is used to deliver encrypted messages from a sender to a group of authorized receivers. A practical approach is to use a common key only known by the authorized users to encrypt the transmitted messages. The common key must be renewed to ensure forward/backward secrecy when a group member joins/ leaves the group. In this case, the rekeying problem becomes a critical issue for secure multicast communication. Many researchers have focused on solving the rekeying problem. In 2010, Lin et al. proposed two multicast key management schemes without the rekeying process. However, the transmission size in their schemes is dependent on the number of group members. In this article, we adopt the time-bound concept to propose two new key management schemes without the rekeying process. The point is that the required transmission size in the proposed schemes is constant. Performance analysis is given to demonstrate that our schemes have better performance as compared with the recently proposed key management schemes in terms of transmission size and computational cost. Under several security assumptions, we prove that the proposed schemes are secure key management schemes for multicast communication.DOI: http://dx.doi.org/10.5755/j01.itc.41.2.846

Key concepts: Rekeying, Multicast, Computer science, Secure multicast, Computer network, Key management, Group key, Key (lock)

Related papers

Back to paper searchBrowse research topicsOriginal source
Towards scalable key management for secure multicast communication — Research Paper | ScholarLens