计算有效的分布式组密钥管理方案

Computation Efficient Distributed Group Key Management Scheme

基于Diffie-Hellman密钥交换协议以及逻辑密钥树的思想,提出了一种分布式组密钥管理方案.与当前基于DH密钥交换协议中性能最优的TGDH方案相比,组成员加入时,模指数运算次数最多的组成员的模指数运算开销降低了33%.如果不引起逻辑密钥树平衡性失调,组成员退出时新方案中不需要模指数运算,即使引起逻辑密钥树平衡性失调,新方案中指数运算最多的组成员的模指数运算开销也降低了33%.

Based on Diffie-Hellman（DH） key exchange protocol and the thought of logical keys tree, a distributed group key management scheme was presented. Compared with TGDH scheme which is currently the best one among those based on DH protocol, when a member joins into the group, new scheme reduces the modular exponential computation cost of the member which need the most modular exponential computation by 33%. If the leaving of a member does not result in unbalance of the logical keys tree, modular exponential compuataion is not needed in new scheme. Even the leaving of a member results in unbalance of the logical keys tree, the new scheme reduces the modular exponential computation cost of the member which need the most modular exponential computation by 33 % also.