Dynamic secure group key agreement based on n-ary trees
基于n叉树的动态安全群密钥协商协议

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