Abstract:
The ideas of group re-keying algorithms based on secret sharing using the LKH tree are proposed in this paper. The algorithms construct a message using secret sharing with the dynamic change of group members. The group members can reconstruct the new group key. It is proved that the new algorithms have obvious superiority than that of the previously proposed algorithms on communication and computation, and are suitable for large dynamic group.
Key words:
group key management,
secret sharing,
key tree,
re-keying
摘要: 提出一种基于秘密共享的组播密钥更新算法。采用二叉逻辑密钥树结构,根据组成员状态变化,利用秘密共享的思想构造广播消息,使组成员可以逐步计算组密钥,而非组成员不能计算组密钥,从而实现组密钥更新。分析表明,与采用逻辑密钥树的算法相比,该算法能降低密钥更新时的通信量和计算量,适用于大型的动态群组通信。
关键词:
组密钥管理,
秘密共享,
密钥树,
密钥更新
CLC Number:
DIAO Long-Quan, SU Jin-Hai. Group Re-keying Algorithm Based on Secret Sharing[J]. Computer Engineering, 2010, 36(21): 149-151.
赵龙泉, 苏锦海. 基于秘密共享的组播密钥更新算法[J]. 计算机工程, 2010, 36(21): 149-151.