Journal of Computer Applications ›› 2021, Vol. 41 ›› Issue (6): 1621-1630.DOI: 10.11772/j.issn.1001-9081.2020121947

Special Issue: 2020年全国开放式分布与并行计算学术年会(DPCS 2020)

• National Open Distributed and Parallel Computing Conference 2020 (DPCS 2020) • Previous Articles     Next Articles

Lightweight anonymous mutual authentication protocol based on random operators for radio frequency identification system

WU Kaifan1, YIN Xinchun1,2   

  1. 1. College of Information Engineering, Yangzhou University, Yangzhou Jiangsu 225127, China;
    2. Guangling College of Yangzhou University, Yangzhou Jiangsu 225128, China
  • Received:2020-11-04 Revised:2021-03-30 Online:2021-06-10 Published:2021-06-21
  • Supported by:
    This work is partially supported by the National Natural Science Foundation of China (61472343).


吴恺凡1, 殷新春1,2   

  1. 1. 扬州大学 信息工程学院, 江苏 扬州 225127;
    2. 扬州大学广陵学院, 江苏 扬州 225128
  • 通讯作者: 殷新春
  • 作者简介:吴恺凡(1995-),男,江苏南京人,硕士研究生,主要研究方向:射频识别通信认证、物联网安全、加密算法和协议;殷新春(1962-),男,江苏姜堰人,教授,博士,博士生导师,主要研究方向:密码学、软件质量保障、高性能计算。
  • 基金资助:

Abstract: The Radio Frequency Identification (RFID) system is vulnerable to malicious attacks in the wireless channel and the privacy of the tag owners is often violated. In order to solve the problems, a lightweight RFID authentication protocol supporting anonymity was proposed. Firstly, the random number generator was used to generate the unpredictable sequence for specifying the lightweight operators participating in the protocol. Then, the seed was specified to achieve the key negotiation between the reader and the tag. Finally, the mutual authentication and information updating were achieved. The comparison results with some representative lightweight schemes show that the proposed scheme saves the the tag storage overhead by up to 42% compared with the similar lightweight protocols, and the has the communication overhead also maintained at the low level of similar schemes at the same time, and is able to support the multiple security requirements. The proposed scheme is suitable for low-cost RFID systems.

Key words: Radio Frequency IDentification (RFID), lightweight, k-anonymity, mutual authentication, Burrows, Abadi and Needham (BAN) logic, formal verification

摘要: 针对无线射频识别(RFID)系统容易遭受无线信道中的恶意攻击以及标签所有者隐私时常收到侵犯的问题,提出了一种支持匿名的轻量级RFID认证协议。首先,使用了随机数发生器生成不可预测的序列以指定参与协议的轻量级运算符;然后,通过指定种子以实现阅读器与标签之间的密钥协商;最后,实现双向认证与信息更新。通过与部分典型的轻量级方案的对比可知,所提出的方案相较同类的轻量级协议最多节省近42%的标签存储开销,同时其通信开销维持在同类方案的低水平位置,且能够支持多种安全需求。所提方案适用于低成本RFID系统。

关键词: 无线射频识别, 轻量级, k-匿名, 双向认证, BAN逻辑, 形式化验证

CLC Number: