How to construct random functions
Journal of the ACM (JACM)
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Handbook of Applied Cryptography
Handbook of Applied Cryptography
The Design of Rijndael
RFID Systems and Security and Privacy Implications
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
A Concrete Security Treatment of Symmetric Encryption
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
PERCOMW '04 Proceedings of the Second IEEE Annual Conference on Pervasive Computing and Communications Workshops
A Scalable and Provably Secure Hash-Based RFID Protocol
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
YA-TRAP: Yet Another Trivial RFID Authentication Protocol
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
A Lightweight RFID Protocol to protect against Traceability and Cloning attacks
SECURECOMM '05 Proceedings of the First International Conference on Security and Privacy for Emerging Areas in Communications Networks
Universally composable and forward-secure RFID authentication and authenticated key exchange
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Robust, anonymous RFID authentication with constant key-lookup
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Minimalist cryptography for low-cost RFID tags (extended abstract)
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
A scalable, delegatable pseudonym protocol enabling ownership transfer of RFID tags
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
Mobeyes: smart mobs for urban monitoring with a vehicular sensor network
IEEE Wireless Communications
Towards lightweight secure communication protocols for passive RFIDs
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Time measurement threatens privacy-friendly RFID authentication protocols
RFIDSec'10 Proceedings of the 6th international conference on Radio frequency identification: security and privacy issues
Towards a practical solution to the RFID desynchronization problem
RFIDSec'10 Proceedings of the 6th international conference on Radio frequency identification: security and privacy issues
Scalable RFID security protocols supporting tag ownership transfer
Computer Communications
Securing low-cost RFID systems: An unconditionally secure approach
Journal of Computer Security - 2010 Workshop on RFID Security (RFIDSec'10 Asia)
Minimalist security and privacy schemes based on enhanced AES for integrated WISP sensor networks
International Journal of Communication Networks and Distributed Systems
Unbalanced states violates RFID privacy
Journal of Intelligent Manufacturing
Hi-index | 0.00 |
In the absence of sufficiently optimised public key constructions, anonymous authentication for Radio-Frequency Identification Devices (RFIDs) requires state synchronisation between tags and a trusted server. Active adversaries disrupt this synchrony, making a recovery strategy necessary. In some protocols, tags recover by replaying previously used values, thus compromising unlinkability of their transcripts; other schemes require servers to search through the set of issued keys, incurring costs that are not constant with the number of legitimate tags. This article describes an approach based on a lightweight trapdoor one-way function from modular squaring. The solution exploits the fact that synchrony can be recovered even if tags are endowed with only the ability to perform public-key operations, whilst the trusted server is capable of trapdoor computations. The construction is provably secure and generic, transforming any anonymous, challenge-response RFID authentication protocol into another that is robust against active adversaries and supports constant key-lookup cost.