王志伟,谷大武.基于树结构和门限思想的组密钥协商协议.软件学报,2004,15(6):924-927 |
基于树结构和门限思想的组密钥协商协议 |
A Group Key Agreement Protocol Based on Tree and Threshold Idea |
投稿时间:2004-06-01 |
DOI: |
中文关键词: 群组通信 组密钥协商 密钥树 门限方案 |
英文关键词:group communication group key agreement key tree threshold scheme |
基金项目:Supported by the National Natural Science Foundation of China under Grant No.60203012(国家自然科学基金) |
|
摘要点击次数: 3547 |
全文下载次数: 3905 |
中文摘要: |
动态对等通信(dynamic peer communication)是目前最复杂的群组通信方式之一.简要分析了近几年提出的适合这种通信方式的5种组密钥协商协议,即CKD(centralized key distribution)协议、BD(burmester-desmedt)协议、STR(steer,et a1.)协议.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. |
HTML 下载PDF全文 查看/发表评论 下载PDF阅读器 |