Abstract

The implementation of efficient security mechanisms for Radio Frequency Identification (RFID) system has always been a continuous challenge due to its limited computing resources. Previously, hash-based, symmetric-key cryptography-based and elliptic curve cryptography based security protocols were proposed for RFID system. However, these protocols are not suitable because some of them failed to fulfil the RFID security requirements, and some of them produce high computational overhead. Recently researchers have focused on developing an efficient security mechanism based on Hyper Elliptic Curve Cryptography (HECC) which provides high security with 80 bits lower-key size. In this paper, we propose an efficient RFID authentication scheme (RFID-AS) based on hyperelliptic curve Signcryption. The proposed RFID-AS provides the required security features for the RFID system as well as security from potential attacks. We validated the security of proposed RFID-AS by using formal security analysis techniques, such as the Real-Or-Random (ROR) model and Automated Validation of Internet Security Protocols and Applications (AVISPA). Furthermore, the results reveal that the computational, communication and storage overheads of the proposed RFID-AS is much less than the other recently proposed schemes. Compared to the most recently published work based on ECC Signcryption, our scheme is 70% efficient in terms of computational overhead, 42.7% efficient in terms of communication overhead, and 57.7% efficient in terms of storage overhead. Therefore, the proposed RFID-AS is more efficient as compared to the recently published work in this domain. Hence, it is an attractive solution for resource-limited devices like RFID tags.

Highlights

  • The rapidly evolving computing age has enabled all sorts of possibilities to automate processes and recognize items that have become crucial components of computing due to the fact it saves time and produces minimal errors as they pave the way to substantial productivity benefits

  • Bar codes, voice recognition, optical character recognition, smart cards, magnetic stripes, chip cards, biometrics, and Radio Frequency Identification (RFID) are among the multitude of technologies that have been developed to incorporate Automatic Identification and Data Capture (AIDC)

  • We have shown that our scheme provides security against replay, man-in-the-middle (MiM), impersonation, cloning, location tracking, desynchronization, Denial of Service (DoS), and key compromise attacks

Read more

Summary

INTRODUCTION

The rapidly evolving computing age has enabled all sorts of possibilities to automate processes and recognize items that have become crucial components of computing due to the fact it saves time and produces minimal errors as they pave the way to substantial productivity benefits. RFID systems have some limitations, including less storage capacity and low processing speed of the tag With such inadequate computational resources, designing and implementing security schemes that provide security features has been very demanding. ECC-based schemes perform better than the RSA, while HECC performs better than ECC by providing the same security features with less computation cost, communication overhead, and memory requirement. They produce smaller ciphertext as compared to other Public Key Cryptography (PKC) schemes Due to these features, HECC is an attractive cryptographic scheme to offer security for systems having limited computational resources such as RFID. ECC has higher computation overhead and generates excessive communication cost compared to HECC having 80-bits key size [20] that generates less communication and computational cost than ECC Their proposed protocol does not fulfill performance efficiency because their scheme generates excessive communication overhead computational overhead.

RELATED WORK
PROPOSED SCHEME
PROPOSED AUTHENTICATION SCHEME
PROOF OF CORRECTNESS
SECURITY ANALYSIS
FORMAL SECURITY ANALYSIS THROUGH ROR MODEL
FUTURE WORK
Findings
VIII. CONCLUSION
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