4.6 Article

A Lightweight RFID Mutual Authentication Protocol Based on Physical Unclonable Function

Journal

SENSORS
Volume 18, Issue 3, Pages -

Publisher

MDPI
DOI: 10.3390/s18030760

Keywords

RFID technology; Physical Unclonable Function; lightweight cryptography; mutual verification

Funding

  1. National Natural Science Foundation of P. R. China [61572260, 61572261, 61672296, 61602261]
  2. Natural Science Foundation of Jiangsu Province [BK20140888]
  3. Jiangsu Natural Science Foundation for Excellent Young Scholars [BK20160089]
  4. Scientific & Technological Support Project of Jiangsu Province [BE2015702, BE2016185, BE2016777]
  5. China Postdoctoral Science Foundation [2014M561696]
  6. Jiangsu Planned Projects for Postdoctoral Research Funds [1401005B]
  7. Postgraduate Research and Practice Innovation Program of Jiangsu Province [SJLX16_0326, KYCX17_0798]
  8. Project of Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks [WSNLBZY201509]

Ask authors/readers for more resources

With the fast development of the Internet of Things, Radio Frequency Identification (RFID) has been widely applied into many areas. Nevertheless, security problems of the RFID technology are also gradually exposed, when it provides life convenience. In particular, the appearance of a large number of fake and counterfeit goods has caused massive loss for both producers and customers, for which the clone tag is a serious security threat. If attackers acquire the complete information of a tag, they can then obtain the unique identifier of the tag by some technological means. In general, because there is no extra identifier of a tag, it is difficult to distinguish an original tag and its clone one. Once the legal tag data is obtained, attackers can be able to clone this tag. Therefore, this paper shows an efficient RFID mutual verification protocol. This protocol is based on the Physical Unclonable Function (PUF) and the lightweight cryptography to achieve efficient verification of a single tag. The protocol includes three process: tag recognition, mutual verification and update. The tag recognition is that the reader recognizes the tag; mutual verification is that the reader and tag mutually verify the authenticity of each other; update is supposed to maintain the latest secret key for the following verification. Analysis results show that this protocol has a good balance between performance and security.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available