A-ary Tree-based Minimum Exact Cover of Leaf Set for Secure Group Communication in Grids
Secure multicast is an effective group communication technology for information sharing and message exchange in emerging grids. As the group scale in grids may be very large and group members can be very unstable (a member can join or quit the group dynamically), it is hard for conventional group key management schemes to satisfy the efficiency of group key distribution very well because of the complexity of O(c. logn)( n is the group size, and c is the total additions/evictions). This paper gives a minimum exact cover problem of leaf set and discusses its solution based on an a-ary tree model. The correctness of the solution is proven theoretically. Furthermore, the implementation and application of it is illustrated. Both complexity analysis and simulation demonstrate the efficiency and effectiveness of the achievement of group key distribution based on minimum exact cover.
Shouzhi XU Tingyao Jiang Alin Zhong Wangmin Yang Lili Zhang Qiaoli Liu
College of Electronics Engineering & Information Technology, China Three Gorges University.Yichuang, Hubei, 430074, China
国际会议
第六届网格与协同计算国际会议(The Sixth International Conference on Grid and Cooperative Computing GCC 2007)
乌鲁木齐
英文
11-18
2007-08-16（万方平台首次上网日期，不代表论文的发表时间）