基于反比例函数的RFID组证明协议

RFID GROUP PROOF PROTOCOL BASED ON INVERSE PROPORTIONAL FUNCTION

针对现有的大多数证明协议仅能证明单组或单标签存在不足,提出一种可适用于证明多标签或多组标签存在的证明协议。协议为减少所有通信实体端计算量,采用一种构造超轻量级的反比例函数算法进行信息加密;给出反比例函数具体构造方法及实现步骤,构造过程中结合加密信息自身汉明重量取值,有效地减少了参数的引入,可一定程度上节约存储空间,同时增加了协议破解难度。从理论角度对协议进行安全及性能方面分析,表明该协议能够抵抗常见类型的攻击,且性能优于其他经典协议。

Most of the existing attestation protocols can only prove the existence of a single group or a single tag.Aiming at this shortcoming,we propose an attestation protocol which can prove the existence of multiple tags or groups of tags.In order to reduce the computation of all communication entities,the protocol used a super lightweight inverse proportional function algorithm to encrypt information.The specific construction method and implementation steps of the inverse proportional function were given.In the construction process,combined with the Hamming weight of the encrypted information itself,the introduction of parameters was effectively reduced,so that the storage space was saved to a certain extent,and the protocol cracking was increased difficulty.This paper analyzed the security and performance of the protocol from the theoretical point of view.The results show that the protocol can resist common types of attacks,and its performance is better than other classic protocols.