URASP: an ultralightweight RFID authentication scheme using permutation operation

Due to low-cost, ease of use and convenience, Radio Frequency IDentification (RFID) is a contactless technology that has become more and more promising for automatic identification of an object and people without physical contact. However, the RFID system faces major issues related to its security a...

Full description

Bibliographic Details
Main Authors: Mohd Shariq, Singh, Karan, Maurya, Pramod Kumar, Ahmadian, Ali, Kamel Ariffin, Muhammad Rezal
Format: Article
Published: Springer 2021
_version_ 1796982889011740672
author Mohd Shariq
Singh, Karan
Maurya, Pramod Kumar
Ahmadian, Ali
Kamel Ariffin, Muhammad Rezal
author_facet Mohd Shariq
Singh, Karan
Maurya, Pramod Kumar
Ahmadian, Ali
Kamel Ariffin, Muhammad Rezal
author_sort Mohd Shariq
collection UPM
description Due to low-cost, ease of use and convenience, Radio Frequency IDentification (RFID) is a contactless technology that has become more and more promising for automatic identification of an object and people without physical contact. However, the RFID system faces major issues related to its security and privacy, where an adversary may eavesdrop, temper, modify, and intercept the transmitted messages over a communication channel. To overcome these issues, there is a flexible and effective way to implement an ultralightweight RFID scheme. Therefore, we present an ultralightweight RFID authentication scheme using permutation operation named URASP in this paper. Our proposed scheme integrates permutation and left rotate operation to provide a higher level of security and privacy without increasing storage and computation overhead. In addition, the informal analysis of our proposal illustrates its ability to overcome all known security attacks. We show that the proposed URASP scheme preserves the properties of tags untraceability and information privacy by using Juels and Weis privacy model. The performance analysis has been performed which demonstrates that the proposed scheme outperforms other existing schemes as well as utilizes fewer resources on tags. The verification of our scheme has been done using Scyther simulation tool. Thereafter, the correctness of our scheme has been verified by using BAN logic inference rules. Hence, the proposed scheme is more suited for low-cost passive RFID tags.
first_indexed 2024-03-06T10:58:28Z
format Article
id upm.eprints-93495
institution Universiti Putra Malaysia
last_indexed 2024-03-06T10:58:28Z
publishDate 2021
publisher Springer
record_format dspace
spelling upm.eprints-934952023-01-12T07:24:08Z http://psasir.upm.edu.my/id/eprint/93495/ URASP: an ultralightweight RFID authentication scheme using permutation operation Mohd Shariq Singh, Karan Maurya, Pramod Kumar Ahmadian, Ali Kamel Ariffin, Muhammad Rezal Due to low-cost, ease of use and convenience, Radio Frequency IDentification (RFID) is a contactless technology that has become more and more promising for automatic identification of an object and people without physical contact. However, the RFID system faces major issues related to its security and privacy, where an adversary may eavesdrop, temper, modify, and intercept the transmitted messages over a communication channel. To overcome these issues, there is a flexible and effective way to implement an ultralightweight RFID scheme. Therefore, we present an ultralightweight RFID authentication scheme using permutation operation named URASP in this paper. Our proposed scheme integrates permutation and left rotate operation to provide a higher level of security and privacy without increasing storage and computation overhead. In addition, the informal analysis of our proposal illustrates its ability to overcome all known security attacks. We show that the proposed URASP scheme preserves the properties of tags untraceability and information privacy by using Juels and Weis privacy model. The performance analysis has been performed which demonstrates that the proposed scheme outperforms other existing schemes as well as utilizes fewer resources on tags. The verification of our scheme has been done using Scyther simulation tool. Thereafter, the correctness of our scheme has been verified by using BAN logic inference rules. Hence, the proposed scheme is more suited for low-cost passive RFID tags. Springer 2021-07-10 Article PeerReviewed Mohd Shariq and Singh, Karan and Maurya, Pramod Kumar and Ahmadian, Ali and Kamel Ariffin, Muhammad Rezal (2021) URASP: an ultralightweight RFID authentication scheme using permutation operation. Peer-to-Peer Networking and Applications, 14. pp. 3737-3757. ISSN 1936-6442; ESSN: 1936-6450 https://link.springer.com/article/10.1007/s12083-021-01192-5 10.1007/s12083-021-01192-5
spellingShingle Mohd Shariq
Singh, Karan
Maurya, Pramod Kumar
Ahmadian, Ali
Kamel Ariffin, Muhammad Rezal
URASP: an ultralightweight RFID authentication scheme using permutation operation
title URASP: an ultralightweight RFID authentication scheme using permutation operation
title_full URASP: an ultralightweight RFID authentication scheme using permutation operation
title_fullStr URASP: an ultralightweight RFID authentication scheme using permutation operation
title_full_unstemmed URASP: an ultralightweight RFID authentication scheme using permutation operation
title_short URASP: an ultralightweight RFID authentication scheme using permutation operation
title_sort urasp an ultralightweight rfid authentication scheme using permutation operation
work_keys_str_mv AT mohdshariq uraspanultralightweightrfidauthenticationschemeusingpermutationoperation
AT singhkaran uraspanultralightweightrfidauthenticationschemeusingpermutationoperation
AT mauryapramodkumar uraspanultralightweightrfidauthenticationschemeusingpermutationoperation
AT ahmadianali uraspanultralightweightrfidauthenticationschemeusingpermutationoperation
AT kamelariffinmuhammadrezal uraspanultralightweightrfidauthenticationschemeusingpermutationoperation