Paper 2006/015 Original: eprint.iacr.org/2006/015 ↗
A Family of Dunces: Trivial RFID Identification and Authentication Protocols
Abstract
Security and privacy in RFID systems is an important and active research area. A number of challenges arise due to the extremely limited computational, storage and communication abilities of a typical RFID tag. This paper describes a step-by-step construction of a family of simple protocols for inexpensive untraceable identification and authentication of RFID tags. This work is aimed primarily at RFID tags that are capable of performing a small number of inexpensive conventional (as opposed to public key) cryptographic operations. It also represents the first result geared for so-called {\em batch mode} of RFID scanning whereby the identification (and/or authentication) of tags is delayed. Proposed protocols involve minimal interaction between a tag and a reader and place very low computational burden on the tag. Notably, they also impose low computational load on back-end servers.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2007-09-28: last updated
- 2006-01-17: published
- Short URL
- https://ia.cr/2006/015
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2006/015,
author = {Gene Tsudik},
title = {A Family of Dunces: Trivial RFID Identification and Authentication Protocols},
howpublished = {Cryptology {ePrint} Archive, Paper 2006/015},
year = {2006},
url = {https://eprint.iacr.org/2006/015}
}