Towards scalable key management for secure multicast communication

Yuh Min Tseng, Chen Hung Yu, Tsu Yang Wu

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

Secure multicast communication allows a sender to deliver encrypted messages to a group of authorized receivers. A practical approach is that the sender uses a common key shared by the authorized receivers to encrypt the transmitted messages. The common key must be renewed to ensure forward/backward secrecy when group members leave/join the group, called the rekeying process. Thus, the rekeying problem is a critical issue for secure multicast communication. Many key management schemes have been proposed to improve the performance of the rekeying process. In 2010, Lin et al. proposed two key management schemes without the rekeying process. However, the transmission size required in their schemes increases linearly with the number of group members. In this article, we use the time-bound concept to propose two new key management schemes without the rekeying process. The point is that the required transmission size 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 satisfy the requirements of secure multicast communication.

Original languageEnglish
Pages (from-to)173-182
Number of pages10
JournalInformation Technology and Control
Volume41
Issue number2
DOIs
Publication statusPublished - 2012 Jan 1

Fingerprint

Secure communication
Costs

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

Tseng, Yuh Min ; Yu, Chen Hung ; Wu, Tsu Yang. / Towards scalable key management for secure multicast communication. In: Information Technology and Control. 2012 ; Vol. 41, No. 2. pp. 173-182.
@article{44bbce4aff0e4139bad4220790423d36,
title = "Towards scalable key management for secure multicast communication",
abstract = "Secure multicast communication allows a sender to deliver encrypted messages to a group of authorized receivers. A practical approach is that the sender uses a common key shared by the authorized receivers to encrypt the transmitted messages. The common key must be renewed to ensure forward/backward secrecy when group members leave/join the group, called the rekeying process. Thus, the rekeying problem is a critical issue for secure multicast communication. Many key management schemes have been proposed to improve the performance of the rekeying process. In 2010, Lin et al. proposed two key management schemes without the rekeying process. However, the transmission size required in their schemes increases linearly with the number of group members. In this article, we use the time-bound concept to propose two new key management schemes without the rekeying process. The point is that the required transmission size 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 satisfy the requirements of secure multicast communication.",
author = "Tseng, {Yuh Min} and Yu, {Chen Hung} and Wu, {Tsu Yang}",
year = "2012",
month = "1",
day = "1",
doi = "10.5755/j01.itc.41.2.846",
language = "English",
volume = "41",
pages = "173--182",
journal = "Information Technology and Control",
issn = "1392-124X",
publisher = "Kauno Technologijos Universitetas",
number = "2",

}

Towards scalable key management for secure multicast communication. / Tseng, Yuh Min; Yu, Chen Hung; Wu, Tsu Yang.

In: Information Technology and Control, Vol. 41, No. 2, 01.01.2012, p. 173-182.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Towards scalable key management for secure multicast communication

AU - Tseng, Yuh Min

AU - Yu, Chen Hung

AU - Wu, Tsu Yang

PY - 2012/1/1

Y1 - 2012/1/1

N2 - Secure multicast communication allows a sender to deliver encrypted messages to a group of authorized receivers. A practical approach is that the sender uses a common key shared by the authorized receivers to encrypt the transmitted messages. The common key must be renewed to ensure forward/backward secrecy when group members leave/join the group, called the rekeying process. Thus, the rekeying problem is a critical issue for secure multicast communication. Many key management schemes have been proposed to improve the performance of the rekeying process. In 2010, Lin et al. proposed two key management schemes without the rekeying process. However, the transmission size required in their schemes increases linearly with the number of group members. In this article, we use the time-bound concept to propose two new key management schemes without the rekeying process. The point is that the required transmission size 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 satisfy the requirements of secure multicast communication.

AB - Secure multicast communication allows a sender to deliver encrypted messages to a group of authorized receivers. A practical approach is that the sender uses a common key shared by the authorized receivers to encrypt the transmitted messages. The common key must be renewed to ensure forward/backward secrecy when group members leave/join the group, called the rekeying process. Thus, the rekeying problem is a critical issue for secure multicast communication. Many key management schemes have been proposed to improve the performance of the rekeying process. In 2010, Lin et al. proposed two key management schemes without the rekeying process. However, the transmission size required in their schemes increases linearly with the number of group members. In this article, we use the time-bound concept to propose two new key management schemes without the rekeying process. The point is that the required transmission size 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 satisfy the requirements of secure multicast communication.

UR - http://www.scopus.com/inward/record.url?scp=84872253011&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84872253011&partnerID=8YFLogxK

U2 - 10.5755/j01.itc.41.2.846

DO - 10.5755/j01.itc.41.2.846

M3 - Article

AN - SCOPUS:84872253011

VL - 41

SP - 173

EP - 182

JO - Information Technology and Control

JF - Information Technology and Control

SN - 1392-124X

IS - 2

ER -