期刊文献+

基于LPN问题的RFID安全协议设计与分析 被引量:13

Design and Analysis of Security Protocols for RFID Based on LPN Problem
下载PDF
导出
摘要 该文对现有的基于LPN问题的RFID安全协议进行了系统分析,总结了这类协议存在的一些设计缺陷。为了克服这类协议中存在的安全漏洞,对其中一个最新版本的协议HB+进行改进,设计了一个新的RFID安全协议HB^#,并在随机预言模型下给出了新协议的归约性证明。 The existing security protocols for RFID based on LPN problem are systematically analyzed and their secure vulnerabilities are summarized. In order to conquer these security leaks, a new RFID security protocol named HB- is designed, which is an improved version of HB protocol. Finally, it is proved that HB^# protocol is secure in the random oracle model.
作者 唐静 姬东耀
出处 《电子与信息学报》 EI CSCD 北大核心 2009年第2期439-443,共5页 Journal of Electronics & Information Technology
基金 国家自然科学基金(90604010)资助课题
关键词 射频身份识别 LPN 认证 归约 RFID(Radio Frequency IDentification) LPN(Learning Parity in the Presence of Noise) Authentication Reduction
  • 相关文献

参考文献12

  • 1Hopper 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.
  • 2Juels 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.
  • 3Bringer 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.
  • 4Selwyn P. HB and related lightweight authentication protocols for secure RFID Tag/Reader authentication. CollECTeR Europe Conference, Basel, Switzerland, June 2006.
  • 5Crawford 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.
  • 6Berlekamp 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.
  • 7Blum 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.
  • 8HAstad J. Some optimal inapproximability results. In Symposium on Theory of Computing, El paso, Texas, Unitied States, 1997, Vol 48: 1-10.
  • 9Kearns M. Efficient noise-tolerant learning from statistical queries. Journal of the ACM, 1998, 45(6): 983-1006.
  • 10Hopper N J and Blum M A. Secure human-computer authentication scheme. Tech. Rep. CMU-CS-00-139, Carnegie Mellon University, 2000.

同被引文献149

引证文献13

二级引证文献109

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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