Construction of elliptic curve cryptography‐based authentication protocol for internet of things

Abstract

The advancement in the internet of things (IoT) is bringing changes in our daily lives. The widespread adoption of the IoT in a variety of areas sets the basis for smart living while also posing privacy and security concerns. Authentication and key agreement (AKA) protocol provides identity authentication for participants in a communication system and generates a temporary session key for participants to securely transmit messages. In addition to this, the adoption of smart cards adds a second line of defense in AKA protocols for IoT. To enhance the security of AKA protocols for IoT, many AKA protocols are proposed, but the majority of them fail to manage the balance between security and efficiency.To achieve both security and efficiency together for IoT, based on the elliptic curve public-key cryptography, we design a three-factor AKA protocol. We follow security analysis and efficiency analysis to analyze the security and efficiency. By comparing with related existing protocols, it is found that this protocol achieves security and efficiency attributes. The investigation shows that the protocol can meet key security requirements, consumes less computing resources, and is especially suitable for IoT scenarios with high security and efficiency.

A privacy oriented authorized key agreement framework for vehicular edge computing

“…For computation and communication analysis, the implementation time for hash to point operation T HTP , exponential operation in multiplicative cyclic group T EXP is taken as 0.000182 s and 0.00383 s. 29 Amin et al and Chandrakar 32,33 used a 160-bit prime field F q , a 1024-bit group which is cyclic, SHA-1 Hash function, and an AES encoding algorithm. The operational computation time for one way hash functions T H in our paper is considered to be 0.00053 s. 34 Our proposed scheme comprises the cost of concatenation (∥) operation and evaluation of XOR (⊕) is not significant. Table 2, clearly shows the computational cost 18T H of Wu et al 24 scheme.…”

“…Amin et al and Chandrakar 32,33 used a 160‐bit prime field $$$ {\mathrm{F}}_{\mathrm{q}} $$$, a 1024‐bit group which is cyclic, SHA‐1 Hash function, and an AES encoding algorithm. The operational computation time for one way hash functions $$$ {\mathrm{T}}_{\mathrm{H}} $$$ in our paper is considered to be 0.00053 s 34 . Our proposed scheme comprises the cost of concatenation ($$$ \parallel $$$) operation and evaluation of XOR ($$$ \oplus $$$) is not significant.…”