基于字合成运算的标签组群组共存证明协议
TAG GROUPS COEXISTENCE PROOF PROTOCOL BASED ON WORD COMPOSITION OPERATION
黄源 1彭迪2
作者信息
- 1. 重庆航天职业技术学院计算机系 重庆 400021
- 2. 西南政法大学国家刑事侦查学院 重庆 401120
- 折叠
摘要
针对现有的大多数证明协议无法同时证明多标签同时存在缺陷,提出一种具有可扩展性的电子标签组证明协议.协议采用按位运算设计实现的字合成运算对信息加密,字合成运算可使得协议达到超轻量级计算;同时字合成运算实现中巧妙运用参数自身具备的汉明重量,可减少参量引入;协议基于先验证再响应机制,可抵抗假冒攻击等.对协议进行不同角度分析,表明协议能够提供较高的安全性能,同时能够适用于现有低成本被动式电子标签系统中.
Abstract
Aimed at most of the existing attestation protocols can't prove the existence of multiple tags at the same time,a scalable group of electronic tags attestation protocol is proposed.The protocol used the word composition operation designed by bit operation to encrypt the information.The word composition operation could make the protocol achieve ultra-lightweight calculation.At the same time,the Hamming weight of the parameters was used to reduce the introduction of parameters.Based on the mechanism of verification before response,the protocol could resist counterfeiting attacks.The analysis of the protocol from different angles shows that the protocol can provide high security performance and can be applied to the existing low-cost passive electronic tag system.
关键词
物联网/射频识别系统/标签组/群组证明协议/可扩展性/字合成运算Key words
Internet of things/RFID system/Tag group/Groups proof protocol/Scalability/Word synthesis operation引用本文复制引用
基金项目
2018年重庆市教委科技项目(KJQN201803002)
出版年
2024
国家科技期刊平台
NSTL
维普
万方数据