Efficient multicast key management for stateless receivers

Ju Hee Ki, Hyun Jeong Kim, Dong Hoon Lee, Chang Seop Park

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

In a multicast communication system, group members possess a common group key and communicate using the key. For the communication between group members the group key must be managed securely and efficiently. Especially in a dynamic and large group the efficiency of the group key management is critical since the size of deleted or added members may be quite large. Most schemes proposed in the literature implicitly assume that members is constantly on-line, which is not realizable in many receiving devices. In the paper, we propose a hierarchical binary tree-based key management scheme for a dynamic large group with one group controller(GC), especially well suitable to stateless receivers, who do not update their state from session to session. In our scheme, all re-keying messages except for unicast of a individual key are transmitted without any encryption, all computation needed for re-keying is O(log2 n) applications of one-way hash function and XOR operation, and all information needed for re-keying is in the current blinded factors and the initial information. The proposed scheme provides both backward and forward secrecy. If a bulletin board is used, each member can compute all needed keys without any re-keying messages.

Original languageEnglish
Pages (from-to)497-509
Number of pages13
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2587
Publication statusPublished - 2003 Dec 1

Fingerprint

Key Management
Multicast
Receiver
Communication
Bulletin boards
Binary trees
Hash functions
Confidentiality
Cryptography
Communication systems
Equipment and Supplies
Controllers
One-way Hash Function
Binary Tree
Encryption
Communication Systems
Update
Controller

Keywords

  • Group communication
  • Key management
  • Multicast

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Efficient multicast key management for stateless receivers. / Ki, Ju Hee; Kim, Hyun Jeong; Lee, Dong Hoon; Park, Chang Seop.

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2587, 01.12.2003, p. 497-509.

Research output: Contribution to journalArticle

@article{71859e7a0cb240819c5bdf61089909e4,
title = "Efficient multicast key management for stateless receivers",
abstract = "In a multicast communication system, group members possess a common group key and communicate using the key. For the communication between group members the group key must be managed securely and efficiently. Especially in a dynamic and large group the efficiency of the group key management is critical since the size of deleted or added members may be quite large. Most schemes proposed in the literature implicitly assume that members is constantly on-line, which is not realizable in many receiving devices. In the paper, we propose a hierarchical binary tree-based key management scheme for a dynamic large group with one group controller(GC), especially well suitable to stateless receivers, who do not update their state from session to session. In our scheme, all re-keying messages except for unicast of a individual key are transmitted without any encryption, all computation needed for re-keying is O(log2 n) applications of one-way hash function and XOR operation, and all information needed for re-keying is in the current blinded factors and the initial information. The proposed scheme provides both backward and forward secrecy. If a bulletin board is used, each member can compute all needed keys without any re-keying messages.",
keywords = "Group communication, Key management, Multicast",
author = "Ki, {Ju Hee} and Kim, {Hyun Jeong} and Lee, {Dong Hoon} and Park, {Chang Seop}",
year = "2003",
month = "12",
day = "1",
language = "English",
volume = "2587",
pages = "497--509",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Efficient multicast key management for stateless receivers

AU - Ki, Ju Hee

AU - Kim, Hyun Jeong

AU - Lee, Dong Hoon

AU - Park, Chang Seop

PY - 2003/12/1

Y1 - 2003/12/1

N2 - In a multicast communication system, group members possess a common group key and communicate using the key. For the communication between group members the group key must be managed securely and efficiently. Especially in a dynamic and large group the efficiency of the group key management is critical since the size of deleted or added members may be quite large. Most schemes proposed in the literature implicitly assume that members is constantly on-line, which is not realizable in many receiving devices. In the paper, we propose a hierarchical binary tree-based key management scheme for a dynamic large group with one group controller(GC), especially well suitable to stateless receivers, who do not update their state from session to session. In our scheme, all re-keying messages except for unicast of a individual key are transmitted without any encryption, all computation needed for re-keying is O(log2 n) applications of one-way hash function and XOR operation, and all information needed for re-keying is in the current blinded factors and the initial information. The proposed scheme provides both backward and forward secrecy. If a bulletin board is used, each member can compute all needed keys without any re-keying messages.

AB - In a multicast communication system, group members possess a common group key and communicate using the key. For the communication between group members the group key must be managed securely and efficiently. Especially in a dynamic and large group the efficiency of the group key management is critical since the size of deleted or added members may be quite large. Most schemes proposed in the literature implicitly assume that members is constantly on-line, which is not realizable in many receiving devices. In the paper, we propose a hierarchical binary tree-based key management scheme for a dynamic large group with one group controller(GC), especially well suitable to stateless receivers, who do not update their state from session to session. In our scheme, all re-keying messages except for unicast of a individual key are transmitted without any encryption, all computation needed for re-keying is O(log2 n) applications of one-way hash function and XOR operation, and all information needed for re-keying is in the current blinded factors and the initial information. The proposed scheme provides both backward and forward secrecy. If a bulletin board is used, each member can compute all needed keys without any re-keying messages.

KW - Group communication

KW - Key management

KW - Multicast

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

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

M3 - Article

VL - 2587

SP - 497

EP - 509

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SN - 0302-9743

ER -