A strongly secure identity-based authenticated key agreement protocol without pairings under the GDH assumption

Sun, Hua; Wen, Qiaoyan; Zhang, Hua; Jin, Zhengping

doi:10.1002/sec.1241

Cited by 20 publications

(17 citation statements)

References 33 publications

(71 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, the results obtained with such solutions and their corresponding suitability for use in WSNs need to be reconsidered with caution. Partially due to this reason, but also aiming at better efficiency, part of the WSN-oriented literature on AKA protocols has shifted to pairing-free, albeit still escrowed, schemes, such as those described in [34][35][36][37] .…”

Section: Related Workmentioning

confidence: 98%

Lightweight and escrow-less authenticated key agreement for the internet of things

Simplício

Silva

Alves

et al. 2017

Computer Communications

View full text Add to dashboard Cite

a b s t r a c tSecurity is essential for wide wireless sensor network (WSN) deployments, such as the Internet of Things (IoT). However, the resource-constrained nature of sensors severely restricts the cryptographic algorithms and protocols that can be used in such platforms. Such restrictions apply especially to authenticated key agreement (AKA) protocols for bootstrapping keys between authorized nodes: in traditional networks, such schemes involve the transmission of quite large certificates and the execution of memoryand processing-intensive cryptographic algorithms, which are not suitable for WSNs. Whereas lightweight WSN-oriented schemes also exist, most of them focus on small deployments where key-escrow is possible (i.e., a fully trusted authority knows the private keys of all nodes). Aiming to identify AKA solutions suitable for the IoT scenario, in this article we assess lightweight and escrow-free schemes, evaluating their security and performance in terms of processing time and energy consumption in the TelosB platform. Besides proving that some very efficient schemes are actually flawed, we show that the combination of SMQV (strengthened-Menezes-Qu-Vanstone) with implicit certificates leads to a secure and lightweight AKA scheme.

show abstract

Section: Related Workmentioning

confidence: 98%

Lightweight and escrow-less authenticated key agreement for the internet of things

Simplício

Silva

Alves

et al. 2017

Computer Communications

View full text Add to dashboard Cite

show abstract

“…Until recently, some responding protocols with better properties have been presented. In 2015, Sun et al [23] presented an improved 2PAKA protocol based on the identity with security proof in the eCK security model. But disadvantages were that this protocol used six scalar multiplications on elliptic curve and security proof was incomplete because only passive adversary was taken into consideration in the security model.…”

Section: Id-based 2paka Protocols Without Bilinear Pairingmentioning

confidence: 99%

A Provably Secure and Lightweight Identity-Based Two-Party Authenticated Key Agreement Protocol for Vehicular Ad Hoc Networks

Hsu

Choo

et al. 2019

Security and Communication Networks

View full text Add to dashboard Cite

As an important part of smart cities, vehicle ad hoc networks (VANETs) have attracted much attention from both industry and academia. In a VANET, generating a secure session key to facilitate subsequent data-in-transit transfer between two or more vehicles is crucial, which can be achieved by using an authenticated key agreement protocol. However, most of the existing identity-based two-party authenticated key agreement protocols have significant computational requirements or are known to be insecure. Thus, in this paper, a secure and efficient identity-based two-party authenticated key agreement protocol is presented by us. This protocol does not involve complex bilinear pairing computations and can generate a valid session key in two rounds. The security of the proposed protocol is proved in the eCK model which has better capability to describe a protocol’s security than the famous CK model, and it has been widely used in the security proof of ID-based key agreement protocols currently. Additionally, we also evaluate its performance for potential utility in a VANET.

show abstract

“…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%

“…0:008 ms), and DATA field. The DATA field consists 28 eCK Ã CBDH = = Sun et al 46 eCK Ã GDH = = Bala et al 47 eCK Ã GDH = = Ni-I 48 eCK CDH = = Ni-II 48 eCK GDH = = Islam and Biswas 49 of the 16-bit SERVICE field, the physical service data unit (PSDU) (i.e. the medium-access control (MAC) frame), the 6-bit TAIL field, and the PAD field.…”

Section: Performance Analysesmentioning

confidence: 99%

“…Message size Computational cost Running time MB-I 20 64 bytes 1P + 1E + 1PM 24:276 ms Huang and Cao 28 66 bytes 2P + 3PM 42:852 ms Sun et al 46 42 bytes 6EM(5EM) 10:594 ms Bala et al 47 42 transmitted messages based on group signcryption. The session key used for signcryption is derived from the group secret key, which is generated by the group secret key agreement.…”

Section: Protocolmentioning

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

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

A strongly secure identity-based authenticated key agreement protocol without pairings under the GDH assumption

Cited by 20 publications

References 33 publications

Lightweight and escrow-less authenticated key agreement for the internet of things

Lightweight and escrow-less authenticated key agreement for the internet of things

A Provably Secure and Lightweight Identity-Based Two-Party Authenticated Key Agreement Protocol for Vehicular Ad Hoc Networks

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

Contact Info

Product

Resources

About