CryptoDB
Reducing RFID Reader Load with the Meet-in-the-Middle Strategy
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2009-18232, title={Reducing RFID Reader Load with the Meet-in-the-Middle Strategy}, booktitle={IACR Eprint archive}, keywords={applications/RFID Identification, Authentication, Meet-in-the-Middle Strategy, PRF}, url={http://eprint.iacr.org/2009/092}, note={ jhcheon@snu.ac.kr 14296 received 21 Feb 2009, last revised 21 Feb 2009}, author={Jung Hee Cheon and Jeongdae Hong and Gene Tsudik}, year=2009 }