RFID Tags Batch Authentication Revisited - Communication Overhead and Server Computational Complexity Limits

摘要

We address the problem of batch tag authentication. Leveraging from previous work in the field we provide analysis of its shortcomings and provide usable extension to the protocols. The direct contribution of this paper is a computationally-efficient method of verification and identification of a subset of tags within a batch, in a system where the reader does not have to be a trusted party, and the tags can achieve reasonable anonymity.