An Authenticated 3-Round Identity-Based Group Key Agreement Protocol

Yao, Gang; Wang, Hongji; Jiang, Qingshan

doi:10.1109/ares.2008.66

Cited by 11 publications

(17 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the second one, the user 1 can impersonate any other user he wants. We also find that the protocol of Yao et al [25] is not immune to key-compromise impersonation, either. A user can impersonate another by rebroadcasting the messages.…”

Section: Security Problems In the Previous Schemesmentioning

confidence: 50%

See 1 more Smart Citation

Interdomain Identity‐Based Key Agreement Schemes

Fan

Lin²,

Hsu³

et al. 2014

Mathematical Problems in Engineering

View full text Add to dashboard Cite

In order to simplify key management, two-party and three-party key agreement schemes based on user identities have been proposed recently. Multiparty (including more than three parties) key agreement protocols, which also are called conference key schemes, can be applied to distributed systems and wireless environments, such as ad hoc networks, for the purpose of multiparty secure communication. However, it is hard to extend two- or three-party schemes to multiparty ones with the guarantee of efficiency and security. In addition to the above two properties, interdomain environments should also be considered in key agreement systems due to diversified network domains. However, only few identity-based multiparty conference key agreement schemes for single domain environments and none for interdomain environments were proposed in the literature and they did not satisfy all of the security attributes such as forward secrecy and withstanding impersonation. In this paper, we will propose a novel efficient single domain identity-based multiparty conference key scheme and extend it to an interdomain one. Finally, we prove that the proposed schemes satisfy the required security attributes via formal methods.

show abstract

Section: Security Problems In the Previous Schemesmentioning

confidence: 50%

“…In the section, we briefly introduce security weaknesses on the schemes [15][16][17][18][19][24][25][26]. The details of the security problems in these schemes are in the Appendices.…”

Section: Security Problems In the Previous Schemesmentioning

confidence: 99%

Interdomain Identity‐Based Key Agreement Schemes

Fan

Lin²,

Hsu³

et al. 2014

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…Many group key agreement protocols based on the Burmester and Desmedt mechanism have been proposed, such as [3], [13], [11]. In 2004, Choi, Hwang and Lee [3] proposed two group key agreement schemes which use bilinear pairings: one is a bilinear variant of Burmester and Desmedt scheme [6] and the other is ID-based authenticated scheme based on the former protocol.…”

Section: Related Workmentioning

confidence: 99%

A Complete Anonymous Group Key Agreement Protocol

Yao

Feng

2010

2010 Second International Conference on Networks Security, Wireless Communications and Trusted Computing

Self Cite

View full text Add to dashboard Cite

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.

show abstract

“…Shi [11] and Zhong [12] both proposed a one-round ID-based GKA scheme, but they have changed the ID-based authentication protocol that the public keys of members are not their identity strings. Yao [13] put forward a three-round ID-based GKA protocol, the first round is for identity authentication, the second round is for key agreement, and the third round is for key confirmation, and it is provably secure in the random oracle model. In terms of Identity-Based Encryption, Huang [14] proposed a hybrid encryption scheme, compared to the Boneh's scheme, it has a higher computational efficiency.…”

Section: Related Workmentioning

confidence: 99%

A Dynamic ID-based Authenticated Group Key Agreement Protocol

Zheng¹,

Cheng²,

Xue³

et al. 2016

Proceedings of the 2015 4th National Conference on Electrical, Electronics and Computer Engineering

View full text Add to dashboard Cite

Abstract. 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.

show abstract

An Authenticated 3-Round Identity-Based Group Key Agreement Protocol

Cited by 11 publications

References 1 publication

Interdomain Identity‐Based Key Agreement Schemes

Interdomain Identity‐Based Key Agreement Schemes

A Complete Anonymous Group Key Agreement Protocol

A Dynamic ID-based Authenticated Group Key Agreement Protocol

Contact Info

Product

Resources

About