摘要
基于成员离开概率对TGDH协议进行优化。证明当密钥树为Huffman时,改进后的P-TGDH协议中,平均成员密钥更新量和平均指数运算时间开销均可达到最优。
We improve TGDH protocol based the probability of members leaving. When using Huffman tree as the key tree, this paper proves that the average cost of re - keying and the average time cost of exponentation computation of each member is optimal in P- TGDH protocol.
出处
《计算技术与自动化》
2005年第3期66-68,共3页
Computing Technology and Automation
基金
国家自然科学基金资助项目(60272011)