A Novel Secure Two-Party Identity-Based Authenticated Key Agreement Protocol Without Bilinear Pairings

Ghoreishi, Seyed Mohsen; Isnin, Ismail Fauzi; Razak, Shukor Abd; Chizari, Hassan

doi:10.1007/978-3-319-17398-6_26

Cited by 5 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, Vivek et al's protocol involves more exponentiation operations than Fiore et al's protocol. In 2015, Ghoreishi et al 45 and Sun et al, 46 respectively, presented two pairing-free ID-based 2PAKA protocols. Ghoreishi et al only analyzed the security of their protocol informally and roughly.…”

Section: Related Workmentioning

confidence: 99%

“…In order to reduce the message exchange, Cao et al 35 proposed another ID-based twomessage 2PAKA protocol without pairings in 2010. Unfortunately, Hou and Xu 40,41 45 and Sun et al, 46 respectively, presented two pairing-free ID-based 2PAKA protocols. Ghoreishi et al only analyzed the security of their protocol informally and roughly.…”

Section: Related Workmentioning

confidence: 99%

“…25,35,36 Consequently, in order to accomplish a better performance, some ID-based 2PAKA protocols without pairings 35,[37][38][39][40][41][42][43][44][45][46][47][48][49] have been proposed. Unfortunately, among these pairing-free ID-based 2PAKA protocols, 35,[37][38][39][40][41][42][43][44][45][46][47][48][49] only a few protocols [46][47][48] provide provable security in the eCK model. Moreover, the running times of these protocols [46][47][48] need to be further reduced if they are deployed in real-time application environments with highly dynamic topology such as VANETs.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Efficient identity-based authenticated key agreement protocol with provable security for vehicular ad hoc networks

Dang

Juan

Cao

et al. 2018

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

In vehicular ad hoc networks, establishing a secure channel between any two vehicles is fundamental. Authenticated key agreement is a useful mechanism, which can be used to negotiate a shared key for secure data transmission between authentic vehicles in vehicular ad hoc networks. Among the existing identity-based two-party authenticated key agreement protocols without pairings, there are only a few protocols that provide provable security in strong security models such as the extended Canetti-Krawczyk model. This article presents an efficient pairing-free identity-based one-round two-party authenticated key agreement protocol with provable security, which is more suitable for real-time application environments with highly dynamic topology such as vehicular ad hoc networks than the existing identity-based two-party authenticated key agreement protocols. The proposed protocol is proven secure under the passive and active adversaries in the extended Canetti-Krawczyk model based on the Gap Diffie-Hellman assumption. The proposed protocol can capture all essential security attributes including known-session key security, perfect forward secrecy, basic impersonation resistance, key compromise impersonation resistance, unknown key share resistance, no key control, and ephemeral secrets reveal resistance. Compared with the existing identity-based two-party authenticated key agreement protocols, the proposed protocol is superior in terms of computational cost and running time while providing higher security.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient identity-based authenticated key agreement protocol with provable security for vehicular ad hoc networks

Dang

Juan

Cao

et al. 2018

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…Secondly, the verification in aggregate signature schemes consists of two kinds of computation costs: pairing computation p and scalar multiplication computation s . Pairing computation p is much higher than scalar multiplication s . Under our NCLAS scheme, only four pairing computations are needed for verification, which is a constant and independent of the number of signatures being aggregated.…”

Section: Introductionmentioning

confidence: 99%

NCLAS: a novel and efficient certificateless aggregate signature scheme

Nie

Chen

et al. 2016

Security Comm. Networks

View full text Add to dashboard Cite

Aggregate signature algorithms combine n signatures on n different messages from n distinct users into one aggregated signature. The aggregated signature allows the verifier to authenticate the n signatures simultaneously. Because the total signature length and authentication costs are significantly reduced, aggregate signature algorithms are attractive to applications with resource constraints and applications requiring efficient batch authentications. In this paper, we propose a novel aggregate signature scheme based on certificateless‐PKC. Under this novel scheme, the length of the aggregated signature and the pairing computation cost in the aggregate signature verification process are independent of the number of signatures being aggregated. We also prove that the proposed scheme is existentially unforgeable against adaptive chosen‐message and chosen‐identity attacks, based on the hardness assumption of the computational Diffie–Hellman problem. The new scheme will be suitable for resource‐constrained applications. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

A pairing‐free identity‐based handover AKE protocol with anonymity in the heterogeneous wireless networks

Lei

Zhang

Wang

et al. 2019

Int J Communication

View full text Add to dashboard Cite

SummaryNowadays, seamless roaming service in heterogeneous wireless networks attracts more and more attention. When a mobile user roams into a foreign domain, the process of secure handover authentication and key exchange (AKE) plays an important role to verify the authenticity and establish a secure communication between the user and the access point. Meanwhile, to prevent the user's current location and moving history information from being tracked, privacy preservation should be also considered. However, existing handover AKE schemes have more or less defects in security aspects or efficiency. In this paper, a secure pairing‐free identity‐based handover AKE protocol with privacy preservation is proposed. In our scheme, users' temporary identities will be used to conceal their real identities during the handover process, and the foreign server can verify the legitimacy of the user with the home server's assistance. Besides, to resist ephemeral private key leakage attack, the session key is generated from the static private keys and the ephemeral private keys together. Security analysis shows that our protocol is provably secure in extended Canetti‐Krawczyk (eCK) model under the computational Diffie‐Hellman (CDH) assumption and can capture desirable security properties including key‐compromise impersonation resistance, ephemeral secrets reveal resistance, strong anonymity, etc. Furthermore, the efficiency of our identity‐based protocol is improved by removing pairings, which not only simplifies the complex management of public key infrastructure (PKI) but also reduces the computation overhead of ID‐based cryptosystem with pairings. It is shown that our proposed handover AKE protocol provides better security assurance and higher computational efficiency for roaming authentication in heterogeneous wireless networks.

show abstract

A Novel Secure Two-Party Identity-Based Authenticated Key Agreement Protocol Without Bilinear Pairings

Cited by 5 publications

References 9 publications

Efficient identity-based authenticated key agreement protocol with provable security for vehicular ad hoc networks

Efficient identity-based authenticated key agreement protocol with provable security for vehicular ad hoc networks

NCLAS: a novel and efficient certificateless aggregate signature scheme

A pairing‐free identity‐based handover AKE protocol with anonymity in the heterogeneous wireless networks

Contact Info

Product

Resources

About