International Journal of Embedded Systems

An authenticated hierarchical asymmetric group key agreement protocol based on identity

Qikun Zhang, Zengyu Cai, Yong Gan, Yuan Zhuang, Bingli Wang

Published Jan 1, 2019• 0 citations

Abstract

Asymmetric group key agreement protocol is to negotiate a shared group encryption key. Each member can calculate a decryption key corresponding to the encryption key. With the rapid development of network and system technology, secure information exchange has been one of the foci. In this paper, we propose an authenticated hierarchical asymmetric group key agreement protocol based on identity. Based on the realisation of a round of asymmetric group key agreement, the protocol carries out a second round of agreement. Different levels of secrets exchange information between a group of players with different permissions as the number of rounds increases, which can achieve anonymity and authentication and support dynamic group key updating of nodes to achieve forward and backward security of group key. The protocol proved to be secure under the assumption of bilinear computational Diffie-Hellman problem. The performance analysis shows that the proposed scheme is efficient.

DOI: 10.1504/ijes.2019.10025637

Related papers

An authenticated hierarchical asymmetric group key agreement protocol based on identity

Yong Gan, Bingli Wang, Yuan Zhuang +2 more

International Journal of Embedded SystemsJan 1, 20191 citation

A Dynamic ID-based Authenticated Group Key Agreement Protocol

Jun Zheng, Cheng Yang, Jinrong Xue +1 more

Through the group key agreement, all group members could negotiate a common session key which is used in later secure communication.While simple GKA cannot provide enough security to resist the adversary's attack, and the malicious damage during the agreement makes the authenticated key agreement particularly important.In identity-based authentication, user's unique identity information is used as the public key, which makes it exempt from a series of management of the certification in public-key infrastructure.Thereby, the identity-based key agreement can simplify the key management procedures and reduce the risk of failure at the certification authority.Recently, several identity-based group key agreement protocols have been proposed, however most of them are either vulnerable to impersonation and replay attack or inefficient and unscalable.This paper proposes a novel authenticated group key agreement protocol which is based on bilinear pairings.It needs two rounds to negotiate the session key, and the low computational complexity makes the protocol efficient and scalable.Meanwhile, our protocol also ensures the forward and backward secrecy and the key independence.Under the Decisional Diffie-Hellman assumption, our protocol is proved to be secure against the adversary. 1.

National Conference on Electrical, Electronics and Computer Engineering (NCEECE)Jan 1, 201612 citations

Identity-Based Authenticated Asymmetric Group Key Agreement Protocol.

Lei Zhang, Qianhong Wu, Bo Qin +1 more

Abstract. In identity-based public-key cryptography, an entity’s public key can be easily derived from its identity. The direct derivation of public keys in identity-based public-key cryptography eliminates the need for certificates and solves certain public key management problems in traditional public-key cryptosystems. Recently, the notion of asymmetric group key agreement was introduced, in which the group members merely negotiate a common encryption key which is accessible to any entity, but they hold respective secret decryption keys. In this paper, we first propose a security model for identity-based authenticated asymmetric group key agreement (IB-AAGKA) protocols. We then propose an IB-AAGKA protocol which is proven secure under the Bilinear Diffie-Hellman Exponent assumption. Our protocol is also efficient, and readily adaptable to provide broadcast encryption.

Jan 1, 20100 citations

Asymmetric Group Key Agreement Protocol from Short Signatures

Kunyu Shen, Lei Zhang, Rui Zhang +1 more

Asymmetric group key agreement allows a group of users to negotiate a public encryption key that corresponds to several decryption keys, and each decryption key can only be computed by one group member. This novel notion ensures the confidentiality of communication among group members and allows any external entity to send messages to the group. However, the existing authenticated asymmetric group key agreement protocols are designed in identity-based cryptosystem or certificateless public key cryptosystem, which are not widely deployed. In this paper, we propose an efficient authenticated asymmetric group key agreement protocol. The protocol captures the security of secrecy, known-key security, key-compromise impersonation, unknown key-share and key control while being resistant to active attacks. The security of our protocol is reduced to the k-BDHE problem.

IEEE International Conference on Computer and Communications (ICCC)Dec 9, 20223 citations

AD‐ASGKA – authenticated dynamic protocols for asymmetric group key agreement

Mingchu Li, Xiaodong Xu, Cheng Guo +1 more

Abstract Asymmetric group key agreement is a cryptographic primitive allowing a group of users to negotiate a common public encryption key while each of them holds a different secret private decryption key. Anyone (including outsiders) with the public encryption key can send encrypted messages to the group members, and then the group members can decrypt the messages. Authenticated key agreement protocols authenticate the identities of users to ensure that only the intended group members can establish a session in which the group members can communicate with each other. Dynamic asymmetric group key agreement concerns about the scenarios such as ad hoc networks in which the group members may join or leave at any given time. In this paper, we propose a one‐round authenticated dynamic protocol for symmetric group key agreement. For efficiency reasons, we employ the identity‐based public‐key cryptography (IB‐PKC) to authenticate users rather than the public key infrastructure and the certificate‐less public‐key cryptography. Our analysis shows that the proposals in the paper can resist active attacks and meet many desirable security attributes. Besides, our protocol allows users to join or leave the group at the same time. Furthermore, our protocol is round‐optimal and has a quite good performance as compared with previous works. Copyright © 2016 John Wiley & Sons, Ltd.

Security and Communication NetworksJan 26, 201614 citations

Group Key Agreement Protocol Based on Privacy Protection and Attribute Authentication

Zhang Qikun, Yongjiao Li, Yong Gan +3 more

Group key agreement is a good way to ensure secure communication within a group. However, the identity authentication, privacy protection, and information sharing access control (different access rights may exist for different sensitivity of information) are key issues to be solved in group key agreement. Aiming at these problems, this paper proposes a group key agreement protocol based on privacy protection and attribute authentication (GKA-PPAA). The protocol proposes identity authentication for hidden attributes; it not only preserves the advantages of traditional identity-based key agreement protocol, but also provides hiding the identity information and privacy protection of the individual, and also proposes information sharing access control, which different secret information is shared among a set of members who have different levels of authority. It increases the flexibility of group key management. In addition, the group key factors are also calculated before the group key agreement, which eliminates most of the computation overhead due to the group key agreement. This protocol is proven secure under the discrete logarithm problem (DLP) and decisional bilinear Diffie-Hellman (DBDH) problem assumptions. The performance analysis shows that the proposed scheme is much more efficient than the existing ones.

IEEE AccessJan 1, 201927 citations