Certificateless Authenticated Group Key Agreement Protocol for Dynamic Groups

Heo, Sungchul; Kim, Zeen; Kim, Kwangjo

doi:10.1109/glocom.2007.93

Cited by 20 publications

(15 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In the same fashion, we calculated the computation costs of other protocols proposed in [31,32,34,35,41]. Since the the computation cost of the general hash function (not map-to-point hash function) is very low against other cryptographic operations, therefore in the comparative analysis, we ignored the the general hash function.…”

Section: Efficiency Analysismentioning

confidence: 99%

Provably secure one-round certificateless authenticated group key agreement protocol for secure communications

Islam

Singh

2015

Wireless Pers Commun

View full text Add to dashboard Cite

A novel one-round authenticated group key agreement (CL-AGKA) protocol is devised in this paper on certificateless public key cryptography. Our CL-AGKA protocol abolished the certificate management burden existing in certificate authority-based public key cryptography and the private-key escrow problem occurring in identity-based cryptography. Our CL-AGKA protocol is designed to establish an authenticated group session key between a group participants by ensuring that the session key is not revealed to any outsiders. The proposed CL-AGKA protocol designed a security model in the computational model, called the random oracle model. It is formally examined that our CL-AGKA protocol achieved the strong authenticated key exchange security and thus provably secured in the random oracle model. The security of the designed protocol is achieved against the intractability assumptions of the computational Diffie-Hellman problem and bilinear Diffie-Hellman problem. In addition, the proposed CL-AGKA protocol offered low message exchange cost and computational cost against the related group key agreement protocols.

show abstract

Section: Efficiency Analysismentioning

confidence: 99%

Provably secure one-round certificateless authenticated group key agreement protocol for secure communications

Islam

Singh

2015

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…e.g. Heo et al [4]proposed a CL-AGK protocol using binary tree structure for dynamic group. It provides efficient communication and computation complexity, but it does not provide perfect forward security.…”

Section: Related Workmentioning

confidence: 99%

A Pairing Free Certificateless Group Key Agreement Protocol with Constant Round

Kumar

Tripathi

Jaiswal

2014

Advanced Computing, Networking and Informatics- Volume 2

View full text Add to dashboard Cite

Abstract. To allow a secure conversation among a group of members over a public network there is a need of group key agreement protocol which provide a group session key used in necessary cryptographic operations. Nowadays the protocols based on the certificateless public key cryptography (CL-PKC) creating more attraction for research because it does not require certificates to authenticates the public key as like ID-based cryptosystem and unlike ID based cryptosystem, it does not suffers from the key escrow problem. The almost all CL-PKC based group key agreement schemes in current literature are employ bilinear pairing in their operations. Since the relative computation cost of pairing is many times more than the elliptic curve point multiplication, so it motivates the researchers to propose pairing free protocols based on the CL-PKC. The present paper propose an efficient pairing free group key agreement protocol based on certificateless cryptography over elliptic curve group with their security and performance analysis. The analysis shows that the proposed protocol has strong security protection against various kinds of attack and involves comparatively lower computation and communication overheads than the other existing protocols.

show abstract

“…Similar to the algorithms described in [4], [7], [8], [12], [14], joining group protocol and leaving group protocol have been technically designed in the proposed algorithm. According to the topological structure feature of mobile Ad Hoc network, the running of OR-CLAGKA protocol needs to appoint a certain user as group controller (GC) which is usually close to the center of network topological structure.…”

Section: Execution Phase Of Protocolmentioning

confidence: 99%

“…Considering some protocols based on CL-PKC [2]- [6], [8], [9], algorithms named as Setup,Partial-Private-Key-Extract, Set-Secret-Value, Set-Private-Key, and Set-Public-Key are usually defined in the initial phase, which have similar function but different implementation in different protocols. In addition, a Key Agreement Protocol is usually designed as the final part of each protocol.…”

Section: Initial Phase Of Protocolmentioning

confidence: 99%

See 1 more Smart Citation

A One-Round Certificateless Authenticated Group Key Agreement Protocol for Mobile Ad Hoc Networks

Cheng

Liu

Guan

et al. 2016

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYEstablished in self-organized mode between mobile terminals (MT), mobile Ad Hoc networks are characterized by a fast change of network topology, limited power dissipation of network node, limited network bandwidth and poor security of the network. Therefore, this paper proposes an efficient one round certificateless authenticated group key agreement (OR-CLAGKA) protocol to satisfy the security demand of mobile Ad Hoc networks. Based on elliptic curve public key cryptography (ECC), OR-CLAGKA protocol utilizes the assumption of elliptic curve discrete logarithm problems (ECDLP) to guarantee its security. In contrast with those certificateless authenticated group key agreement (GKA) protocols, OR-CLAGKA protocol can reduce protocol data interaction between group users and it is based on efficient ECC public key infrastructure without calculating bilinear pairings, which involves negligible computational overhead. Thus, it is particularly suitable to deploy OR-CLAGKA protocol on MT devices because of its limited computation capacity and power consumption. Also, under the premise of keeping the forward and backward security, OR-CLAGKA protocol has achieved appropriate optimization to improve the performance of Ad Hoc networks in terms of frequent communication interrupt and reconnection. In addition, it has reduced executive overheads of key agreement protocol to make the protocol more suitable for mobile Ad Hoc network applications.

show abstract

Certificateless Authenticated Group Key Agreement Protocol for Dynamic Groups

Cited by 20 publications

References 11 publications

Provably secure one-round certificateless authenticated group key agreement protocol for secure communications

Provably secure one-round certificateless authenticated group key agreement protocol for secure communications

A Pairing Free Certificateless Group Key Agreement Protocol with Constant Round

A One-Round Certificateless Authenticated Group Key Agreement Protocol for Mobile Ad Hoc Networks

Contact Info

Product

Resources

About