A Group Key Management Scheme Using Core Based Tree and Height Balanced Tree
Summary :
Recently, with the explosive growth of communication technologies, group oriented services such as teleconferencing and multi-player games are increasing. Access to information is controlled through secret communication using a group key shared among members, so efficient updating of group keys is vital to maintaining secrecy of large and dynamic groups. In this paper, we employ (2,4)-tree as a key tree, which is a height balanced tree, to reduce the number of key updates caused by joins or leaves of members. Specifically, we use the CBT (Core Based Tree) to determine the network configuration of the group members to reflect that onto the structure of the key tree. This allows for more efficient updates of group keys when splitting or merging of subgroups occurs by network failure or recovery.
- Publication
- IEICE TRANSACTIONS on Information Vol.E87-D No.10 pp.2329-2338
- Publication Date
- 2004/10/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Application Information Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Taenam CHO, Sang-Ho LEE, "A Group Key Management Scheme Using Core Based Tree and Height Balanced Tree" in IEICE TRANSACTIONS on Information,
vol. E87-D, no. 10, pp. 2329-2338, October 2004, doi: .
Abstract: Recently, with the explosive growth of communication technologies, group oriented services such as teleconferencing and multi-player games are increasing. Access to information is controlled through secret communication using a group key shared among members, so efficient updating of group keys is vital to maintaining secrecy of large and dynamic groups. In this paper, we employ (2,4)-tree as a key tree, which is a height balanced tree, to reduce the number of key updates caused by joins or leaves of members. Specifically, we use the CBT (Core Based Tree) to determine the network configuration of the group members to reflect that onto the structure of the key tree. This allows for more efficient updates of group keys when splitting or merging of subgroups occurs by network failure or recovery.
URL: https://global.ieice.org/en_transactions/information/10.1587/e87-d_10_2329/_p
Copy
@ARTICLE{e87-d_10_2329,
author={Taenam CHO, Sang-Ho LEE, },
journal={IEICE TRANSACTIONS on Information},
title={A Group Key Management Scheme Using Core Based Tree and Height Balanced Tree},
year={2004},
volume={E87-D},
number={10},
pages={2329-2338},
abstract={Recently, with the explosive growth of communication technologies, group oriented services such as teleconferencing and multi-player games are increasing. Access to information is controlled through secret communication using a group key shared among members, so efficient updating of group keys is vital to maintaining secrecy of large and dynamic groups. In this paper, we employ (2,4)-tree as a key tree, which is a height balanced tree, to reduce the number of key updates caused by joins or leaves of members. Specifically, we use the CBT (Core Based Tree) to determine the network configuration of the group members to reflect that onto the structure of the key tree. This allows for more efficient updates of group keys when splitting or merging of subgroups occurs by network failure or recovery.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - A Group Key Management Scheme Using Core Based Tree and Height Balanced Tree
T2 - IEICE TRANSACTIONS on Information
SP - 2329
EP - 2338
AU - Taenam CHO
AU - Sang-Ho LEE
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E87-D
IS - 10
JA - IEICE TRANSACTIONS on Information
Y1 - October 2004
AB - Recently, with the explosive growth of communication technologies, group oriented services such as teleconferencing and multi-player games are increasing. Access to information is controlled through secret communication using a group key shared among members, so efficient updating of group keys is vital to maintaining secrecy of large and dynamic groups. In this paper, we employ (2,4)-tree as a key tree, which is a height balanced tree, to reduce the number of key updates caused by joins or leaves of members. Specifically, we use the CBT (Core Based Tree) to determine the network configuration of the group members to reflect that onto the structure of the key tree. This allows for more efficient updates of group keys when splitting or merging of subgroups occurs by network failure or recovery.
ER -
English
