Communications of the ACM
RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification
RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification
PERCOMW '04 Proceedings of the Second IEEE Annual Conference on Pervasive Computing and Communications Workshops
Privacy and security in library RFID: issues, practices, and architectures
Proceedings of the 11th ACM conference on Computer and communications security
A Scalable and Provably Secure Hash-Based RFID Protocol
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
Extending the EPC network: the potential of RFID in anti-counterfeiting
Proceedings of the 2005 ACM symposium on Applied computing
Disabling RFID tags with visible confirmation: clipped tags are silenced
Proceedings of the 2005 ACM workshop on Privacy in the electronic society
YA-TRAP: Yet Another Trivial RFID Authentication Protocol
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
HB^+^+: a Lightweight Authentication Protocol Secure against Some Attacks
SECPERU '06 Proceedings of the Second International Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing
Securing the Pharmaceutical Supply Chain using RFID
MUE '07 Proceedings of the 2007 International Conference on Multimedia and Ubiquitous Engineering
Tag-Splitting: Adaptive Collision Arbitration Protocols for RFID Tag Identification
IEEE Transactions on Parallel and Distributed Systems
RIPP-FS: An RFID Identification, Privacy Preserving Protocol with Forward Secrecy.
PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
Anti-collision protocol development for passive RFID tags
AIC'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Applied Informatics and Communications - Volume 7
Mutual authentication in RFID: security and privacy
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Provably Secure Grouping-Proofs for RFID Tags
CARDIS '08 Proceedings of the 8th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
Unidirectional key distribution across time and space with applications to RFID security
SS'08 Proceedings of the 17th conference on Security symposium
Critical RFID Privacy-Enhancing Technologies
Computing in Science and Engineering
A family of dunces: trivial RFID identification and authentication protocols
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
Authenticating pervasive devices with human protocols
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
RFID security and privacy: a research survey
IEEE Journal on Selected Areas in Communications
Information confinement, privacy, and security in RFID systems
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
We leverage RFID tag cooperation to enforce tampering detection. That is, we provide a set of probabilistic protocols that detect the absence of a tag from a system composed of a set of tags and a reader. Our proposals are able to detect which tag and for how long it has been taken away from the system. The grain of the detection can be tuned with respect to the resources available on the tags. Another merit of our solutions is to provide a proof-of-concept that a small level of cooperation among tags can further extend the range of applications RFID can support, possibly opening new veins of research. The proposed protocols fit the resource constraints of the several classes of RFID available on the market. In particular, the memory requirement ranges fromfew memory slots to a number of memory slots that is proportional to the number of rounds the presence of a tag is going to be checked. Computation is just one hash per round. This fully fledged set of protocols is thought to trade off the detection grain with the resources on the tag: the finer the item removal detection grain, the more resources a protocol requires. A thorough analysis for the removal detection probability is provided. Finally, extensive simulations support the analytical results, showing the viability of the proposed solutions.