A Secure IoT-Based Mutual Authentication for Healthcare Applications in Wireless Sensor Networks Using ECC

A Secure IoT-Based Mutual Authentication for Healthcare Applications in Wireless Sensor Networks Using ECC

Deepti Singh, Bijendra Kumar, Samayveer Singh, Satish Chand
DOI: 10.4018/IJHISI.20210401.oa2
Article PDF Download
Open access articles are freely available for download

Abstract

The role of wireless medical sensor networks (WMSNs) is very significant in healthcare applications of IoT. Online report generation and sharing the reports reduce the time and make the treatment of patients very fast. Here, the safety of patient data plays a crucial role. As there is a restriction of resources in sensor nodes, the design of authentication scheme for WMSNs is not an easy task in healthcare applications. Healthcare professionals are using their mobile to collect data from patients' bodies. To use WMSNs in healthcare applications, cryptanalysis of Li et al. is done and found that it suffers from various attacks. Hence, a new efficient privacy-preserving user authenticated scheme using elliptic curve cryptography (ECC) is proposed. The security analysis of scheme is performed using random oracle model, in addition to BAN logic. AVISPA is used for simulation to prove that the proposed scheme can resist passive and active attacks. Finally, the performance comparison of schemes shows that the proposed scheme performs better.
Article Preview
Top

1. Introduction

WMSNs play a crucial role in internet of things (IoT) and are extensively used in a lot of healthcare applications to collect the information/data of the observing patients’ body. IoT is an evolving technology that makes remote sensing a reality. But, owing to wireless network and limitation of resources in sensor nodes, it’s difficult to assure that authorised user only reads the sensitive data is an essential task in IoT atmosphere (Zhu & Huang, 2017). Certain authentication schemes have been proposed to care for this problem. However, earlier schemes possess their flaws, such as susceptible to one or the other attacks or not providing feature like user anonymity. To have secure communication between user and sensor, user authentication scheme with security protection for healthcare applications is designed in this paper.

Usually, WMSNs is designed by a user or healthcare professionals like nurses or doctor, gateway node (GWN) and many sensor nodes through a wireless channel, in which sensors are used to gather data for a particular patient and then these data are to be forwarded to designated professional [(Singh, Singh, Kumar & Chand, 2018)]. Usually, sensor nodes have restricted resources like storage, computing power etc. while GWN has no resource limitation (Singh & Singh, 2018). Hence, the authenticity of a user (or patient) is the main test for safety of IoT in WMSNs. Along with key management (Fakhrey, Tiwari, Johnston & Al-Mathehaji, 2016) authentication is also required for verification of legitimate user in WMSNs, as a main safety mechanism. The main idea is that user, GWN and the sensor should be mutually authenticated to each other. The user can start a session by doing user registration, followed by login to GWN, and then GWN may request a sensor node to gather information wished by user. At successful verification, user accepts message from GWN (Singh, Singh, Kumar, & Chand, 2018), (Singh, Kumar, Singh, Chand, 2019). But, wireless sensor network (WSN) is prone to security attacks due to its wireless channel. Due to the limited capability of sensor, it makes cryptography algorithms like RSA not appropriate for WSN. Because of size and cost restrictions on sensors, there is a limitation on resources such as computation power, storage space, computation cost, and communication bandwidth.

Furthermore, applications of WSNs are very delicate concerning security. At the same time, it is expected that authentication scheme should possess most of the functionality features like mutual authentication, key agreement and should be safe against most of the security attacks. Hence, to design an efficient authentication scheme for WMSNs considering limited resources as well as security from various attacks is a big challenge. In this paper, a novel user authentication protocol using ECC that provides all well-known security features is proposed.

1.1 Elliptic Curve Over Prime Field GF(p)

Assume P is a large prime number. An elliptic curve IJHISI.20210401.oa2.m01over galois field IJHISI.20210401.oa2.m02 is explained by equation IJHISI.20210401.oa2.m03, where IJHISI.20210401.oa2.m04and IJHISI.20210401.oa2.m05. All points on IJHISI.20210401.oa2.m06 and point IJHISI.20210401.oa2.m07 called infinity form an additive group G. A Hasse’s theorem (Mahto, & Yadav, 2018) declares that points on IJHISI.20210401.oa2.m08 denoted by IJHISI.20210401.oa2.m09 and it fulfils the following inequality IJHISI.20210401.oa2.m10 It can also be explained as an elliptic curve IJHISI.20210401.oa2.m11 over IJHISI.20210401.oa2.m12 has approximately IJHISI.20210401.oa2.m13 points on it. If IJHISI.20210401.oa2.m14 and IJHISI.20210401.oa2.m15 be two points in IJHISI.20210401.oa2.m16, then addition of P and Q is calculated as IJHISI.20210401.oa2.m17 and it is computed as follows:

IJHISI.20210401.oa2.m18IJHISI.20210401.oa2.m19 Where IJHISI.20210401.oa2.m20 and IJHISI.20210401.oa2.m21. If P is a generator of G then scalar multiplication IJHISI.20210401.oa2.m22
  • Definition 1 (Elliptic Curve Discrete Logarithm Problem (ECDLP)): Given a point IJHISI.20210401.oa2.m23, it is difficult to calculate discrete logarithm IJHISI.20210401.oa2.m24 such that IJHISI.20210401.oa2.m25

  • Definition 2 (Elliptic Curve Computational Diffie-Hellman problem (ECCDHP)): If there are two points IJHISI.20210401.oa2.m26 for IJHISI.20210401.oa2.m27 it is difficult to calculate IJHISI.20210401.oa2.m28.

  • Definition 3 (Elliptic Curve Decisional Diffie-Hellman problem (ECDDHP)): If there are three points IJHISI.20210401.oa2.m29, it is difficult to find whether IJHISI.20210401.oa2.m30 here IJHISI.20210401.oa2.m31.

Complete Article List

Search this Journal:
Reset
Volume 19: 1 Issue (2024)
Volume 18: 1 Issue (2023)
Volume 17: 2 Issues (2022)
Volume 16: 4 Issues (2021)
Volume 15: 4 Issues (2020)
Volume 14: 4 Issues (2019)
Volume 13: 4 Issues (2018)
Volume 12: 4 Issues (2017)
Volume 11: 4 Issues (2016)
Volume 10: 4 Issues (2015)
Volume 9: 4 Issues (2014)
Volume 8: 4 Issues (2013)
Volume 7: 4 Issues (2012)
Volume 6: 4 Issues (2011)
Volume 5: 4 Issues (2010)
Volume 4: 4 Issues (2009)
Volume 3: 4 Issues (2008)
Volume 2: 4 Issues (2007)
Volume 1: 4 Issues (2006)
View Complete Journal Contents Listing