Provably secure two-round RFID grouping proof protocols

Abstract

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.