The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
수많은 장치를 포함하는 멀티캐스트 콘텐츠 서비스에는 핵심 구성 요소 중 하나로 효율적인 그룹 키 관리 체계가 필요합니다. 그룹 키 관리의 목적은 브로드캐스팅이나 멀티캐스팅을 통해 전송되는 메시지가 비회원에게 노출되지 않도록 그룹 구성원 간에 안전한 키 공유 방식을 제공하는 것입니다. CRGK(중국어 나머지 그룹 키)는 CRT(중국어 나머지 정리)를 기반으로 하는 효율적인 그룹 키 관리 방식입니다. 키 재설정 메시지 수, 사용자 측 키 계산 비용 및 저장된 키 수를 최적화합니다. 그러나 CRGK는 CRT의 계산 복잡성이 높기 때문에 구성원 수가 많은 그룹에는 적합하지 않습니다. 본 논문에서는 구성원 수가 많은 그룹을 지원하는 Hierarchical CRGK(HCRGK) 방식을 제안한다. 우리는 CRGK를 채택하여 다음을 포함하도록 개선했습니다. n-ary 트리 구조. 트리 접근 방식은 그룹 키 계산을 하위 그룹에 분산하여 그룹 키 관리를 단순화합니다. 우리의 계획에는 최대 (로그 m N + 1) 다음과 같은 그룹에 대한 메시지 재입력 N 그룹이 매우 큰 경우에도 구성원이 적고 계산 시간이 짧습니다.
그룹 키 관리, 키 다시 입력, 중국의 나머지 정리, 멀티 캐스트, 방송
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Jihyun PARK, Jeongsu LEE, Jeonghyun KIM, Jaecheol RYOU, "Hierarchical CRGK Supporting a Secure Multicast Communication for a Large Number of Users" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 4, pp. 862-870, April 2010, doi: 10.1587/transcom.E93.B.862.
Abstract: A multicast content service, including numerous devices, requires an efficient group key management scheme as one of its core components. The purpose of group key management is to provide a secure key-sharing scheme among the members of a group so that messages transmitted via broadcasting or multicasting are not exposed to non-members. The Chinese Remaindering Group Key (CRGK) is an efficient group key management scheme based on the Chinese Remainder Theorem (CRT). It optimizes the number of re-key messages, the user-side key computation cost, and the number of stored keys. However, CRGK is not fit for a group with a large number of members because of the high computation complexity of the CRT. In this paper, we propose a Hierarchical CRGK (HCRGK) scheme that supports a group with a large number of members. We improved CRGK by adopting it to include an n-ary tree structure. The tree approach simplifies the group key management by distributing the group key computation to subgroups. Our scheme requires at most (log m N + 1) re-key messages for a group with N members and a short computation time even when the group is very large.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.862/_p
부
@ARTICLE{e93-b_4_862,
author={Jihyun PARK, Jeongsu LEE, Jeonghyun KIM, Jaecheol RYOU, },
journal={IEICE TRANSACTIONS on Communications},
title={Hierarchical CRGK Supporting a Secure Multicast Communication for a Large Number of Users},
year={2010},
volume={E93-B},
number={4},
pages={862-870},
abstract={A multicast content service, including numerous devices, requires an efficient group key management scheme as one of its core components. The purpose of group key management is to provide a secure key-sharing scheme among the members of a group so that messages transmitted via broadcasting or multicasting are not exposed to non-members. The Chinese Remaindering Group Key (CRGK) is an efficient group key management scheme based on the Chinese Remainder Theorem (CRT). It optimizes the number of re-key messages, the user-side key computation cost, and the number of stored keys. However, CRGK is not fit for a group with a large number of members because of the high computation complexity of the CRT. In this paper, we propose a Hierarchical CRGK (HCRGK) scheme that supports a group with a large number of members. We improved CRGK by adopting it to include an n-ary tree structure. The tree approach simplifies the group key management by distributing the group key computation to subgroups. Our scheme requires at most (log m N + 1) re-key messages for a group with N members and a short computation time even when the group is very large.},
keywords={},
doi={10.1587/transcom.E93.B.862},
ISSN={1745-1345},
month={April},}
부
TY - JOUR
TI - Hierarchical CRGK Supporting a Secure Multicast Communication for a Large Number of Users
T2 - IEICE TRANSACTIONS on Communications
SP - 862
EP - 870
AU - Jihyun PARK
AU - Jeongsu LEE
AU - Jeonghyun KIM
AU - Jaecheol RYOU
PY - 2010
DO - 10.1587/transcom.E93.B.862
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2010
AB - A multicast content service, including numerous devices, requires an efficient group key management scheme as one of its core components. The purpose of group key management is to provide a secure key-sharing scheme among the members of a group so that messages transmitted via broadcasting or multicasting are not exposed to non-members. The Chinese Remaindering Group Key (CRGK) is an efficient group key management scheme based on the Chinese Remainder Theorem (CRT). It optimizes the number of re-key messages, the user-side key computation cost, and the number of stored keys. However, CRGK is not fit for a group with a large number of members because of the high computation complexity of the CRT. In this paper, we propose a Hierarchical CRGK (HCRGK) scheme that supports a group with a large number of members. We improved CRGK by adopting it to include an n-ary tree structure. The tree approach simplifies the group key management by distributing the group key computation to subgroups. Our scheme requires at most (log m N + 1) re-key messages for a group with N members and a short computation time even when the group is very large.
ER -