Improving Scalability for RFID Privacy Protection Using Parallelism

In the ubiquitous environment of the next generation, RFID is predicted to occupy an important technical location and also expected to apply to various fields. However, the properties of tags in itself which is the core of RFID have a dysfunction like an invasion of privacy for user. An existing cryptanalytic protection scheme of the information leakage has a difficult problem to apply to RFID tags for privacy protection. We applied Ohkubo scheme to the protection of the tag´s information efficiently in the RFID system environment using low-cost tags. But, this method has all information of tags to identify tag´s ID and then performs the process of identification in sequence in the back-end server. These processes have lots of computations so that it has problems about scalability. In this paper, we are based on Ohkubo scheme to solve problems, and then analyze the parallelism with the Hellman´s tradeoff method and divide it into nodes in parallel. As a result, we can reduce the computing complexity. So, we show the results to be enhanced the scalability.