计算机应用研究
計算機應用研究
계산궤응용연구
APPLICATION RESEARCH OF COMPUTERS
2010年
2期
682-684,688
,共4页
动态对等群组%密钥协商%身份树%双线性对
動態對等群組%密鑰協商%身份樹%雙線性對
동태대등군조%밀약협상%신빈수%쌍선성대
dynamic peer groups%key agreement%identity tree%bilinear pairing
针对设计高效的分布式密钥协商方案是动态对等群组组播通信的难点,提出了一个新的基于Merkle身份树的密钥协商方案,并具体地分析了子组之间的通信过程,以及组成员动态变化时密钥的更新过程.结果表明该方案在降低计算和通信代价方面取得了较好的效果.
針對設計高效的分佈式密鑰協商方案是動態對等群組組播通信的難點,提齣瞭一箇新的基于Merkle身份樹的密鑰協商方案,併具體地分析瞭子組之間的通信過程,以及組成員動態變化時密鑰的更新過程.結果錶明該方案在降低計算和通信代價方麵取得瞭較好的效果.
침대설계고효적분포식밀약협상방안시동태대등군조조파통신적난점,제출료일개신적기우Merkle신빈수적밀약협상방안,병구체지분석료자조지간적통신과정,이급조성원동태변화시밀약적경신과정.결과표명해방안재강저계산화통신대개방면취득료교호적효과.
Designing efficient distributive key agreement scheme was a difficult problem in multicast communication of dyna-mic peer groups.This paper proposed a new key agreement scheme for multicast groups based on Merkle identity tree .Then analyzed the procedures of secret communications between subgroups and updating of group keys with the dynamic change of group members in detail.The analysis shows that the new scheme is efficient in computation and communication.
