Paper 2009/092

Reducing RFID Reader Load with the Meet-in-the-Middle Strategy

Jung Hee Cheon, Jeongdae Hong, and Gene Tsudik

Abstract

In almost any RFID system, a reader needs to identify, and optionally authenticate, a multitude of tags. If each tag has a unique secret, identification and authentication are trivial, however, the reader (or a back-end server) needs to perform a brute-force search for each tag-reader interaction. In this paper, we suggest a simple, efficient and secure technique that reduces reader computation to $O(\sqrt N \cdot \log N)$. Our technique is based on the well-known ``meet-in-the-middle'' strategy used in the past to attack certain symmetric ciphers.

Metadata
Available format(s)
PDF
Category
Applications
Publication info
Published elsewhere. Unknown where it was published
Keywords
RFID IdentificationAuthenticationMeet-in-the-Middle StrategyPRF
Contact author(s)
jhcheon @ snu ac kr
History
2009-02-24: received
Short URL
https://ia.cr/2009/092
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2009/092,
      author = {Jung Hee Cheon and Jeongdae Hong and Gene Tsudik},
      title = {Reducing RFID Reader Load with the Meet-in-the-Middle Strategy},
      howpublished = {Cryptology ePrint Archive, Paper 2009/092},
      year = {2009},
      note = {\url{https://eprint.iacr.org/2009/092}},
      url = {https://eprint.iacr.org/2009/092}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.