z-logo
open-access-imgOpen Access
Efficient serverless radio‐frequency identification mutual authentication and secure tag search protocols with untrusted readers
Author(s) -
Mtita Collins,
Laurent Maryline,
Delort Jacques
Publication year - 2016
Publication title -
iet information security
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 34
eISSN - 1751-8717
pISSN - 1751-8709
DOI - 10.1049/iet-ifs.2015.0428
Subject(s) - mutual authentication , computer science , radio frequency identification , authentication (law) , key (lock) , computer security , identification (biology) , authentication protocol , protocol (science) , computer network , medicine , botany , alternative medicine , pathology , biology
Radio‐frequency identification (RFID) technology's potential relies on advances made by researchers for addressing the technology's security and privacy vulnerabilities, and making data collection and storage in an RFID system safe. Privacy and security are key concerns, as paramount as efficiency and reliability, in raising the confidence of end users towards RFID technologies. This study proposes two complementary lightweight and efficient serverless security protocols in the presence of untrusted RFID readers. The first one is used for mass authentication of RFID tags and supports mutual authentication with key establishment. The second one is an RFID tag search protocol that helps interacting with one specific tag surrounded by a huge number of other tags. The originality of both protocols holds that no shared parameters are required between tags and readers for mutual authentication support, they refer to the same basic material, and they have low resource demands in storage, bandwidth, energy and computation for both RFID readers and tags. Finally, the authors’ protocols have been formally verified under the computational model using CryptoVerif tool.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here