Identity-based Authenticated Group Key Agreement Research Articles

Genetic-IDGKA: Genetic ID-Based Group Key Agreement Protocol for Large MANETs

The Research works on Key Management Schemes in Mobile Ad-Hoc Networks (MANETs) are attracting more and more attention to Researchers. Proving secured communication in MANET is extremely challenging one as it is dynamic in nature and the lack of centralized management. To address these issues, several researchers have proposed Key Management Schemes. In this work, we have identified and thoroughly studied three popular Key Management Schemes namely i. ID-based Multiple Secrets Key Management Scheme ii. RSA Certificate-Based Cryptography and iii. ID-Based Authenticated Group Key Agreement Protocol. We have proposed an efficient Genetic Model to optimize the performances of Key Management Schemes in terms of Key Initialization, Selecting Random Number Generator, Key Updation Timing, Packet Size, Computing Future Session Key and Session Group Key and forming Dynamic Clustering Group. The proposed Genetic Model was successfully implemented with VC++ and integrated with the above mentioned Key Management Schemes. From our experimental results, we revealed that the Genetic Model Based Key Management Schemes achieving higher security level as compared with ordinary Key Management Schemes, particularly the Genetic ID-Based Authenticated Group Key Agreement Protocol outperforms all the other two identified Key management Schemes in terms of Mobility Robustness, Computational and Message Overhead, Strength of Security, Key Exchange Time, Power Consumption and Key Update Time.

A pairing-free identity-based authenticated group key agreement protocol for imbalanced mobile networks

The secure and reliable group communication gains popularity in imbalanced mobile networks due to the increase demand of the group-oriented applications such as teleconferences, collaborative workspaces, etc. For acquiring the group security objectives, many authenticated group key agreement (AGKA) protocols exploiting the public key infrastructure have been proposed, which require additional processing and storage space for validation of the public keys and the certificates. In addition, the most of the AGKA protocols are implemented using bilinear pairing and a map-to-point (MTP) hash function. The relative computation cost of the bilinear pairing is approximately two to three times more than the elliptic curve point multiplication (ECPM) and the MTP function has higher computation cost than an ECPM. Due to the limitation of communication bandwidth, computation ability, and storage space of the low-power mobile devices, these protocols are not suitable especially for insecure imbalanced mobile networks. To cope with the aforementioned problems, in this paper, we proposed a pairing-free identity-based authenticated group key agreement protocol using elliptic curve cryptosystem. It is found that the proposed protocol, compared with the related protocols, not only improves the computational efficiencies, but also enhances the security features.

ID-based authenticated group key agreement from bilinear maps

Authenticated group key agreement (GKA) is an important cryptographic mechanism underlying many collaborative and distributed applications. Recently, identity (ID)-based authenticated GKA has been increasingly researched because of the authentication and simplicity of the ID-based cryptosystem. However, there are two disadvantages with this kind of mechanism: 1) the private key escrow is inherent and 2) the Private Key Generator (PKG) must send client private keys over secure channels, making private key’s distribution difficult. The two disadvantages, particularly secure channels, may be unacceptable for secure group communications application. Fortunately, we can avoid both of them. In this paper, with bilinear maps on ECC, we present a new authenticated group key agreement protocol that does not require secure channels. The basic idea is the usual way of circumventing escrow: double key and double encryption (verification). The secret key of a user is generated by a key generation center (KGC) and the user collaboratively. Each of them has “half” of the secret information about the secret key of the user, and there is no secret key distribution problem. In addition, the computation cost of the protocol is very low because the main computation is binary addition.

Comments on an ID-Based Authenticated Group Key Agreement Protocol with Withstanding Insider Attacks

In PKC 2004, Choi et al. proposed an ID-based authenticated group key agreement (AGKA) protocol using bilinear pairings. Unfortunately, their protocol suffered from an impersonation attack and an insider colluding attack. In 2008, Choi et al. presented an improvement to resist insider attacks. In their modified protocol, they used an ID-based signature scheme on transcripts for binding them in a session to prevent replay of transcripts. In particular, they smartly used the batch verification technique to reduce the computational cost. In this paper, we first show that Choi et al.'s modified AGKA protocol still suffers from an insider colluding attack. Then, we prove that the batch verification of the adopted ID-based signature scheme in their modified protocol suffers from a forgery attack.

