期刊文献+

基于读写器和双重ID验证的RFID安全协议

RFID Security Protocol Based on Reader and Double ID Verification
在线阅读 下载PDF
导出
摘要 针对海量标签应用导致RFID系统成本提高的缺点,本文分析现有RFID安全协议的特点及局限性,提出重点关注功能强大的读写器,并提出一种新的基于读写器和双重ID验证的RFID安全协议。读写器对标签的ID(伪ID)进行第一次验证,然后该伪ID与替换表配合,形成一个新的真实ID,读写器进行第二次验证。整个通信过程采用Hash加密和随机数发生器来提高系统安全性。分析结果表明,该协议可以明显降低RFID系统的成本,防止网络攻击,适合于大规模使用标签的RFID系统中。 Aiming at the high cost of RFID system because of the massive tags application, the paper analyzes the characteristics and limitations of the existing RFID security protocol, puts focus on the strong function of the reader, and proposes a new RFID security protocol based on reader and double ID verification. The reader is first verified on the tag ID(fake ID), then the fake ID is joined with the replace table and forms the real ID, and finally the reader is second verified. In the whole communication, Hash encryption and random number generator are adapted to improve the security of the system. Analysis results show that the proposed protocol can significantly reduce the cost of RFID system, prevent network attacks, and be suitable for RFID system in large-scale use tags.
作者 廖剑锋 张超
出处 《计算机与现代化》 2013年第8期179-183,共5页 Computer and Modernization
基金 国家自然科学基金资助项目(61205062) 湖北省自然科学基金资助项目(2012FFB02701)
关键词 射频识别 标签 读写器 双重ID验证 RFID tag reader double ID verification
  • 相关文献

参考文献15

二级参考文献162

  • 1周永彬,冯登国.RFID安全协议的设计与分析[J].计算机学报,2006,29(4):581-589. 被引量:215
  • 2蔡庆玲,詹宜巨,史斌宁.一种符合EPC C1G2标准的RFID随机化密钥双向认证协议[J].电信科学,2007,23(4):70-74. 被引量:4
  • 3Hopper N J and Blum M. Secure human identification protocols. In Advances in Cryptology ASIA CRYPT'01, vol. 2248 of Lecture Notes in Computer Science, 2001: 52-66.
  • 4Juels A and Weis S. Authenticating pervasive devices with human protocols. In Advances in Cryptology -CRYPTO'05, vol.3621 of Lecture Notes in Computer Science, 2005: 293-308.
  • 5Bringer J, Chabanne H, and Dottax E. HB^++: a lightweight authentication protocol secure against some attacks. IEEE International Conference on Pervasive Services, Workshop on Security, Privacy and Trust in pervasive and Ubiquitous Computing SecPerU, 2006: 28-33.
  • 6Selwyn P. HB and related lightweight authentication protocols for secure RFID Tag/Reader authentication. CollECTeR Europe Conference, Basel, Switzerland, June 2006.
  • 7Crawford J M, Kearns M J, and Shapire R E. The minimal disagreement parity problem as a hard satisfiability problem. Tech. rep., Computational Intelligence Research Laboratory and AT&T Bell Labs, February 1994.
  • 8Berlekamp E R, McEliece R J, and Tilborg V. On the inherent intractability of certain coding problems. IEEE Trans. on Information Theory, 1978, 24(3): 384-386.
  • 9Blum A, Furst M, Kearns M, and Lipton R J. Cryptographic primitives based on hard learning problems. In Advances in Cryptology----CRYPTO'93, Vol.773 of Lecture Notes in Computer Science, 1993: 278-291.
  • 10HAstad J. Some optimal inapproximability results. In Symposium on Theory of Computing, El paso, Texas, Unitied States, 1997, Vol 48: 1-10.

共引文献309

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部