A Scalable and Provably Secure Hash-Based RFID Protocol

The biggest challenge for RFID technology is to provide benefits without threatening the privacy of consumers. Many solutions have been suggested but almost as many ways have been found to break them. An approach by Ohkubo, Suzuki and Kinoshita using an internal refreshment mechanism seems to protect privacy well but is not scalable. We introduce a specific time-memory trade-off that removes the scalability issue of this scheme. Additionally we prove that the system truly offers privacy and even forward privacy. Our third contribution is an extension of the scheme which offers a secure communication channel between RFID tags and their owner using building blocks that are already available on the tag. Finally we give a typical example of use of our system and show its feasibility by calculating all the parameters.


Published in:
The 2nd IEEE International Workshop on Pervasive Computing and Communication Security - PerSec 2005, 110-114
Presented at:
The 2nd IEEE International Workshop on Pervasive Computing and Communication Security - PerSec 2005, Kauai island, Hawaii, USA, March 8th, 2005
Year:
2005
Keywords:
Laboratories:




 Record created 2007-01-19, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)