ID-Based Authenticated Group Key Agreement Secure against Insider Attacks

In 2004, Choi et al. proposed an ID-based authenticated group key agreement. Unfortunately, their protocol was found to be vulnerable to the insider attacks by Zhang, Chen and Shim. To prevent insider attacks, Shim presented a modification of Choi et al.'s protocol. In this letter, we first show that Shim's modification is still insecure against insider attacks. We then present a modification of Choi et al.'s protocol that resists insider attacks. The counter-measure uses an ID-based signature on transcripts in order to bind them in a session. This prevents any replay of transcripts. Especially, by applying ID-based batch verification, the proposed one still consists of two rounds and is computationally efficient.

그룹 사용자간 안전한 콘텐츠 전송을 위한 Zhou의 ID-기반의 인증된 그룹 키 교환 프로토콜 분석

유료 콘텐츠를 정당한 서비스 수신자에게 안전하게 제공하기 위해서는 서비스 제공자와 수신자 사이에 안전한 키 교환이 필요하다. 그룹 키 교환 프로토콜은 이러한 그룹에 속한 멤버들이 공개된 통신망을 이용하여 안전하고 효율적인 방법으로 그룹의 세션키를 설정할 수 있게 한다. 최근에 L. Zhou는 효율적인 인증된 그룹 키 교환 프로토콜을 설계하였다. 본 논문에서 우리는 Zhou의 기법이 전방향 안전성을 제공하지 않음을 보인다. An authenticated group key agreement protocol allows a group of parties communicating over an insecure network to share a common secret key. In this paper, we show that Zhou et al.'s ID-based authenticated group key agreement schemes do not provide forward secrecy.

Further Analysis of ID-Based Authenticated Group Key Agreement Protocol from Bilinear Maps

Recently, Choi et al. proposed an ID-based authenticated group key agreement with bilinear maps. Subsequently, Zhang and Chen showed that the protocol does not provide authenticity as claimed by replaying transcripts of the past session. To prevent those replay attacks, they suggest adding a time parameter to the message being signed. However, despite of such a modification, we show that the protocol is still insecure against insider colluding attacks without replaying transcripts of the past session.

Identity based group key agreement in multiple PKG environment

Secure and reliable group communication is an increasingly active research area by growing popularity in group-oriented and collaborative applications. In this paper, we propose the first identity-based authenticated group key agreement in multiple private key generators (PKG) environment. It is inspired on a new two-party identity-based key agreement protocol first proposed by Hoonjung Leeet al. In our scheme, although each member comes from different domain and belongs to different PKGs which do not share the common system parameters, they can agree on a shared secret group key. We show that our scheme satisfies every security requirements of the group key agreement protocols.

Attack on an ID-based authenticated group key agreement scheme from PKC 2004

In PKC'04, Choi, Hwang and Lee [Lecture Notes in Comput. Sci., vol. 2947, Springer-Verlag, 2004, pp. 130–144] proposed two group key agreement schemes from bilinear pairings: one is a bilinear variant of Burmester and Desmedt scheme [Lecture Notes in Comput. Sci., vol. 950, Springer-Verlag, 1994, pp. 267–275] and the other is an ID-based authenticated scheme based on the former. In this paper, we propose an impersonation attack on their ID-based authenticated group key agreement scheme. We show that any two malicious users can impersonate an entity to agree some session keys in a new group if these two malicious users have the previous authentication transcripts of this entity. Therefore, their scheme cannot provide the authenticity as claimed.

Attack on an ID-based authenticated group key agreement scheme from PKC 2004

In PKC'04, Choi, Hwang and Lee [Lecture Notes in Comput. Sci., vol. 2947, Springer-Verlag, 2004, pp. 130–144] proposed two group key agreement schemes from bilinear pairings: one is a bilinear variant of Burmester and Desmedt scheme [Lecture Notes in Comput. Sci., vol. 950, Springer-Verlag, 1994, pp. 267–275] and the other is an ID-based authenticated scheme based on the former. In this paper, we propose an impersonation attack on their ID-based authenticated group key agreement scheme. We show that any two malicious users can impersonate an entity to agree some session keys in a new group if these two malicious users have the previous authentication transcripts of this entity. Therefore, their scheme cannot provide the authenticity as claimed.