Solving Scalability Problems on Secure RFID Grouping-Proof Protocol

Scalable grouping-proof protocol has broad and various RFID applications. It generates a proof to confirm scalable multiple co-existing tags within timeout period. The scalability problems focus on performance of generating the scalable grouping-proof, such as messages relay, collision, exhaustive search and computation load of lightweight tag. No integrated solution is presented to scalability problems on RFID grouping-proof. In this paper, a novel protocol is proposed to solve scalability problems and offer secure properties including the mutual authentication, replay attack prevention, forward security, anonymity, and forge proof resistance. In addition, the pseudo identity with direct search is used to provide the privacy and unlinkability. The proposed mechanism adopts broadcast and pre-ordering responses scheme to improve system performance. The achievement is based on reducing the number of message relay, avoiding collision of responses and computing simultaneously of multiple lightweight tags. The experimental results of simulation show that the scalability requirements on grouping-proof protocol are satisfied with our protocol. Within timeout period of 400 ms, the proposed protocol could provide a proof with a scale up to about 130 and 600 tags under data rate of 105 and 640 kbps. The scalability performance of the proposed protocol is more than 3 times better than the other grouping-proof protocols.