摘要
组证明(Grouping-proof)协议的目的是证明阅读器扫描范围内待扫描标签组内标签是否同时存在。随着标签组和组内标签数量的增长,协议中存在的计算时间复杂度、通信总量、组证明生成机制和标签干扰等制约扩展性的因素严重影响了生成有效组证明的成功率。通过比较分析相关协议,设计了一个适用于大规模标签组的只需简单异或和伪随机运算的轻量级组证明协议。在相同的假设模型下,协议能抵抗常见安全攻击,满足强隐私特性的同时,符合超高频段低成本被动式标签的硬件成本要求,具有更高的执行效率。
The purpose of the grouping-proof protocol is to prove if the intra-group tags under scanning exist simultaneouslywithin the scan range of reader.With the quantity increase of tags group and intra-group tags,the factors(such as time complexity computing,communication total quality,grouping-proof generation mechanism and tags interference existing in the protocol)restricting scalability affects on the success rate of the generated effective grouping-proof.On the basis of the comparative analysis of related protocols,a lightweight grouping-proof protocol suitable for large-scale tags group was designed,in which the simple XOR operation and pseudo random operation are carried out for each tag.Under the same presumptive model,the protocolcan resist the common security attacks,satisfy the strong privacy characteristic,conform to the hardware cost requirements ofthe low-cost passive UHF RFID tags,and has high execution efficiency.
作者
尹毅峰
刘扬
徐明明
YIN Yifeng;LIU Yang;XU Mingming(College of Computer and Communication Engineering,Zhengzhou University of Light Industry,Zhengzhou 450001,China)
出处
《现代电子技术》
北大核心
2017年第17期86-90,共5页
Modern Electronics Technique
基金
国家自然科学基金资助项目(61272038
61572445)
关键词
组证明
可扩展性
轻量级
强隐私
grouping-proof
scalability
lightweight
strong privacy
