期刊文献+

对HB~#协议的代数分析

Algebraic Analysis on HB~# Authentication Protocol
下载PDF
导出
摘要 HB协议是一类对计算要求极低的认证协议,能够抵抗量子攻击,非常适合于移动和物联网环境,而这种无线通信环境要求HB协议应该具有抗中间人攻击的能力.基于此,设计了一种对HB~#协议进行中间人攻击的代数分析方法,在这种代数攻击中,认证密钥可以被快速地恢复.这一攻击方法建立在Z2中一类多元二次方程组的解的基础之上,首先找到了这类方程组有解的充分必要条件和求解算法,然后利用这一结果对HB~#协议进行中间人攻击. HB-like protocols are such a kind of authentication protocols that require low computational resource and promise to resist quantum attacks. They are especially suitable for mobile applications and the Internet of Things (IoT). However, the wireless communications in these environments have compelled that HB-like protocols should be able to resist the man-in-the-middle (MIM) attacks. In this vein, this paper proposes an algebraic MIM attack to a recently presented HB^# authentication protocol which is claimed to resist MIM attacks. During this attack, the authentication keys can be totally recovered efficiently. The proposed attacking method is based on the solutions to a system of quadratic equations of muhi-variables over Z2. Hence, the necessary and sufficient conditions for this system of equations being solvable have been found in advance. Then, an algebraic attack to HB^# protocol has been presented accordingly.
作者 姜晓 马昌社
出处 《华南师范大学学报(自然科学版)》 CAS 北大核心 2017年第1期110-115,共6页 Journal of South China Normal University(Natural Science Edition)
基金 国家自然科学基金项目(61672243) 广东省自然科学基金项目(S2013020011913) 广东省教育厅科技创新项目(2013KJCX0055) 广州市基础研究项目(11C42090777)
关键词 HB协议 代数攻击 中间人攻击 HB protocol algebraic attacks man-in-the-middle attack
  • 相关文献

参考文献3

二级参考文献51

  • 1周永彬,冯登国.RFID安全协议的设计与分析[J].计算机学报,2006,29(4):581-589. 被引量:211
  • 2曾丽华,熊璋,张挺.Key值更新随机Hash锁对RFID安全隐私的加强[J].计算机工程,2007,33(3):151-153. 被引量:34
  • 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.

共引文献119

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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