基于n叉树动态安全群密钥协商协议.docVIP

基于n叉树动态安全群密钥协商协议 　　摘 要：将三叉树拓展为n叉树引入到群密钥中，提出了动态安全的基于n叉树的可认证群密钥协商协议。在三叉树的基础上进一步减少了轮数，计算复杂度由O(log3 m)降低为O(logn m)，但是单轮内成员间通信量增加。群内成员先进行树结构的划分，每n个节点作为相应上一级节点的孩子节点，n个节点分别选定代表，n个代表通过调用协议BCP协商密钥得到本轮即相应父亲节点的子密钥，重复进行上述过程最终可以得到群组密钥。同时，协议考虑了有成员加入或离开的动态情形并给出了很好的解决方案，一方面保证了动态情形发生时，在前一时刻计算出结果的基础上作最小的修改就能得到新的密钥，从而减少了计算量；另一方面动态方案保持了树的结构始终均衡。其意义在于，如果成员加入或离开后树的结构不能保持，下一步加入或离开就不能顺利进行，需重新进行树结构的划分。最后基于随机预言机模型的安全性分析证明了协议是安全的。 　　关键词：可认证群密钥协商；动态情况；可证明安全；n叉树；随机预言机模型 　　中图分类号：TP309文献标志码：A 　　文章编号：1001-3695(2009)06-2180-04 　　doi:10.3969/j.issn.1001-3695.2009.06.055 　　 　　Dynamic secure group key agreement based on n-ary trees 　　GAO Wei，HU Yu-pu，YANG Hong-mei 　　(Key Laboratory of Computer Network Information Security for Ministry of Educational, Xidian University, Xi’an 710071, China) 　　Abstract:This paper presented a secure authenticated group key agreement protocol based on n-ary trees in dynamic scenario by introducing n-ary trees obtained by extending ternary trees into key agreement protocol, which reduced more rounds than the ones with ternary trees and reduced computation complexity from O(log3 m) to O（logn m）. But in just one round, the communication complexity increased due to the flows passed between parties increase. Parties were first partitioned to form a tree, then n representations from n nodes which were children nodes of the corresponding father node in the above level agree on a group key in this round by invoking the BCP scheme. Repeating the above process, the group key was obtained finally. At the same time, the scheme took into account the dynamic case which contained the join and leave scenario and presented a good solution.On one hand,it ensured the minimum modification to the computation already precomputed just before the dynamic case happened to reduce computation complexity.On the other hand,concerned the solution retained the tree structure while such dynamic operations (join or leave) because if the tree structure was not maintained after a join or leave