Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
RFID Systems and Security and Privacy Implications
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
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
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2
Untraceable RFID tags via insubvertible encryption
Proceedings of the 12th ACM conference on Computer and communications security
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 Secure and Efficient RFID Protocol that could make Big Brother (partially) Obsolete
PERCOM '06 Proceedings of the Fourth Annual IEEE International Conference on Pervasive Computing and Communications
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
Security analysis of a cryptographically-enabled RFID device
SSYM'05 Proceedings of the 14th conference on USENIX Security Symposium - Volume 14
Severless Search and Authentication Protocols for RFID
PERCOM '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications
On Existence Proofs for Multiple RFID Tags
PERSER '06 Proceedings of the 2006 ACS/IEEE International Conference on Pervasive Services
A scalable, delegatable pseudonym protocol enabling ownership transfer of RFID tags
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
Secure and private search protocols for RFID systems
Information Systems Frontiers
A survey on RFID security and provably secure grouping-proof protocols
International Journal of Internet Technology and Secured Transactions
Protecting and restraining the third party in RFID-enabled 3PL supply chains
ICISS'10 Proceedings of the 6th international conference on Information systems security
Lightweight RFID authentication with forward and backward security
ACM Transactions on Information and System Security (TISSEC)
Flaws on RFID grouping-proofs. Guidelines for future sound protocols
Journal of Network and Computer Applications
"Who counterfeited my Viagra?" probabilistic item removal detection via RFID tag cooperation
EURASIP Journal on Wireless Communications and Networking - Special issue on security and resilience for smart devices and applications
Extending ECC-based RFID authentication protocols to privacy-preserving multi-party grouping proofs
Personal and Ubiquitous Computing
An RFID Based Multi-batch Supply Chain Systems
Wireless Personal Communications: An International Journal
A Secure Lightweight RFID Binding Proof Protocol for Medication Errors and Patient Safety
Journal of Medical Systems
Using RFID Yoking Proof Protocol to Enhance Inpatient Medication Safety
Journal of Medical Systems
PSP: Private and secure payment with RFID
Computer Communications
Private yoking proofs: attacks, models and new provable constructions
RFIDSec'12 Proceedings of the 8th international conference on Radio Frequency Identification: security and privacy issues
| Hi-index | 0.00 |
We investigate an application of RFIDs referred to in the literature as group scanning, in which several tags are "simultaneously" scanned by a reader device. Our goal is to study the group scanning problem in strong adversarial models. We present a security model for this application and give a formal description of the attending security requirements, focusing on the privacy (anonymity) of the grouped tags, and/ or forward-security properties. Our model is based on the Universal Composability framework and supports re-usability (through modularity of security guarantees). We introduce novel protocols that realize the security models, focusing on efficient solutions based on off-the-shelf components, such as highly optimized pseudo-random function designs that require fewer than 2000 Gate-Equivalents.