Abstract

More security concerns and complicated requirements arise in wireless sensor networks than in wired networks, due to the vulnerability caused by their openness. To address this vulnerability, anonymous authentication is an essential security mechanism for preserving privacy and providing security. Over recent years, various anonymous authentication schemes have been proposed. Most of them reveal both strengths and weaknesses in terms of security and efficiency. Recently, Farash et al. proposed a lightweight anonymous authentication scheme in ubiquitous networks, which remedies the security faults of previous schemes. However, their scheme still suffers from certain weaknesses. In this paper, we prove that Farash et al.’s scheme fails to provide anonymity, authentication, or password replacement. In addition, we propose an enhanced scheme that provides efficiency, as well as anonymity and security. Considering the limited capability of sensor nodes, we utilize only low-cost functions, such as one-way hash functions and bit-wise exclusive-OR operations. The security and lightness of the proposed scheme mean that it can be applied to roaming service in localized domains of wireless sensor networks, to provide anonymous authentication of sensor nodes.

Highlights

  • Privacy protection and security provision have been of great concern in proportion to the number of sensor nodes in wireless sensor networks

  • Considering a mobile sensor node that travels in various networks and wants to receive roaming service from a foreign agent, an anonymous authentication scheme is necessary to preserve the sensor node’s privacy and security

  • We first prove that Farash et al.’s scheme fails to guarantee strong anonymity, foreign agent authentication, or password replacement

Read more

Summary

Introduction

Privacy protection and security provision have been of great concern in proportion to the number of sensor nodes in wireless sensor networks. Various anonymous authentication schemes and related protocols in wireless networks have been proposed [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25]. There have been no recent schemes, which the proposed scheme is based only on low-cost functions, it runs faster and more efficiently than guarantee all the above. Previous schemes, which have recently been proposed, show the following research trends

Related
Registration Phase
Login and Authentication Phase
H A first
Password change
Anonymity
Authentication
Password Replacement
The Proposed Scheme
Password Change Phase
Protocol Analysis
Security Analysis
Strong Anonymity
Hop-by-Hop Authentication
Untraceability
Resistance Against Password Guessing Attack
Resistance Against Impersonation and Forgery Attacks
Resistance Against Known Session Key Attack
Fair Key Agreement
Security and Performance Comparisons
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call