An Efficient Mutual Authentication Scheme for Internet of Things

Mbarek, Bacem; Ge, Mouzhi; Pitner, Tomáš

doi:10.1016/j.iot.2020.100160

Cited by 35 publications

(31 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Key Size [16] 1024 bits [17] 1024 bits [19] 128 bits [22] 128 bits [12] 160 bits P-I and P-II 224 bits We assumed the length of the hash function, keys, and security parameters = 224 bits, and the timestamp = 32 bits. Besides, our system contains four tuples in the foreign network side ( ( ) , , , ) that results in =224 + 224 + 224 + 32 = 704 bit.…”

Section: Methodsmentioning

confidence: 99%

“…Although that their scheme deployed a great combination of cryptographic and emerging technologies to protect the data, it might face DoS attack and communication delay between the nodes, because of the heavy computation along with high storage cost. Ali et al [22] had cryptanalyzed Liu and Chung [23] scheme and found out that it is unguarded to lost smart-card, offline key cracking, insider, and masquerading attacks. Moreover, [22] had analyzed [18]'s approach, and found that it has correctness issues, broadcasting problems, lack of authentication between the trusted authority and sensor nodes, replay attack, Denial of Service (DoS), and forgery attacks.…”

Section: Related Workmentioning

confidence: 99%

“…Therefore, Ali et al [22] had suggested a secure and lightweight three-factor authentication process for WHSN which employed both ECC, and bilinear pairing to resolve the issues in [18,23] schemes. Although their scheme is guarded against impersonation, privileged-insider, offline password cracking, stolen smart-card, and replay attacks, but it still has high computation cost and delays in communication due to extensive cryptographic operations.…”

Section: Related Workmentioning

confidence: 99%

“…In this section, the computation cost calculation is performed for the proposed protocols that employed a cryptographic hash which takes 0.00032 s along with a biometric reproduce operation that takes 0.0171 s based on the metrics in [38]. The computational cost of the proposed scheme is better than all other schemes in the foreign network side by 60% and 65% and HN side [17,19,22] with a 80% by using P-I and 85% by using P-II. Besides, P-I and P-II perform better than [12,16] in the foreign network side along with HN side with 5% and 15% reduction, respectively, as depicted in Figures 16 and 17.…”

Section: Computational Costmentioning

confidence: 99%

“…Besides, P-I and P-II perform better than [12,16] in the foreign network side along with HN side with 5% and 15% reduction, respectively, as depicted in Figures 16 and 17. Furthermore, we chose a hash function with a 224 bit key size to allow the foreign network to have an adequate level of security better than [12] which takes a 160 bit key size, and [19,22] which takes a 128 bit size key, (see Tables 4-7). Table 5.…”

Section: Computational Costmentioning

confidence: 99%

See 4 more Smart Citations

A Lightweight Three-Factor Authentication Scheme for WHSN Architecture

Almuhaideb¹,

Alqudaihi²

2020

Sensors

View full text Add to dashboard Cite

Wireless Healthcare Sensor Network (WHSN) is a benchmarking technology deployed to levitate the quality of lives for the patients and doctors. WHSN systems must fit IEEE 802.15.6 standard for specific application criteria, unlike some standard criteria that are difficult to meet. Therefore, many security models were suggested to enhance the security of the WHSN and promote system performance. Yu and Park proposed a three-factor authentication scheme based on the smart card, biometric, and password, and their scheme can be easily employed in three-tier WHSN architecture. Furthermore, they claimed that their scheme can withstand guessing attack and provide anonymity, although, after cryptanalysis, we found that their scheme lacks both. Accordingly, we suggested a three-factor authentication scheme with better system confusion due to multiplex parametric features, hash function, and higher key size to increase the security and achieve anonymity for the connected nodes. Moreover, the scheme included initialization, authentication, re-authentication, secure node addition, user revocation, and secure data transmission via blockchain technology. The formal analysis of the scheme was conducted by BAN logic (Burrows Abadi Nadeem) and the simulation was carried out by Tamarin prover to validate that the proposed scheme is resistant to replay, session hijacking, and guessing attacks, plus it provides anonymity, perfect forward secrecy, and authentication along with the key agreement.

show abstract

Section: Methodsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Computational Costmentioning

confidence: 99%

Section: Computational Costmentioning

confidence: 99%

See 3 more Smart Citations

A Lightweight Three-Factor Authentication Scheme for WHSN Architecture

Almuhaideb¹,

Alqudaihi²

2020

Sensors

View full text Add to dashboard Cite

show abstract

Dynamic Forest of Random Subsets‐based supervised hash signature scheme for secure user authentication in smart home environment

Sudha

Jeyanthi

2021

Concurrency and Computation

View full text Add to dashboard Cite

SummaryThe advent of information and communication technology has revolutionized the application of smart home through which the residents remotely establish superior control over the smart devices. The users and the smart devices interact over an insecure communication channel that may help an illegitimate user to gain access on the data disseminated by the smart devices, resulting in high exploiting attacks like privileged insider attack, smart device and gateway node impersonation attack, and smart node capture attack in the smart home. Thus, a secure remote authentication scheme that permits only legitimate users to gain access to the smart devices based on supervised learning becomes essential. In this article, Dynamic Forest of Random Subsets‐based supervised hash signature (DFORS‐SHS) scheme is proposed for robust user authentication in smart homes. This proposed DFORS‐SHS scheme concurrently performs the signed generation of random subsets such that each element of a signature is used for the generation of successive random subset elements for authentication. It utilized the strength of revealed secret keys through chaining approach that bundles the random subset generation and signature. This supervised learning approach only permits the signer of the original message to potentially generate a random subset and prevents the malicious intruder from gaining the access of the smart devices. The formal verification and the security investigation of the proposed DFORS‐SHS scheme are conducted using the Burrows‐Abadi‐Needham (BAN) and AVIPSA toolkit for determining communication cost, communication time, computation time, and energy consumptions incurred during the authentication process. It can be stated that, the communication cost and storage costs of the proposed DFORS‐SHS scheme was also identified to be comparatively minimized than the baseline smart home authentication schemes.

show abstract

Blockchain-Based Access Control for IoT in Smart Home Systems

Mbarek

Pitner

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

An Efficient Mutual Authentication Scheme for Internet of Things

Cited by 35 publications

References 27 publications

A Lightweight Three-Factor Authentication Scheme for WHSN Architecture

A Lightweight Three-Factor Authentication Scheme for WHSN Architecture

Dynamic Forest of Random Subsets‐based supervised hash signature scheme for secure user authentication in smart home environment

Blockchain-Based Access Control for IoT in Smart Home Systems

Contact Info

Product

Resources

About