4.6 Article

Lightweight Failover Authentication Mechanism for IoT-Based Fog Computing Environment

Journal

ELECTRONICS
Volume 10, Issue 12, Pages -

Publisher

MDPI
DOI: 10.3390/electronics10121417

Keywords

Internet of Things (IoT); fog computing; failover; security; privacy; authentication

Funding

  1. King Khalid University [R.G.P. 2/48/42]
  2. National Research Foundation of Korea (NRF) - Ministry of Education [2020R1I1A3058605]
  3. FCT/MCTES
  4. EU funds [UIDB/50008/2020]
  5. Brazilian National Council for Scientific and Technological Development -CNPq [313036/2020-9]

Ask authors/readers for more resources

In this work, a new security mechanism was proposed for ensuring security during failover among fog nodes in IoT. The scheme achieves fast lightweight secondary authentication leveraging initial authentication. The research demonstrates the security of the proposed scheme through formal security analysis, informal security analysis, and comparative analysis with other schemes.
Fog computing as an extension to the cloud computing infrastructure has been invaluable in enhancing the applicability of the Internet of Things (IoT) paradigm. IoT based Fog systems magnify the range and minimize the latency of IoT applications. However, as fog nodes are considered transient and they offer authenticated services, when an IoT end device loses connectivity with a fog node, it must authenticate freshly with a secondary fog node. In this work, we present a new security mechanism to leverage the initial authentication to perform fast lightweight secondary authentication to ensure smooth failover among fog nodes. The proposed scheme is secure in the presence of a current de-facto Canetti and Krawczyk (CK)-adversary. We demonstrate the security of the proposed scheme with a detailed security analysis using formal security under the broadly recognized Real-Or-Random (ROR) model, informal security analysis as well as through formal security verification using the broadly-used Automated Validation of Internet Security Protocols and Applications (AVISPA) software tool. A testbed experiment for measuring computational time for different cryptographic primitives using the Multiprecision Integer and Rational Arithmetic Cryptographic Library (MIRACL) has been done. Finally, through comparative analysis with other related schemes, we show how the presented approach is uniquely advantageous over other schemes.

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