Methods and Systems for Improving RFID Security

• US 20080094220A1
• Filed: 10/19/2007
• Published: 04/24/2008
• Est. Priority Date: 10/19/2006
• Status: Abandoned Application

• Current Assignee: Joseph Foley, Sanjay Sarma
• Original Assignee: Joseph Foley, Sanjay Sarma
• Inventors: Foley, Joseph, Sarma, Sanjay
• Application Number:
  US11/875,807
• Publication Number:
  US 20080094220A1
• Time in Patent Office: Days
• US Class Current: 340/572.4
• CPC Class Codes: G06Q 20/327 Short range or proximity payments by means of M-devices
• CPC Class Codes: G06Q 20/3278 RFID or NFC payments by means of M-devices
• CPC Class Codes: G06Q 20/341 Active cards, i.e. cards including their own processing means, e.g. including an IC or chip
• CPC Class Codes: G06Q 20/40975 using encryption therefor
• CPC Class Codes: G07C 9/22 in combination with an identity check of the pass holder
• CPC Class Codes: G07F 7/1008 Active credit-cards provided with means to personalise their use, e.g. with PIN-introduction/comparison system
• CPC Class Codes: G07G 1/009 the reader being an RFID reader

Abstract

The present invention provides various techniques to improve the security of data transmissions in RFID systems. Systems and methods for constructing more secure RFID tags, readers, and servers are disclosed enabling individuals to minimize privacy exposure while taking care to avoid needlessly overcomplicating the user'"'"'s RFID transactions.

Claims

1. An RFID tag capable of storing two identities in its memory, the tag comprising a memory containing a public identity designed to be transmitted to an unauthenticated reader for identifying the tag, and a separate private identity designed to be transmitted only to an authenticated reader.

2. The RFID tag of claim 1, wherein the RFID tag comprises three hashlocks in memory.

3. The RFID tag of claim 1, wherein the public identity comprises a first identifying code and the private identity comprises a second identifying code.

4. The RFID tag of claim 3, wherein the first and second identifying codes comprise different values.

5. The RFID tag of claim 1, wherein the public identity is changeable and the private identity is not changeable.

6. The RFID tag of claim 1, wherein the tag is attached to an object, and the public identity of the tag corresponds to that object.

7. The RFID tag of claim 1, wherein the public identity or private identity contains sufficient information for reader to uniquely identify the tag.

8. A method for using a RFID tag, RFID reader, and a server comprising the steps of:

providing an RFID tag having at least one hashlock in memory and at least two different identities;

using an authenticated reader to query the tag'"'"'s first identity;

receiving the tag'"'"'s first identity with the reader;

sending the first identity of the tag to the server;

looking up at least one hashlock associated with the first identity;

computing the value of the hashlock; and

transmitting the value of the hashlock to the reader.

9. The method of claim 8 comprising the step of transmitting the value of the hashlock to the tag.

10. The method of claim 9, comprising the step of receiving confirmation from the tag that it received the value of the hashlock and has performed a specified command.

11. The method of claim 9, comprising the step of sending additional information to the tag.

12. The method of claim 11, wherein the additional information is a new first identity for the tag to store in memory.

13. The method of claim 12, wherein the step of transmitting the value of the hashlock and the additional information to the tag causes the tag to change its first identity.

14. The method of claim 11, wherein the reader receives the additional information by capturing a first identity from a second RFID tag.

15. The method of claim 9, wherein after the step of transmitting the value of the hashlock to the tag, the tag backscatters a second identity different from the first identity.

16. The method of claim 11, wherein the steps of transmitting the value of the hashlock and sending the additional information to the tag cause the tag to change all of its hashlocks.

17. The method of claim 11, wherein the steps of transmitting the value of the hashlock and sending the additional information to the tag cause the tag to enter a silent mode.

18. The method of claim 11, wherein the steps of transmitting the value of the hashlock and sending the additional information to the tag causes the tag to kill itself.

19. The method of claim 8, wherein the server uses a secret and the first identity to compute the value of the hashlock.

20. The method of claim 8 comprising the steps of:

receiving a second identity with the reader;

sending the second identity to a controller separate from the reader and server;

generating a new first identity;

sending the new first identity to the reader;

transmitting the new identity to the tag; and

transmitting the value of the hashlock to the tag;

whereby the tag is caused to change its first identity.

21. The method of claim 20 comprising the step of receiving a confirmation from the tag indicating that the tag successfully changed its first identity.

22. The method of claim 8 comprising the steps of receiving a second identity with the reader;

sending the second identity to a controller separate from the reader and server;

generating a new hashlock to replace the at least one hashlock currently present in the tag'"'"'s memory;

sending the new hashlock to the reader;

transmitting the new hashlock to the tag; and

transmitting the value of the at least one hashlock to the tag to cause the tag to change the at least one hashlock stored in memory to the new hashlock.

23. The method of claim 22, wherein the step of generating a new hashlock creates three new hashlocks, the step of transmitting the new hashlock sends all three new hashlocks to the tag, and the step of transmitting the value of the at least one hashlock to the tag causes the tag to change all three hashlocks stored in memory to the new hashlocks received in the previous step.

24-137. -137. (canceled)