1 / 13

LEXP: Preserving User Privacy and Certifying the Location Information

LEXP: Preserving User Privacy and Certifying the Location Information. Author ： Ken Nakanishi, Jin Nakazawa, and Hideyuki Tokuda Presented by Yi Cheng Lin. Outline. Introduction Architecture Detector Registration Address Notification Address Resolution

justus
Download Presentation

LEXP: Preserving User Privacy and Certifying the Location Information

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. LEXP: Preserving User Privacy and Certifying the Location Information Author：Ken Nakanishi, Jin Nakazawa, and Hideyuki Tokuda Presented by Yi Cheng Lin

  2. Outline • Introduction • Architecture • Detector Registration • Address Notification • Address Resolution • Ticket Publication and Verification • Security Analysis • Conclusion

  3. Introduction • Many kind of location sensing technologies already exist, and more are under development • Location information Exchange Protocol (LEXP) was designed for preserving user privacy and certifying users location information

  4. Architecture

  5. Parameter • Each client, detector, service provider, and ticket have its own unique identifier CID, DID, SID TID • h(x),h2(x) denote the MD5 hash value of x • {x} key denote the encrypted data of x by key

  6. Detector Registration password header{h(DID) h(password) h(detector_publickey) secretkey} resolver_publickey header{h(detector_publickey)} resolver_privatekey Register the secret key information

  7. Address Notification update

  8. Address Resolution rb header{h(DID) h(RFID) rb} secretkey header{ra address rb} secretkey

  9. Ticket Publication(1/2) 1. Generate a pair of Diffie-Hellman key 2. D-public key 3. C-public key D-private key C-private key 4. {h(RFID) ra} sessionkey DES session key DES session key Check h(RFID)

  10. Ticket Publication(2/2) {DID TID R ticket} sessionkey random number R ticket = {TID timestamp} detector-privatekey

  11. Ticket Verification {validity r} detector_privatekey Check h N-n(hn(R)) = hN(R)

  12. Security Analysis • Address Notification • CID is secret • Address Resolution • No attacker can get secret key (in a secret channel) • Ticket Publication • Only detector and client have ra • Ticket Verification • hn(R) is one-time password • The password required next time is hn-1(R), which no one can generate unless he knows R

  13. Conclusion • LEXP guarantees users to keep anonymity, guarantees applications that a user cannot forge his location information • Applying the modules of ‘chain of confidence’ and one-time password

More Related