检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:曾继强 史国振[2] Zeng Jiqiang;Shi Guozhen(School of Telecommunications Engineering,Xidian University,Xi'an 710071,Shaanxi,China;Beijing Electronic Science and Technology Institute,Beijing 100070,China)
机构地区:[1]西安电子科技大学通信工程学院,陕西西安710071 [2]北京电子科技学院,北京100070
出 处:《计算机应用与软件》2018年第9期311-316,共6页Computer Applications and Software
摘 要:随着互联网的飞速发展,通信工具以及通信方式越来越多。从以前的单点传播发展到现在的组播,例如群组聊天、视频会议等。随着通信工具的普及,通信的安全越来越受到重视。对于安全的群组通信,必须在组成员之间提供消息的完整性、成员身份验证和机密性。为了提供消息的完整性,必须保证群组成员在公共会话密钥协商达成一致,以便对群组通信的数据进行加解密。提出一种高效的群组密钥协商协议。通过基于Diffie Hellman密钥交换协议的椭圆曲线算法(ECC)来支持群组成员加入、离开等操作。采用三叉树来实现群组密钥的生成,并与现有方案进行比较,结果表明,该方案在通信和计算方面具有优势。With the rapid development of the Internet, there are more and more communication tools and communication methods. They propagate from single point to current multicast, such as group communication, video conference and so on. With the popularization of communication tools, more and more attention has been paid to the security of communication. For secure group communication, message integrity, membership authentication, and confidentiality must be provided between group members. To provide the integrity of the message, the group members must be ensured to agree on a public session key negotiation in order to encrypt and decrypt the data of the group communication. In this paper, we proposed an efficient group key agreement protocol. It supported group members to join and leave by using elliptic curve cryptography(ECC) on the basis of the Diffie Hellman exchange protocol. This protocol employed ternary tree structure in the process of group key generation. Compared with the existing schemes, the protocol has advantages in communication and calculation.
关 键 词:椭圆曲线算法(ECC) 群组密钥协商 三叉树
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.188