Physically Unclonable Function-Based Security and Privacy in RFID Systems
Top Cited Papers
- 1 January 2007
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Fifth Annual IEEE International Conference on Pervasive Computing and Communications (PerCom'07)
- p. 211-220
- https://doi.org/10.1109/percom.2007.26
Abstract
Radio frequency identification (RFID) is an increasingly popular technology that uses radio signals for object identification. Tracking and authentication in RFID tags have raised many privacy and security concerns. On the other hand, known privacy and security cryptographic defenses are too hardware-expensive to incorporate into low-cost RFID tags. In this paper, we propose hardware-based approaches to RFID security that rely on physically unclonable functions (PUFs). These functions exploit the inherent variability of wire delays and parasitic gate delays in manufactured circuits, and may be implemented with an order-of-magnitude reduction in gate count as compared with traditional cryptographic functions. We describe protocols for privacy-preserving tag identification and secure message authentication codes. We compare PUFs to digital cryptographic functions, address other uses of PUFs to enhance RFID security and suggest interesting directions for future research. The proposed solutions are efficient, practical, and appropriate for low-cost RFID systemsKeywords
This publication has 6 references indexed in Scilit:
- Multi-Tag Radio Frequency Identification SystemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Generalized "Yoking-Proofs" for a Group of RFID TagsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Extracting secret keys from integrated circuitsIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2005
- A Scalable and Provably Secure Hash-Based RFID ProtocolPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Silicon physical random functionsPublished by Association for Computing Machinery (ACM) ,2002
- Random oracles are practicalPublished by Association for Computing Machinery (ACM) ,1993