CryptoDB
Provably Secure Grouping-proofs for RFID tags
| Authors: | |
|---|---|
| Download: | |
| Abstract: | We investigate an application of RFIDs referred to in the literature as the group scanning problem, in which several tags are ``simultaneously'' scanned by a reader. The security context of this application was first discussed by Ari Juels, who presented a protocol that allows pairs of RFID tags to provide evidence of having been simultaneous scanned---a yoking proof. Our goal is to study group scanning proofs in strong adversarial models. We describe a security model for RFID group scanning proofs, and consider versions of the problem that require privacy (anonymity) of the grouped tags, and/ or forward-security properties. Our security model is based on the Universal Composability framework and supports reusability (through modularity of security guarantees). We also 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. |
BibTeX
@misc{eprint-2007-13687,
title={Provably Secure Grouping-proofs for RFID tags},
booktitle={IACR Eprint archive},
keywords={cryptographic protocols / RFID, yoking proofs, provably secure protocols, privacy, forward secrecy},
url={http://eprint.iacr.org/2007/407},
note={ burmester@cs.fsu.edu 13810 received 24 Oct 2007},
author={Mike Burmester and Breno de Medeiros and Rossana Motta},
year=2007
}