Please use this identifier to cite or link to this item:

Title: Key Management Scheme for Cumulative Member Removal and Bursty Behavior in Secure Group Communication Using m-ary Tree
Authors: Aparna, R.;Amberker, B.B.
Keywords: Secure Group Communication;m-ary Key Tree;Key Distribution Center;Cumulative Member Removal;Bursty Behavior;Encryption Keys
Date: 2012-09
Issue Date: 2016-08-16 16:02:54 (UTC+8)
Abstract: Secure group communication is an important research area and numerous applications are relied upon secure group communication model. Since the group is dynamic in nature, rekeying must be carried out in an efficient manner. Member leave event should be handled carefully compared to member join event. In some applications like pay-per-view, periodical electronic information distribution etc., many users join and leave the group at the same moment known as bursty behavior. In this paper, we propose schemes for handling cumulative member removal and bursty behavior. We use m-ary key tree for managing the secure group and maintain only m keys at each level of the key tree. We start with a scheme for cumulative member removal and then we handle all the possible bursty behavior scenarios. We analyze the communication and computation costs for worst cases. We compare the costs of our scheme with the schemes proposed by Li et al. (2001) and binary key tree scheme of Zou, Magliveras, and Ramamurthy (2002). We show that in our scheme the number of new keys generated and encryptions performed are less compared to Li et al. (2001) and Zou, Magliveras, and Ramamurthy (2002) schemes.
Relation: 資管評論, 18(1), 71-91
MIS review
Data Type: article
Appears in Collections:[資管評論] 期刊論文

Files in This Item:

File SizeFormat
18(1)-71-91.pdf1271KbAdobe PDF402View/Open

All items in 學術集成 are protected by copyright, with all rights reserved.

社群 sharing