Radio frequency identification group proof protocol based on secret key-sharing tree

doi:10.11772/j.issn.1001-9081.2014.07.1884

Journal of Computer Applications ›› 2014, Vol. 34 ›› Issue (7): 1884-1889.DOI: 10.11772/j.issn.1001-9081.2014.07.1884

Previous Articles Next Articles

Radio frequency identification group proof protocol based on secret key-sharing tree

YANG Chao¹,²,ZHANG Hongqi¹,²,YANG Zhi²,³,SHAN Dibin²,³

1. Henan Province Key Laboratory of Information Security, Zhengzhou Henan 450001, China;
2. Information Engineering University, Zhengzhou Henan 450001, China;
3. State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou Henan 450001, China

Received:2014-01-13 Revised:2014-02-27 Online:2014-08-01 Published:2014-07-01
Contact: YANG Chao

基于秘密共享密钥树的无线射频识别组证明协议

杨超¹,²,张红旗¹,²,杨智²,³,单棣斌²,³

1. 河南省信息安全重点实验室，郑州 450001;
2. 信息工程大学，郑州 450001
3. 数字工程与先进计算国家重点实验室，郑州 450001

通讯作者: 杨超
作者简介:杨超(1988-)，男，四川巴中人，硕士研究生，主要研究方向：物联网安全；张红旗(1962-)，男，河北遵化人，教授，博士生导师，主要研究方向：网络安全、物联网安全、网络协议；杨智(1975-)，男，河南开封人，副教授，博士，主要研究方向：信息安全、身份认证；单棣斌(1982-)，男，河北邯郸人，讲师，硕士，主要研究方向：身份认证。
基金资助:
国家973计划项目;国家863计划项目;信息保障技术重点实验室开放基金资助项目

Abstract

Abstract:

Aimed at the problem that existing RFID (Radio Frequency Identification) group proof protocols are inefficient and easily encounter many attacks like replay, tracking and so on, this paper proposed a new group proof protocol based on secret key-sharing tree. This protocol designed a new secret group-proofing key construction based on secret key sharing scheme. The group-proofing key was divided many times into many sub-keys to creat a key tree. This method increased the complexity of the construction of the secret key, increased the difficulty of that attackers attempt to recover the group key and increased the security of tag's group proof. The reader interacts with each tag only once to authenticate its validity and collect the group-proof information. This protocol enormously increases the proof efficiency. Compared to the existing protocols such as Yoking-Proofs, ECC-based and Tree-based, this protocol has better security and higher efficiency.

摘要：

针对现有无线射频识别(RFID)组证明协议易受到重放、跟踪等安全威胁及组证明效率较低的问题，提出了基于秘密共享密钥树的RFID组证明协议。协议设计了基于秘密共享方案的组证明密钥结构，将组密钥多次拆分生成密钥树增加了密钥结构的复杂度，加大了攻击者试图恢复组密钥的难度，提高了安全性；阅读器与每个标签只需一次交互便可以完成标签合法性认证及组证明信息的收集，提高了组证明效率。表明该协议较联合证明协议、基于椭圆曲线密码体制(ECC)的组证明协议、基于树的组证明协议等在安全和性能方面具有明显提高。

CLC Number:

TP309

YANG Chao ZHANG Hongqi YANG Zhi SHAN Dibin. Radio frequency identification group proof protocol based on secret key-sharing tree[J]. Journal of Computer Applications, 2014, 34(7): 1884-1889.

杨超张红旗杨智单棣斌. 基于秘密共享密钥树的无线射频识别组证明协议[J]. 计算机应用, 2014, 34(7): 1884-1889.

References

