Lightweight Distance bound Protocol for Low Cost RFID Tags

Computer Science – Cryptography and Security

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Results in paper questionable. Article withdrawn by authors.

Scientific paper

Almost all existing RFID authentication schemes (tag/reader) are vulnerable to relay attacks, because of their inability to estimate the distance to the tag. These attacks are very serious since it can be mounted without the notice of neither the reader nor the tag and cannot be prevented by cryptographic protocols that operate at the application layer. Distance bounding protocols represent a promising way to thwart relay attacks, by measuring the round trip time of short authenticated messages. All the existing distance bounding protocols use random number generator and hash functions at the tag side which make them inapplicable at low cost RFID tags. This paper proposes a lightweight distance bound protocol for low cost RFID tags. The proposed protocol based on modified version of Gossamer mutual authentication protocol. The implementation of the proposed protocol meets the limited abilities of low-cost RFID tags.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Lightweight Distance bound Protocol for Low Cost RFID Tags does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lightweight Distance bound Protocol for Low Cost RFID Tags, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lightweight Distance bound Protocol for Low Cost RFID Tags will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-713048

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.