Paper 2009/380 Original: eprint.iacr.org/2009/380 ↗
Untraceable Tags based on Mild Assumptions
Abstract
Radio frequency identification (RFID) chips have been widely deployed in large-scale systems such as inventory control and supply chain management. While RFID technology has much advantage, however it may create new problems to privacy. Tag untraceability is a significant concern that needs to be addressed in deploying RFID-based system. In this paper we propose a new construction for untraceable tags. Our construction is the first construction in the symmetric bilinear setting based on a mild assumption. That is our assumption is tautological in the generic group model and is ``efficiently falsifiable'' in the sense that its problem instances are stated non-interactively and concisely (i.e., independently of the number of adversarial queries and other large quantities).
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2009-08-03: last updated
- 2009-08-03: published
- Short URL
- https://ia.cr/2009/380
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2009/380,
author = {Carlo Blundo and Angelo De Caro and Giuseppe Persiano},
title = {Untraceable Tags based on Mild Assumptions},
howpublished = {Cryptology {ePrint} Archive, Paper 2009/380},
year = {2009},
url = {https://eprint.iacr.org/2009/380}
}