An ID-based authenticated dynamic group key agreement with optimal round

Group key agreement protocols are crucial for achieving secure group communications.They are designed to provide a set of users with a shared secret key to achieve cryptographic goal over a public network.When group membership changes,the session key should be refreshed efficiently and securely.Most previous group key agreement protocols need at least two rounds to establish or refresh session keys.In this paper,a dynamic authenticated group key agreement(DAGKA) protocol based on identity-based cryptography is presented.By making use of the members’ values stored in previous sessions,our Join and Leave algorithms reduce the computation and communication costs of members.In the proposed protocol,Setup and Join algorithms need one round.The session key can be refreshed without message exchange among remaining users in Leave algorithm,which makes the protocol more practical.Its security is proved under decisional bilinear Diffie-Hellman(DBDH) assumption in random oracle model.     

三叉树结构下的群认证密钥协商协议

群密钥协商是密钥协商协议的一个重要研究分支。提出了一种在三叉树结构下基于身份的群认证密钥协商协议,充分考虑了成员加入和离开时的子协议。还对方案的安全性和性能进行了分析。结果表明,新方案在计算量减少的前提下实现了协议多方的安全密钥协商。     

基于ECC的高效可认证组密钥协商协议

基于椭圆曲线密码体制(ECC)，建立了一个高效可认证的组密钥协商协议。该方案具有如下特点：(1)协议仅需要两轮交互，就可以实现组密钥协商; (2)利用类ElGamal密码系统，无需使用密钥分享技术，因此减轻了各参与方的计算量与通信负担; (3) 协议能够抵抗自适应选择消息攻击。     

An enhanced authenticated key agreement protocol for wireless mobile communication

With the rapid progress of wireless mobile communication, the authenticated key agreement protocol has attracted an increasing amount of attention. However, due to the limitations of bandwidth and storage of the mobile devices, most of the existing authenticated key agreement protocols are not suitable for wireless mobile communication. Quite recently, Sui et al. have presented an efficient authenticated key agreement protocol based on elliptic curves cryptography and included their protocol in 3GPP2 specifications to improve the security of A-Key distribution. However, in this paper, we show that Sui et al.'s protocol can't resist the off-line password guessing attack, and therefore present an enhanced authenticated key agreement protocol. At the same time, we also consider including our enhanced protocol in 3GPP2 specifications.     

基于身份的移动网动态群组密钥协商方案

群组密钥协商是群组通信中非常重要的基本工具,如何得到一个安全有效的密钥协商协议是当前密码学研究中的一个重要问题。基于双线性对和随机预言模型,针对移动网络提出了一个动态群组密钥协商方案。此方案就计算复杂度和通信复杂度而言都是高效的,而且满足密钥协商所需要的安全要求。     

TTS组密钥协商协议的安全性分析与改进

针对动态对等通信中的组密钥协商协议进行了分析和研究,指出王志伟等人提出的基于树结构和门限思想的组密钥协商协议（TTS）存在密钥控制和不等献性等缺陷,进而给出了一个改进的方案（I-TTS）。安全性分析表明,I-TTS协议不仅克服了TTS协议中的前向安全性和密钥控制缺陷,还满足等献性。     

新的单轮无证书群认证密钥协商协议

群认证密钥协商协议可以使多个参与者在公开信道中建立会话密钥。提出了一种高效的基于PKC的无证书群认证密钥协商协议,由于采用了无证书机制,简化了基于证书的协议中复杂的证书管理问题,同时也解决了基于身份的协议中密钥托管问题。还对新协议进行了严格的形式化证明和计算量的横向比较,结果显示,新协议是安全且高效的。     

A secure and efficient certificateless authenticated key agreement protocol for smart healthcare

As more and more important smart healthcare becomes in people’s daily life, its security issues draw increasing attention. It is stringent to design trusty communication protocol guaranteeing the data security and users privacy. Recently, Wang et al. proposed a certificateless authenticated key agreement (CL-AKA) protocol such that providing a resolution to transmit unforged data over open channel in smart healthcare. Claiming that their protocol could resist attacks from two types of adversaries, Wang et al. also compared their protocol with several related works. However, in this paper, we analyze their protocol and point out that the protocol lacks forward security. Moreover, aiming at remedying such defects, this paper proposes an improved CL-AKA protocol. Not only does the improved CL-AKA protocol satisfy the security requirements but also behaves efficient compared with other related works.