1 / 8

Author ： Dirk Henrici and Paul Muller Presented by Li-yuan Lai March 20, 2007

Hash-based Enhancement of Location Privacy for Radio-Frequency Identification Devices using Varying Identifiers. Author ： Dirk Henrici and Paul Muller Presented by Li-yuan Lai March 20, 2007. Outline. Introduction Scheme Normal Operation Example Conclusion. Introduction.

halima
Download Presentation

Author ： Dirk Henrici and Paul Muller Presented by Li-yuan Lai March 20, 2007

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Hash-based Enhancement of Location Privacy for Radio-Frequency Identification Devices using Varying Identifiers Author：Dirk Henrici and Paul Muller Presented by Li-yuan Lai March 20, 2007

  2. Outline • Introduction • Scheme • Normal Operation • Example • Conclusion

  3. Introduction • RFID may emerge as one of the most pervasive computing technologies in history. • But products equipped with RFID tags enable tracking of persons by the tags they carry. • This paper introduces a simple scheme relying on one-way hash functions that greatly enhances location privacy.

  4. Scheme • define y = h(x) as a cryptographic one-way hash function

  5. - Database-identifier (“DB-ID”) read only, optionally writable - Current ID (“ID”) read/write - Transaction number (“TID”) read/write - Last successful transaction number (“LST”) read/write - Additional fields for user data or a master key are conceivable but not required at all - Hash of current ID (“HID”), acting as primary index of the table - Current ID (“ID”) - Last transaction number (“TID”) - Last successful transaction number (“LST”) - Associated DB entry (“AE”) - A reference to tag data / user data (“DATA”)

  6. Normal Operation • tag：h(ID) • When queried, TID+1 • send： h(ID), DB-ID, h(TID。ID), △TID（ △TID =TID - LST） • database： TID‘＝△TID + LST, calculate h(TID’。ID) • update：create RND, generating ID’ （ ID‘= RND。ID ） • respond： RND, h(RND。TID’。ID) • receiver：check hash, changing ID、TID

  7. tagdb Suppose ID = 14 , DB-ID = tagdb, TID = LST = 3 initial： send：H(14), tagdb, h(10), 1 ( h(10) = h(4。14) ) Suppose RND = 13, then ID’ = h(13。14) = h(3) respond： 13, h(7) ( h(7) = h(13。4。14) ) final：

  8. Conclusion • The main benefit of the proposed scheme is its simplicity: It only requires a hash function in the tag and data management at the back-end. • it is enhancing location privacy greatly without restraining other applications.

More Related