A Key Tree Merge Algorithm in Multi-privileged Groups
Computational Science and Engineering（2013）
摘要
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.
更多查看译文
关键词
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
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要