International Conference on Availability, Reliability and Security (ARES)

An Identity-Based Group Key Agreement Protocol from Pairing

Hongji Wang, Gang Yao, Qingshan Jiang

Published Mar 1, 2008• 9 citations

Abstract

In recent years, a large number of identity-based key agreement protocols from pairings have been proposed. Some of them are elegant and practical. However, using most of those protocols, the session key which users arrive is depended on the identity information. In this paper, we first propose a two-party identity-based key agreement protocol based on pairings whose security relies on the hardness of the bilinear Diffie-Hellman problem in the random oracle model, and the session key is independent of the identity information. After that we extend the protocol to an identity-based group key agreement protocol, which uses no broadcasting. The proposed key agreement protocol achieves the security attributes: known session key security, perfect forward secrecy, no key compromise impersonation, no unknown key share and no key control.

DOI: 10.1109/ares.2008.65

Related papers

An efficient and secure one-round authenticated key agreement protocol without pairings

Mengbo Hou, Qiuliang Xu

Two-Party Authenticated key agreement protocol is essential for setting up the common session key for parties to establish secure channel for network communication in the open environment. Most of proposed schemes require expensive bilinear pairing operation and only provide limited security attributes. So such protocols are unsuitable for real-world applications that require stronger sense of secrecy. In this paper, we first analysis two schemes recently proposed by Cao etc., and then present a one-round ID-based authenticated key agreement protocol with more desired security attributes, which need no pairing operations while still achieve nice computational efficiency. These security attributes include known-key secrecy, perfect forward secrecy, PKG forward secrecy, key-compromise impersonation resilience, unknown key-share resilience and no key control. Moreover, it captures the enhanced security attributes known session-specific temporary key information secrecy, which means that even the ephemeral secret key were compromised, the adversary can hardly acquire the agreed session key.

International Conference on Multimedia Technology (ICMT)Jul 1, 20114 citations

A one-round ID-based authenticated key agreement protocol with enhanced security

Mengbo Hou, Qiuliang Xu

Authenticated key agreement protocol is used to set up the session key and establish secure channel for network communication in the open environment. So far, great deals of identity-based protocols have been proposed to provide robust mutual authentication and key establishment in the two-party setting. Majority of the existing identity-based key agreement protocols require expensive bilinear pairing operation and only provide limited security attributes. Therefore, such protocols are unsuitable for real-world applications that require stronger sense of secrecy. In this paper, we first analysis some of the schemes proposed recently, and then present a one-round ID-based authenticated key agreement protocol with enhanced security attributes, which doesn't need pairing operation and achieves most of the required security attributes, such as known-key secrecy, perfect forward secrecy, PKG Forward Secrecy, key-compromise impersonation resilience, unknown key-share resilience and no key control. In addition, it captures the enhanced security attributes-Known session-specific temporary key information secrecy.

International Conference on Intelligent Control and Information ProcessingJul 1, 20112 citations

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

Forward secure identity-based key agreement for dynamic groups

Nick Mailloux, Ali Miri, Monica Nevins

We propose a new identity-based authenticated group key agreement protocol that provides both perfect forward secrecy and key integrity, while offering low communication and computational complexity. We prove the security of our protocol under the decisional bilinear Diffie-Hellman assumption in the random oracle model. In addition, we propose efficient auxiliary key agreement protocols that maintain perfect forward secrecy, while allowing members to discard their ephemeral keys in the same session in which they were created.

Conference on Privacy, Security and TrustJul 1, 20111 citation

An Efficient Tripartite Identity-Based Authenticated Key Agreement Protocol

Xiaotong Fu, Shufang Guo, Ruijun Shi

In this paper, the tripartite identity-based key agreement is investigated. Inspired by designated verifier signature schemes, a tripartite identity-based key agreement protocol with explicit authentication is proposed with the good authentication of signatures. The new protocol can achieve remarkable security properties, such as perfect forward secrecy and unknown key share. More theoretically, the security proving of the protocol is given in the random oracle model under the Bilinear Diffie-Hellman assumption. The efficiency of the protocol is lying on that three parties can establish an agreed session key after only one round of message exchange. Detailed efficiency analysis compared with other protocols is also made.

International Conference on Intelligent Networking and Collaborative Systems (INCoS)Sep 1, 20132 citations

A Complete Anonymous Group Key Agreement Protocol

Gang Yao, Dengguo Feng

Identity-based key agreement protocols allow the participants in a group exchange information over an open network with each other. However, in most of proposed IDbased protocol, identities of group users are exposed, so that eavesdroppers can easily learn who belongs to the specific group. In this paper, we proposed a complete anonymous group key agreement protocol based on the Burmester and Desmedt mechanism and ID-based encryption cryptosystems. The proposed protocol is provably-secure in the random oracle model, and achieves the following security attribute: complete anonymity, unlinkability, group key secrecy, perfect forward secrecy for the group session key and entity authentication.

International Conference on Networks Security, Wireless Communications and Trusted Computing (NSWCTC)Jan 1, 20107 citations