Research Article
Generalized "Yoking-Proofs" for a Group of RFID Tags
@INPROCEEDINGS{10.1109/MOBIQ.2006.340395, author={Leonid Bolotnyy and Gabriel Robins}, title={Generalized "Yoking-Proofs" for a Group of RFID Tags}, proceedings={3rd Annual International ICST Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services}, publisher={IEEE}, proceedings_a={MOBIQUITOUS}, year={2007}, month={4}, keywords={}, doi={10.1109/MOBIQ.2006.340395} }- Leonid Bolotnyy
Gabriel Robins
Year: 2007
Generalized "Yoking-Proofs" for a Group of RFID Tags
MOBIQUITOUS
IEEE
DOI: 10.1109/MOBIQ.2006.340395
Abstract
Recently Ari Juels suggested a "yoking-proof" where a pair of radio-frequency identification (RFID) tags are both read within a specified time bound, and left open for future research the problem of generating a proof for larger groups of tags. We generalize his protocol by developing a proof which ensures that a group of tags is read within a certain time period. The tags generate such a proof even if the reader is untrusted. The proof is improbable to forge, and is verifiable off-line by a trusted verifier. Juels's problem formulation does not take privacy into account and the resulting protocol offers no privacy to the tags. We modify the problem statement to require the "yoking-proof" to maintain privacy, and we give a protocol for this new anonymous yoking problem, along with suggestions for speed ups
