RFID protocols with non-interacting variants

• US 9,158,948 B2
• Filed: 12/28/2012
• Issued: 10/13/2015
• Est. Priority Date: 01/20/2012
• Status: Active Grant

• Current Assignee: RUIZHANG TECHNOLOGY LIMITED COMPANY
• Original Assignee: RUIZHANG TECHNOLOGY LIMITED COMPANY
• Inventors: Smith, John Stephen
• Primary Examiner(s): BROWN, VERNAL U
• Application Number:
  US13/730,366
• Publication Number:
  US 20130187762A1
• Time in Patent Office: 1,019 Days
• Field of Search: 340/10.1, 340/572.1, 340/505, 340/5.6, 340/13.26
• US Class Current: 1/1
• CPC Class Codes: G06K 7/01 Details
• CPC Class Codes: G06K 7/10019 resolving collision on the communication channels between simultaneously or concurrently interrogated record carriers. collision between the communication channels used by wireless communication devices, where the solution is not particularly adapted for RFIDs or the like, H04W74/08
• CPC Class Codes: G06K 7/10257 arrangements for protecting the interrogation against piracy attacks computer security in general G06F21/00; jamming of communication, countermeasures H04K3/00; secret communication H04K1/00
• CPC Class Codes: H04B 5/77 for interrogation
• CPC Class Codes: H04W 12/04 Key management, e.g. using generic bootstrapping architecture [GBA]

Abstract

In an RFID system having at least one tag and at least one reader, a tag and a reader can, in one embodiment, use a pair of keys, known to both the tag and the reader, to restrict the interaction of the tag and the reader so that tags having the pair of keys interact only with readers that use the pair of keys.

Claims

1. A method for operating an RFID tag, the method comprising:

receiving, at a tag, a query command from a reader;

receiving, at the tag, a first key value from the reader;

comparing, in response to the query command, the first key value from the reader to a first key value stored in the tag;

transmitting a first value from the tag to the reader if the first key value from the reader matches the first key value stored in the tag;

receiving, at the tag, a second value and decrypting the second value, using a second key value stored in the tag to derive a challenge value;

comparing, at the tag, the challenge value to the first value; and

transmitting an identifier from the tag if the comparing indicates that the first value matches the challenge value.

2. The method as in claim 1 wherein the first value is a random number generated by the tag and wherein the first key value is received with the query command.

3. The method as in claim 2 wherein the second value is received with a handshake command and wherein the query command is received with a Q parameter which sets a probability for reply by the tag.

4. The method as in claim 3 wherein the tag stores, in a non-volatile memory in the tag, the first key value and the second key value.

5. The method as in claim 4 wherein the tag randomly decides whether to transmit the first value after verifying that the first key value from the reader matches the first key value stored in the tag.

6. The method as in claim 5 wherein the tag does not transmit the first value if the first key value from the reader does not match the first key value stored in the tag.

7. A machine readable non-transitory storage medium which contains executable instructions which when executed by a tag cause the tag to perform a method for operating an RFID tag, the method comprising:

receiving, at a tag, a query command from a reader;

receiving, at the tag, a first key value from the reader;

comparing, in response to the query command, the first key value from the reader to a first key value stored in the tag;

transmitting a first value from the tag to the reader if the first key value from the reader matches the first key value stored in the tag;

receiving, at the tag, a second value and decrypting the second value, using a second key value stored in the tag to derive a challenge value;

comparing, at the tag, the challenge value to the first value; and

transmitting an identifier from the tag if the comparing indicates that the first value matches the challenge value.

8. The machine readable non-transitory storage medium of claim 7, wherein the first value is a random number generated by the tag and wherein the first key value is received with the query command.

9. The machine readable non-transitory storage medium of claim 8, wherein the second value is received with a handshake command and wherein the query command is received with a Q parameter which sets a probability for reply by the tag.

10. The machine readable non-transitory storage medium of claim 9, wherein the tag stores, in a non-volatile memory in the tag, the first key value and the second key value.

11. The machine readable non-transitory storage medium of claim 10, wherein the tag randomly decides whether to transmit the first value after verifying that the first key value from the reader matches the first key value stored in the tag.

12. The machine readable non-transitory storage medium of claim 11, wherein the tag does not transmit the first value if the first key value from the reader does not match the first key value stored in the tag.

13. A tag, comprising

a memory;

a processor coupled to the memory, wherein the processor is configured to receive a query command from a reader, wherein the processor is configured to receive a first key value from the reader, wherein the processor is configured to compare, in response to the query command, the first key value from the reader to a first key value stored in the tag, wherein the processor is configured to transmit a first value from the tag to the reader if the first key value from the reader matches the first key value stored in the tag, wherein the processor is configured to receive a second value and to decrypt the second value, using a second key value stored in the tag to derive a challenge value, wherein the processor is configured to compare the challenge value to the first value; and

wherein the processor is configured to transmit an identifier from the tag if the comparing indicates that the first value matches the challenge value.

14. The tag of claim 13, wherein the first value is a random number generated by the tag and wherein the first key value is received with the query command.

15. The tag of claim 14, wherein the second value is received with a handshake command and wherein the query command is received with a Q parameter which sets a probability for reply by the tag.

16. The tag of claim 15, wherein the tag stores, in a non-volatile memory in the tag, the first key value and the second key value.

17. The tag of claim 16, wherein the tag randomly decides whether to transmit the first value after verifying that the first key value from the reader matches the first key value stored in the tag.

18. The tag of claim 17, wherein the tag does not transmit the first value if the first key value from the reader does not match the first key value stored in the tag.