%0 Journal Article
%T Dynamic secure group key agreement based on n-ary trees<br>基于n叉树的动态安全群密钥协商协议
%A GAO Wei
%A HU Yu-pu
%A YANG Hong-mei
%A <br>高玮
%A 胡予濮
%A 杨红梅
%J 计算机应用研究
%D 2009
%I 
%X 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...
%K authenticated group key agreement
%K dynamic scenario
%K provably security
%K n-ary trees
%K random oracle security model<br>可认证群密钥协商
%K 动态情况
%K 可证明安全
%K n叉树
%K 随机预言机模型
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=A45BF62A783716E8AE8C7CDCDACB91CC&yid=DE12191FBD62783C&vid=96C778EE049EE47D&iid=B31275AF3241DB2D&sid=9D10F378015F2AC2&eid=C7323805325ABBEB&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=9