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

将三叉树拓展为n叉树引入到群密钥中，提出了动态安全的基于n叉树的可认证群密钥协商协议。在三叉树的基础上进一步减少了轮数，计算复杂度由O(log3 m)降低为O(logn m)，但是单轮内成员间通信量增加。群内成员先进行树结构的划分，每n个节点作为相应上一级节点的孩子节点，n个节点分别选定代表，n个代表通过调用协议BCP协商密钥得到本轮即相应父亲节点的子密钥，重复进行上述过程最终可以得到群组密钥。同时，协议考虑了有成员加入或离开的动态情形并给出了很好的解决方案，一方面保证了动态情形发生时，在前一时刻计算出结

Dynamic secure group key agreement based on n ary trees

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...