A high-security RFID grouping proof protocol

Abstract

Several categories of RFID authentication protocols have been proposed recently, among which Jules [5] introduced a novel research direction, named yoking proof. It is used to solve the problem that two tags have to be scanned simultaneously for some reasons. Afterwards, the yoking proof was developed into the grouping proof protocol and many such protocols have been presented. However there are some flaws on security or computational overhead. Based on the existing grouping proof protocols, a new method on key distribution is developed in this paper by means of distributing the points on straight lines to the entities. With this method, the performance of the grouping proof protocol will be improved. In comparison with the previous protocols, it provides security enhancement and performance improvement, which balances security and computational overhead to some extent.