An improved ID-based group key agreement protocol

Kangwen Hu, Jingfeng Xue, Changzhen Hu, Rui Ma, Zhiqiang LiTsinghua 2014 · DOI

Abstract

ID-based constant-round group key agreement protocols are efficient in both computation and communication, but previous protocols did not provide valid message authentication. An improvement based on attack analysis is proposed in this paper. The improved method takes full advantage of the data transmitted at various stages of the protocol. By guaranteeing the freshness of authentication messages, the authenticity of the generator of authentication messages, and the completeness of the authenticator, the improved protocol can resist various passive and active attacks. The forward secrecy of the improved protocol is proved under a Katz-Yung (KY) model. Compared with existing methods, the improved protocol is more effective and applicable.

Introduction

In modern network environments, establishing secure communication channels for groups is essential. Identity-Based Cryptosystems (IBC) facilitate this by using a user’s identity (e.g., an email address) as their public key, bypassing the complexities of traditional certificate management. However, many existing identity-based group key agreement (ID-GKA) protocols, such as Choi’s influential 2004 protocol, lack robust entity authentication. This deficiency exposes groups to impersonation attacks, Man-in-the-Middle (MitM) attacks, and passive eavesdropping.

Proposed Methodology

The researchers propose an enhanced two-round protocol leveraging bilinear pairings on elliptic curves. The innovation centers on a more rigorous authentication mechanism during the two rounds of communication:

  • Round 1: Every user generates a temporary secret and broadcasts a corresponding public value ($P_i$).
  • Round 2: Users receive all $P_i$ values from the group. They then compute an authentication value ($D_i$) and a signature ($T_i$).

The critical improvement over previous protocols is the integration of data from all participants into the signature. By hashing the combined group identities ($S_{ID}$) and the combined public values ($P_{ID}$), the protocol ensures that authentication is both "fresh" (unique to the specific session) and "complete" (verified by the entire group). Security is formally proven under the Katz-Yung (KY) model and the Decisional Bilinear Diffie-Hellman (DBDH) assumption.

Comparative Analysis and Results

The protocol maintains a constant-round efficiency (2 rounds), which is crucial for minimizing latency in large groups. While slightly more computationally intensive than the original (but flawed) Choi protocol, it is more efficient than other corrected versions, such as Li and He’s protocol, which requires significantly more pairing operations.

Comparison of the proposed protocol with existing ID-based group key agreement protocols.

As shown in the comparison table, the proposed protocol is the only one among the compared methods that is compatible with non-supersingular curves while maintaining a single signature and two-round efficiency without requiring a global counter. Furthermore, the protocol provides provable Forward Secrecy, ensuring that the compromise of a user's long-term private key does not jeopardize past session keys.

Conclusion

The proposed ID-GKA protocol addresses significant security gaps in previous models by ensuring message freshness and authenticity through global group state integration. While it still relies on a trusted Key Generation Center (KGC), it offers a more robust and flexible solution compatible with a wider range of elliptic curves. Future research will explore asymmetric ID-based group key agreements to provide more granular access control in complex organizational hierarchies.

Summary updated

Abstract

ID-based constant-round group key agreement protocols are efficient in both computation and communication, but previous protocols did not provide valid message authentication. An improvement based on attack analysis is proposed in this paper. The improved method takes full advantage of the data transmitted at various stages of the protocol. By guaranteeing the freshness of authentication messages, the authenticity of the generator of authentication messages, and the completeness of the authenticator, the improved protocol can resist various passive and active attacks. The forward secrecy of the improved protocol is proved under a Katz-Yung (KY) model. Compared with existing methods, the improved protocol is more effective and applicable.
BibTeX
@inproceedings{hu2014improved,
  author = {Kangwen Hu and Jingfeng Xue and Changzhen Hu and Rui Ma and Zhiqiang Li},
  title = {{An improved ID-based group key agreement protocol}},
  booktitle = {Tsinghua},
  year = {2014},
  doi = {10.1109/tst.2014.6919818},
}
Figure