Paper Info
Title
A Key Tree Merge Algorithm in Multi-privileged Groups
Abstract
Many group key management schemes designed for hierarchical access control have been put forward recently. Some of these schemes use the integrated key graph to provide multiple levels of access control. However, most of these schemes focused on the efficiency of group key establishment and rekeying in centralized group key management schemes and didn't indicate how to generate the key graph. In this paper, we presented a Multiple Key tree Merge (MKM) algorithm to generate the optimal key graph and improve the group key establishment and rekeying efficiency of contributory group key agreement schemes. Efficiency evaluation indicates that an approximately 30% reduction in computation overhead is achieved compared with that of the MG scheme.
Year
DOI
Venue
2013
10.1109/CSE.2013.53
C3S2E
Keywords
Field
DocType
group key management scheme,computation overhead,time efficiency,hierarchical access control,centralized group key management schemes,contributory group key agreement,cryptography,trees (mathematics),rekeying efficiency,multi-privileged groups,multiprivileged groups,integrated key graph,key tree merge algorithm,key graph,merging,authorisation,centralized group key management,optimal key graph,mg scheme,multiple key tree merge algorithm,group key establishment,efficiency evaluation,group key agreement schemes,mkm algorithm,access control
Group key,Merge algorithm,Tree (graph theory),Algorithm design,Computer science,Cryptography,Computer network,Theoretical computer science,Rekeying,Access control,Distributed computing,Computation
Conference
ISSN
Citations 
PageRank 
1949-0828
2
0.38
References 
Authors
17
3
Name
Order
Citations
PageRank
Xiaozhuo Gu1174.79
Yongming Wang267.97
Weihua Zhou394.01