摘要
针对以往群组密钥协商限于孤立模型下讨论的问题，基于m叉树的判定Diffie-Hellman假设，使用通用可组合安全( UC安全)理论设计了一个群组密钥协商协议，并根据协议需要满足的安全目标，形式化地建立了协议的安全模型，通过对协议安全模块的设计和实现，证明了该协议满足UC安全性质。和同类协议相比，降低了密钥更新所需要的通信和计算开销，同时支持群组成员的动态加入和退出。
Abstract
Aiming at the fact that the concurrent group key agreement ( GKA ) protocol is discussed only within the isolate model, and based on m-ary tree decisional Diffie-Hellman within the framework of uni-versally composable ( UC) security, a group key agreement protocol is designed, and the ideal functional-ity model for GKA protocol formulated. The security modular design and implementation of GKA protocol indicates that this protocol could meet the requirement of UC security. Compared with the similar protocol of GKA, this new protocol has the advantages of less communication and computation overhead, while sup-ports group members in their dynamic joining and exiting.
NETL
NSTL
维普
万方数据