Efficient Group Key Management Scheme with Hierarchy Structure  

作　　者：LI Dandan ZHANG Runtong WANG Chuanchen 

机构地区：[1]Institute of Information Systems, Beijing Jiaotong University, Beijing 100044,China

出　　处：《Chinese Journal of Electronics》2012年第2期249-253,共5页电子学报（英文版）

摘　　要：With the increase of group communica- tion applications in the Internet, how to provide a secure communication has become an important research issue for network security. In this paper, a distributed group key management approach is proposed, which integrates zero= knowledge set and hierarchy structure. In this newly pro- posed approach, re-key procedure is finished in sub-group so that members in other sub-groups cannot be ai^ected and improve the efficiency. Zero-knowledge set which is used for the key generation and the commitment compu- tation from leaf nodes to root of the key tree, can assure the anonymity of all communication entities. Hierarchy structure is good for addressing the scalability problem of group key management, and it can improve the efficiency and performance of re-key procedure and correspondence. It is demonstrated that the approach can achieve better efficiency in terms of communication, computation, stor- age cost, anonymity and security through comparing to the other schemes.

关 键 词：Group key management Zero-knowledgeset Hierarchy structure Pedersen commitment. 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术] TN915.08[自动化与计算机技术—计算机科学与技术]