计算机科学与探索 ›› 2018, Vol. 12 ›› Issue (7): 1117-1125.DOI: 10.3778/j.issn.1673-9418.1705011

• 网络与信息安全 • 上一篇    下一篇

无后端数据库的RFID安全认证协议的改进方案

王萍,周治平,李静   

  1. 江南大学 物联网技术应用教育部工程研究中心,江苏 无锡 214122
  • 出版日期:2018-07-01 发布日期:2018-07-06

Improved Server-less RFID Security Authentication Protocol

WANG Ping, ZHOU Zhiping, LI Jing   

  1. Engineering Research Center of Internet of Things Technology Applications of Ministry of Education, Jiangnan University, Wuxi, Jiangsu 214122, China
  • Online:2018-07-01 Published:2018-07-06

摘要:

针对现有无后端数据库RFID(radio frequency identification)认证协议存在的安全隐私以及效率低的问题,在Deng等人方案的基础上提出了改进方案。采用组身份标识共享技术,防止读写器穷举搜索,降低读写器搜索时间复杂度;改进读写器成功认证标签后更新共享密钥的方式,实现阅读器和标签密钥的同步更新;引入阅读器和标签产生的随机数种子作为密钥更新的参数,确保密钥的新鲜性和随机性,以保护位置隐私。通过安全性分析和实验分析可知,改进方案有效增强了原协议的安全性,并且提高了读写器的搜索效率,降低了读写器搜索耗时和一轮完整通信所需时间,因此改进方案的实用性更佳。

关键词: 无线射频识别, 无后端数据库, 认证协议, 时间复杂度, 位置隐私

Abstract:

Aiming at the security and privacy as well as low efficiency problem in existing server-less RFID (radio frequency identification) authentication protocols, this paper proposes an improved scheme based on Deng et al.??s scheme. In order to reduce the time complexity of reader, group identifier sharing technique is used to prevent the reader from performing an exhaustive search. After the reader successfully authenticates the tag, the way to update shared key is improved to achieve the synchronization between the reader and tag. Moreover, the proposed scheme adds the random number seed of reader and tag to the key update operation in order that the key can keep freshness and randomness. As a result, the proposed scheme can guarantee location privacy. The security and experimental analysis show that the improved scheme effectively enhances the security of the original protocol while improves the search efficiency of reader. The improved scheme reduces the search time-consuming of reader and the time required for a complete communication, therefore, the improved scheme is more practical.

Key words: radio frequency identification (RFID), server-less, authentication protocol, time complexity, location privacy