【摘要】 TGDH协议是一种较好的适合于对等群组的密钥管理方案,通过对该协议的分析,发现该协议在通信方式上存在不足,密钥更新协议使用了多余的消息,需要占用更多的带宽.本文通过设计一个求密钥关联集的预备算法,利用该算法重新设计了密钥更新协议,改进了TGDH密钥更新协议通信方式的不足.理论分析结果表明:改进后的协议有效降低了TGDH协议的通信负载和密钥存储负载,使通信带宽从O(nlogn)降低为O(n),节点的密钥存储量由O(n)降低为O(logn);仿真实验结果进一步表明改进后的协议具有更好的通信性能.更多还原

【Abstract】 The Tree-based Group Diffie-Hellman Protocol is a fairly good key management scheme for dynamic peer group communications. Through analyzing TGDH protocol, the authors have found out that a deficiency exists with its mode of communication. A lot of redundant messages are used to complete group re-keying so that more communication bandwidth will be consumed in TGDH. This paper aims to solve the deficiency and improve TGDH through designing a preparatory algorithm of finding a Key Association Set. A new re-keying protocol is also designed by using the algorithm. Theoretical analysis shows that our protocol effectively decreases the communication and storage overload of TGDH, with the communication bandwidth descending from O(nlogn) to O(n) and the key storage descending from O(n) to O(logn). The simulation result also shows the improved protocol has a better communication performance.更多还原