How to construct random functions
Journal of the ACM (JACM)
Secure Human Identification Protocols
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The blocker tag: selective blocking of RFID tags for consumer privacy
Proceedings of the 10th ACM conference on Computer and communications security
Privacy and security in library RFID: issues, practices, and architectures
Proceedings of the 11th ACM conference on Computer and communications security
RFID Privacy: An Overview of Problems and Proposed Solutions
IEEE Security and Privacy
Untraceable RFID tags via insubvertible encryption
Proceedings of the 12th ACM conference on Computer and communications security
RFID security without extensive cryptography
Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks
YA-TRAP: Yet Another Trivial RFID Authentication Protocol
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Mutual authentication protocol for RFID conforming to EPC Class 1 Generation 2 standards
Computer Standards & Interfaces
Defining Strong Privacy for RFID
PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
A Survey of Lightweight-Cryptography Implementations
IEEE Design & Test
Mutual authentication in RFID: security and privacy
Proceedings of the 2008 ACM symposium on Information, computer and communications security
PRESENT: An Ultra-Lightweight Block Cipher
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
A New Formal Proof Model for RFID Location Privacy
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
Unidirectional key distribution across time and space with applications to RFID security
SS'08 Proceedings of the 17th conference on Security symposium
RFID privacy: relation between two notions, minimal condition, and efficient construction
Proceedings of the 16th ACM conference on Computer and communications security
On a new formal proof model for RFID location privacy
Information Processing Letters
A family of dunces: trivial RFID identification and authentication protocols
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
RFID security: tradeoffs between security and efficiency
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
RFID systems: a survey on security threats and proposed solutions
PWC'06 Proceedings of the 11th IFIP TC6 international conference on Personal Wireless Communications
Minimalist cryptography for low-cost RFID tags (extended abstract)
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Authenticating pervasive devices with human protocols
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Parallel and concurrent security of the HB and HB+ protocols
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Reducing time complexity in RFID systems
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
RFID security and privacy: a research survey
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Privacy of RFID systems is receiving increasing attention in the RFID community. Basically, there are two kinds of RFID privacy notions in the literature: one based on the indistinguishability of two tags, denoted as ind-privacy, and the other based on the unpredictability of the output of an RFID protocol, denoted as unp-privacy. In this article, we first revisit the existing unpredictability-based RFID privacy models and point out their limitations. We then propose a new RFID privacy model, denoted as unp*-privacy, based on the indistinguishability of a real tag and a virtual tag. We formally clarify its relationship with the ind-privacy model. It is proven that ind-privacy is weaker than unp*-privacy. Moreover, the minimal (necessary and sufficient) condition on RFID tags to achieve unp*-privacy is determined. It is shown that if an RFID system is unp*-private, then the computational power of an RFID tag can be used to construct a pseudorandom function family provided that the RFID system is complete and sound. On the other hand, if each tag is able to compute a pseudorandom function, then the tags can be used to construct an RFID system with unp*-privacy. In this sense, a pseudorandom function family is the minimal requirement on an RFID tag's computational power for enforcing RFID system privacy. Finally, a new RFID mutual authentication protocol is proposed to satisfy the minimal requirement.