文献类型：期刊文献

中文题名：基于树结构和门限思想的组密钥协商协议

英文题名：A Group Key Agreement Protocol Based on Tree and Threshold Idea

作者：王志伟[1];谷大武[2]

机构：[1]华东理工大学计算机科学与工程系,上海200237;[2]上海交通大学计算机科学与工程系,上海200030

年份：2004

卷号：15

期号：6

起止页码：924

中文期刊名：软件学报

外文期刊名：Journal of Software

收录：CSTPCD;;Scopus;北大核心:【北大核心2000】；CSCD:【CSCD2011_2012】；

基金：国家自然科学基金~~

语种：中文

中文关键词：群组通信;组密钥协商;密钥树;门限方案

外文关键词：group communication; group key agreement; key tree; threshold scheme

摘要：动态对等通信(dynamic peer communication)是目前最复杂的群组通信方式之一.简要分析了近几年提出的适合这种通信方式的5种组密钥协商协议,即CKD(centralized key distribution)协议、BD(burmester-desmedt)协议、STR(steer, et al.)协议、GDH(group diffie-hellman)协议和TGDH(tree-based group diffie-hellman)协议,进而提出了一种基于树结构和门限思想的组密钥协商协议TTS(tree and threshold scheme).与现有的协议比较,TTS协议在计算量方面具有较大优势,适用于现有的网络环境.
Dynamic peer communication is the most complicated of all the group communication mode. The paper concisely analysed five typical group key agreement protocols put forward in recent years, they are: centralized key distribution (CKD), burmester-desmedt (BD), steer et al. (STR), group diffie-hellman (GDH) and tree-based group diffie-hellman (TGDH). A new group key agreement protocol (TTS) is proposed and compared with other protocols. This protocol has the advantage in computation, and fit to common network condition.