Offlined simultaneous grouping proof for RFID tags

Abstract

Grouping proof is a security token that proves the existence of multiple RFID tags at the same period of time. In the research field of grouping proof, some of the previous works are vulnerable to replay attack. Others have limitations in operating environments, like readers need to stay connected (on-line) to the server, and tags need to be queried sequentially. In this paper, we summarize guidelines of a good grouping proof from previous works. We proposed two grouping proofs: O-SI-Grouping proof and O-SI-Grouping proof with forward secrecy. Tag of the first protocol requires a MAC function, which is simpler to implement. The second protocol requires each tag contain an encryption function so that it can provide forward secrecy. Both of the proposed schemes provides offline generation and can access tags simultaneously.© 2009 IEEE.