Provably secure grouping-proofs for RFID tags
(2008) Smart Card Research and Advanced Applications. 8th IFIP WG 8.8/11.2 International Conference, CARDIS 2008 — Location: London, UK (8.September.2008)
Files
pdfdocument.pdf
Restricted Access - Adobe PDF
- 275.24 KB
Details
- Authors
- Abstract
- 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.
- Affiliations
Citations
Burmester, M., de Medeiros, B., & Motta, R. (2008). Provably secure grouping-proofs for RFID tags. In Grimaud, G.; Standaert, F.-X.; (ed.), Smart Card Research and Advanced Applications. 8th IFIP WG 8.8/11.2 International Conference, CARDIS 2008 (p. p. 176-190). Springer-verlag. https://doi.org/10.1007/978-3-540-85893-5_13