Robust, anonymous RFID authentication with constant key-lookup

A considerable number of anonymous RFID authentication schemes have been proposed. However, current proposals either do not provide robust security guarantees, or suffer from scalability issues when the number of tags issued by the system is very large. In this paper, we focus on approaches that reconcile these important requirements. In particular, we seek to reduce the complexity of identifying tags by the back-end server in anonymous RFID authentication protocols--what we term the key-lookup problem. We propose a compiler that transforms a generic RFID authentication protocol (supporting anonymity) into one that achieves the same guarantees with constant key-lookup cost even when the number of tags is very large (billions of tags and beyond). This approach uses a lightweight one-way trapdoor function and produces protocols that are suitable for deployment into current tag architectures. We then explore the issue of minimal assumptions required, and show that one-way trapdoor functi...

• Type: Conference
• Year: 2008
• Where: CCS
• Authors: Mike Burmester, Breno de Medeiros, Rossana Motta
• Keywords: Anonymous Rfid Authentication, CCS 2008, One-way Trapdoor Functions, RFID Authentication, Security Privacy