1. NCCU Academic Hub
  2. Publications
  3. Journals of NCCU
  4. Journal Articles
  5. Item

Publications-Journal Articles

Article View/Open

Publication Export

Google ScholarTM

NCCU Library

Citation Infomation

Related Publications in TAIR

題名 Key Management Scheme for Cumulative Member Removal and Bursty Behavior in Secure Group Communication Using m-ary Tree
作者 Aparna, R.;Amberker, B.B.
關鍵詞 Secure Group Communication;m-ary Key Tree;Key Distribution Center;Cumulative Member Removal;Bursty Behavior;Encryption Keys
日期 2012-09
上傳時間 16-Aug-2016 16:02:54 (UTC+8)
摘要 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.
關聯 資管評論, 18(1), 71-91
MIS review
資料類型 article
dc.creator (作者) Aparna, R.;Amberker, B.B.
dc.date (日期) 2012-09
dc.date.accessioned 16-Aug-2016 16:02:54 (UTC+8)-
dc.date.available 16-Aug-2016 16:02:54 (UTC+8)-
dc.date.issued (上傳時間) 16-Aug-2016 16:02:54 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/100303-
dc.description.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.
dc.format.extent 1302450 bytes-
dc.format.mimetype application/pdf-
dc.relation (關聯) 資管評論, 18(1), 71-91
dc.relation (關聯) MIS review
dc.subject (關鍵詞) Secure Group Communication;m-ary Key Tree;Key Distribution Center;Cumulative Member Removal;Bursty Behavior;Encryption Keys
dc.title (題名) Key Management Scheme for Cumulative Member Removal and Bursty Behavior in Secure Group Communication Using m-ary Tree
dc.type (資料類型) article