首页 | 本学科首页   官方微博 | 高级检索  
     

计算有效的分布式组密钥管理方案
引用本文:张勇,张翼,唐业,汪为农. 计算有效的分布式组密钥管理方案[J]. 上海交通大学学报, 2007, 41(1): 60-65
作者姓名:张勇  张翼  唐业  汪为农
作者单位:上海交通大学,计算机科学与工程系,上海,200030;上海交通大学,网络信息中心,上海,200030;上海交通大学,计算机科学与工程系,上海,200030;上海交通大学,网络信息中心,上海,200030
摘    要:基于Diffie-Hellman密钥交换协议以及逻辑密钥树的思想,提出了一种分布式组密钥管理方案.与当前基于DH密钥交换协议中性能最优的TGDH方案相比,组成员加入时,模指数运算次数最多的组成员的模指数运算开销降低了33%.如果不引起逻辑密钥树平衡性失调,组成员退出时新方案中不需要模指数运算,即使引起逻辑密钥树平衡性失调,新方案中指数运算最多的组成员的模指数运算开销也降低了33%.

关 键 词:安全组通信  组密钥管理  组密钥协定
文章编号:1006-2467(2007)01-0060-06
修稿时间:2005-12-14

Computation Efficient Distributed Group Key Management Scheme
ZHANG Yong,ZHANG Yi,TANG Ye,WANG Wei-nong. Computation Efficient Distributed Group Key Management Scheme[J]. Journal of Shanghai Jiaotong University, 2007, 41(1): 60-65
Authors:ZHANG Yong  ZHANG Yi  TANG Ye  WANG Wei-nong
Abstract:Based on Diffie-Hellman(DH) key exchange protocol and the thought of logical keys tree,a distributed group key management scheme was presented.Compared with TGDH scheme which is currently the best one among those based on DH protocol,when a member joins into the group,new scheme reduces the modular exponential computation cost of the member which need the most modular exponential computation by 33%.If the leaving of a member does not result in unbalance of the logical keys tree,modular exponential compuataion is not needed in new scheme. Even the leaving of a member results in unbalance of the logical keys tree,the new scheme reduces the modular exponential computation cost of the member which need the most modular exponential computation by 33% also.
Keywords:secure group communication  group key management  group key agreement
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号