Provably secure two-round RFID grouping proof protocols
Provably secure two-round RFID grouping proof protocols
复制标题
DOI：
10.1109/rfid-ta.2014.6934242
复制
发表时间：
2014-09
期刊：
影响因子：
--
通讯作者：
D. Moriyama
中科院分区：
文献类型：
--
作者：
D. Moriyama
证明多个RFID标签共存的证据被称为组证明，它对处理物联网（IoT）中的许多商业产品非常有用。现有的许多组证明协议都存在一个共同的问题，即RFID读写器与组中的RFID标签进行增量式通信，且轮复杂度相当高。本文证明了存在一种可证明安全的RFID组证明协议，该协议的组证明是在恒轮中生成的。特别地，我们提出了两轮RFID组证明协议，分别防止模拟攻击和中间人攻击。
A witness to show the coexistence of multiple RFID tags is called grouping-proof and it is useful to handle a lot of commercial products in Internet of Things (IoT). Many of the existing grouping-proof protocols have a common problem that the RFID reader incrementally communicates with the RFID tags in the group and the round complexity is quite high. In this paper, we show that there exists a provably secure RFID grouping-proof protocol which the grouping-proof is generated in the constant round. Especially, we propose two-round RFID grouping-proof protocols secure against the impersonation attack and man-in-the-middle attack, respectively.