4.6 Article

A Provably Secure and Lightweight Identity-Based Two-Party Authenticated Key Agreement Protocol for IIoT Environments

Journal

IEEE SYSTEMS JOURNAL
Volume 15, Issue 2, Pages 1732-1741

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JSYST.2020.3004551

Keywords

Protocols; Computational modeling; Elliptic curves; Elliptic curve cryptography; Bilinear pairing; elliptic curve; Industrial Internet of Things (IIoT); key agreement; provable security

Funding

  1. Basic Science Research Program through the National Research Foundation of Korea - Ministry of Education [2018R1D1A3B07050409]
  2. P. R. of China Ministry of Education Distinguished Possessor Grant [MS2017BJKJ003]
  3. National Research Foundation of Korea [2018R1D1A3B07050409] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)

Ask authors/readers for more resources

This article presents an identity-based two-party authenticated key agreement (ID-2PAKA) protocol for secure communication and data sharing in the Internet of Things (IoT) environment. Performance analysis of the proposed protocol demonstrates its security and efficiency.
With the significant development of the Internet, Internet of Things (IoT) has become an emerging technology in many industries. To support security and privacy in the Industrial IoT environment, a user may interact with another user on the Internet to share confidential information, which requires an authenticated communication channel. To meet this demand, in this article the authors developed an identity-based two-party authenticated key agreement (ID-2PAKA) protocol that allows two users to communicate securely and share sensitive data across IoT-enabled regions. Similar protocols found in the literature either proven to be insecure or carry the burden of high communication and computational costs. The proposed ID-2PAKA protocol is analyzed in the random oracle model to achieve provable security based on the hardness assumptions of computational Diffie-Hellman and bilinear Diffie-Hellman problems. The performance analysis of the proposed ID-2PAKA protocol is performed using the pairing-based cryptography library. The comparative results from the perspective of the computation and communication costs against the competing protocols showed that the proposed ID-2PAKA protocol is secure and efficient.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available