基于m叉树与DMDH假设的组密钥协商协议  

Group key agreement protocol based on m-tree and DMDH assumption

作　　者：张志军[1] 刘伟[1] 郭渊博[1] 吕金娜[2] 袁顺[1] 

机构地区：[1]解放军信息工程大学电子技术学院 [2]郑州大学信息工程学院河南省信息网络重点学科开放实验室

出　　处：《计算机工程与设计》2010年第3期461-464,共4页Computer Engineering and Design

基　　金：国家863高技术研究发展计划基金项目(2007AA01Z405);国家自然科学基金项目(60503012)

摘　　要：针对动态对等通信环境下为提高群组密钥协商高效性与可扩展性,提出一种基于m叉树与DMDH假设的组密钥协商协议。该协议将m叉树结构与DMDH假设有机集合,通过协商可变m确定密钥树,从多线性映射簇中选择与之对应的多线性映射,进行群组密钥协商计算。同时可变m叉树结构来平衡该协议的计算开销与通信开销,更好地同时适用局域网与广域网环境,与TGDH、GDH相比,其有更好的安全性、高效性与可扩展性。A group key agreement protocol based on m-tree and DMDH assumption is developed to improve the poor scalability and efficiency of most existing group key agreement protocols in dynamic peer communication.This protocol combined m-tree with DMDH assumption,which key agreement is completed by which all group members agreed on variable m to fix on key tree and selected corresponding multilinear map from cluster of multilinear maps.Meanwhile,it much more applied to LAN and WAN by which communication and computation costs are balanced by variable m.Compared with TGDH and GDH,it made a great progress in security,scalability and efficiency.

关 键 词：动态对等通信 安全群组通信 组密钥协商 m叉树 DMDH假设 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]