［1］ZHANG Z, XU Q. Universal composable grouping-proof protocol for RFID tags in the Internet of things［J］. Chinese Journal of Computers, 2011,34(7):1188-1194.(张忠, 徐秋亮. 物联网环境下UC安全的组证明RFID协议［J］. 计算机学报, 2011,34(7):1188-1194.)
［2］ZHOU Y, FENG D. Design and analysis of cryptographic protocols for RFID［J］. Chinese Journal of Computers, 2006,29(4):581-589.(周永彬, 冯登国. RFID安全协议的设计与分析［J］. 计算机学报, 2006,29(4):581-589.)
［3］van DEURSEN T, MAUW S, RADOMIROVIC S. Untraceability of RFID protocols［C］// Proceedings of the 2nd International Workshop on Information Security Theory and Practice. Berlin: Springer-Verlag, 2008:1-15.
［4］HA J, MOON S, ZHOU J, et al. A new formal proof model for RFID location privacy［C］// Proceedings of the 13th European Symposium on Research in Computer Security, LNCS 5283. Berlin: Springer-Verlag, 2008: 267-281.
［5］MA C. Low cost RFID authentication protocol with forward privacy［J］. Chinese Journal of Computers, 2011,34(8):1387-1398.(马昌社, 前向隐私安全的低成本RFID协议［J］. 计算机学报, 2011,34(8):1387-1398.)
［6］DING Z, LI J, FENG B. Research on Hash-based RFID security authentication protocol［J］. Journal of Computer Research and Development, 2009,46(4):583-592.(丁振华,李锦涛,冯波. 基于Hash函数的RFID安全认证协议研究［J］. 计算机研究与发展, 2009,46(4):583-592.)
［7］SONG B, MITCHELL C J. Scalable RFID security protocols supporting tag ownership transfer［J］. Computer Communications, 2011, 34(4):556-566.
［8］WANG S, LIU S, CHEN D. Scalable RFID mutual authentication protocol with backward privacy［J］. Journal of Computer Research and Development, 2013,50(6):1276-1284.(王少辉,刘素娟,陈丹伟. 满足后向隐私的可扩展RFID双向认证方案［J］. 计算机研究与发展, 2013,50(6):1276-1284.)
［9］JUELS A. “Yoking-Proofs” for RFID tags［C］// Proceedings of the 2nd IEEE Annual Conference on Pervasive Computing and Communications Workshops. Washington, DC: IEEE Computer Society, 2004:138-143.
［10］SAITO J, SAKURAI K. Grouping proof for RFID tags［C］// Proceedings of the 19th International Conference on Advanced Information Networking and Applications. Washington, DC: IEEE Computer Society, 2005:621-624.
［11］PIRMUTHU S. On existence proofs for multiple RFID tags［C］// Proceedings of the ACS/IEEE International Conference on Pervasive Services. Washington, DC: IEEE Computer Society, 2006:317-320.
［12］PERIS-LOPEZ P, HEMANDEZ-CASTRO J C, ESTEVEZ-TAPIADOR J M,et al. Solving the simultaneous scanning problem anonymously: Clumping proofs for RFID tags［C］// Proceedings of the 3rd International Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing. Washington, DC: IEEE Computer Society, 2007:55-60.
［13］LIN C C, LAI Y C, TYGAR J D, et al. Coexistence proof using chain of timestamps for multiple RFID tags［C］// Advances in Web and Network Technologies, and Information Management, LNCS 4537. Berlin: Springer-Verlag, 2007:634-643.
［14］BATINA L, LEE Y K, SEYS S, et al. Privacy preserving ECC-based grouping proofs for RFID［C］// Proceedings of the 13th International Conference on Information Security. Berlin: Springer-Verlag,2010: 159-165.
［15］LV C, LI H, MA J F, et al. Security analysis of a privacy-preserving ECC-based grouping-proof protocol［J］. Journal of Convergence Information Technology, 2011,6(3):113-119;
［16］KANG H. Analysis and improvement of grouping-proof protocol for RFID based on ECC［J］. Computer Engineering, 2013,39(1):153-156.(康鸿雁. 基于ECC的RFID组证明协议分析及改进［J］. 计算机工程, 2013,39(1):153-156.)
［17］CHIEN H Y, LIU S B. Tree-based RFID yoking proof［C］// Proceedings of the 2009 International Conference on Networks Security, Wireless Communications and Trusted Computing. Washington, DC: IEEE Computer Society, 2009: 550-553;
［18］SHAMIR A. How to share a secret［J］. Communications of the ACM, 1979, 22(11): 612-613.

[1]	SHE Wei, MA Tianxiang, FENG Haige, TIAN Zhao, LIU Wei. Blockchain covert communication method based on contract call concealment#br# #br# [J]. Journal of Computer Applications, 0, (): 0-0.
[2]	Rui GAO, Xuebin CHEN, Zucuan ZHANG. Dynamic social network privacy publishing method for partial graph updating [J]. Journal of Computer Applications, 2024, 44(12): 3831-3838.
[3]	Yong XIANG, Yanjun LI, Dingyun HUANG, Yu CHEN, Huiqin XIE. Differential and linear characteristic analysis of full-round Shadow algorithm [J]. Journal of Computer Applications, 2024, 44(12): 3839-3843.
[4]	Zhenhao ZHAO, Shibin ZHANG, Wunan WAN, Jinquan ZHANG, zhi QIN. Delegated proof of stake consensus algorithm based on reputation value and strong blind signature algorithm [J]. Journal of Computer Applications, 2024, 44(12): 3717-3722.
[5]	Yiting WANG, Wunan WAN, Shibin ZHANG, Jinquan ZHANG, Zhi QIN. Linkable ring signature scheme based on SM9 algorithm [J]. Journal of Computer Applications, 2024, 44(12): 3709-3716.
[6]	Jing LIANG, Wunan WAN, Shibin ZHANG, Jinquan ZHANG, Zhi QIN. Traceability storage model of charity system oriented to master-slave chain [J]. Journal of Computer Applications, 2024, 44(12): 3751-3758.
[7]	Deyuan LIU, Jingquan ZHANG, Xing ZHANG, Wunan WAN, Shibin ZHANG, Zhi QIN. Cross-chain identity authentication scheme based on certificate-less signcryption [J]. Journal of Computer Applications, 2024, 44(12): 3731-3740.
[8]	Xin ZHANG, Jinquan ZHANG, Deyuan LIU, Wunan WAN, Shibin ZHANG, Zhi QIN. Cross-chain identity management scheme based on identity-based proxy re-encryption [J]. Journal of Computer Applications, 2024, 44(12): 3723-3730.
[9]	DENG Yilin, YU Fajiang. Pseudo-random number generator based on LSTM and separable self-attention mechanism#br# #br# [J]. Journal of Computer Applications, 0, (): 0-0.
[10]	. Correlation power analysis of advanced encryption standard algorithm based on uniform manifold approximation and projection [J]. Journal of Computer Applications, 0, (): 0-0.
[11]	. Dynamic searchable encryption scheme based on puncture pseudorandom function [J]. Journal of Computer Applications, 0, (): 0-0.
[12]	. fedPF: Federated learning for personalization and fairness [J]. Journal of Computer Applications, 0, (): 0-0.
[13]	. Review of research on conflict-based cache side-channel attacks and eviction sets [J]. Journal of Computer Applications, 0, (): 0-0.
[14]	. Secure and efficient frequency estimation method based on shuffled differential privacy [J]. Journal of Computer Applications, 0, (): 0-0.
[15]	. Blockchain-based model for notarization of simulation testing data in autonomous driving [J]. Journal of Computer Applications, 0, (): 0-0.

Radio frequency identification group proof protocol based on secret key-sharing tree

基于秘密共享密钥树的无线射频识别组证明协议

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics