CN103177273B - Based on the mobile wireless radio frequency identification authentication method of low cost label - Google Patents

Abstract

The invention discloses a mobile radio frequency identification authentication method based on a low-cost label, which is used to solve the technical problem of low efficiency of the existing mobile radio frequency identification authentication method. The technical solution is to divide mobile radio frequency identification authentication into three stages: registration, normal authentication and fast authentication, reduce the number of information interactions, simplify the interaction process between the server, mobile reader and tag, and realize the mobile reader and tag. And the mobile reader and the background server authenticate each other in pairs. It satisfies the requirement of fast completion when the same label needs to be read multiple times in actual needs, not only improves the authentication efficiency, but also ensures the security of the system.

Description

Mobile radio frequency identification authentication method based on low-cost tags

technical field

The invention relates to a mobile radio frequency identification authentication method, in particular to a low-cost label-based mobile radio frequency identification authentication method.

Background technique

In the mobile radio frequency identification (radio frequency identification, hereinafter referred to as RFID) system, the tags and mobile readers, the mobile reader and the server are connected wirelessly, the reader is no longer a trusted entity, and the reading and writing range of the mobile reader is not Restricted, the mobile reader can collect tag information indefinitely, which is more likely to expose the privacy of the mobile reader owner. This makes the mobile RFID system face a more complex wireless communication environment than the traditional RFID system, and is more vulnerable to security threats such as eavesdropping, counterfeiting, and replay. Therefore, it is necessary to design a new security authentication method suitable for mobile RFID systems to meet the new security and privacy requirements of the system.

In the literature "C L Chen, J K Jan, and C F Chien. Based on mobile RFID device to design secure mutual authentication scheme for market application. 2010 International Conference on Broadband, Wireless Computing, Communication and Applications (BWCCA2010), LosAlamitos (USA): IEEE, 2010 : 423-428", the author designed a lightweight RFID authentication protocol to realize the reading and identification of tags by mobile readers. This solution conforms to the EPC Class-1Generation-2 standard, that is, the main operations on the label side are simple operations such as cyclic redundancy check code (CRC) and exclusive OR (XOR) operation, and meets the standard of RFID authentication protocol for low-cost labels . This solution has certain advantages in the calculation performance of the tag side, but the number of information exchanges in this solution is too many (the mobile reader needs to interact with the tag and the server 4 times), and the information exchange efficiency is not very high. At the same time, this scheme also has security problems. When the tag responds to the mobile reader, the change of one of the values T ₁ (Y ₂ =R ₂ +EPC _i ) only depends on the random number R ₂ generated by the server, so if we re Putting the same message sent by the mobile reader, T ₁ in the response value of the same tag will remain unchanged, so the attacker can use this to carry out tracking attacks on the tag.

Contents of the invention

In order to overcome the low efficiency of the existing mobile radio frequency identification authentication method, the present invention provides a mobile radio frequency identification authentication method based on a low-cost tag. The method divides mobile radio frequency identification authentication into three stages of registration, normal authentication and fast authentication, reduces the number of information interactions, simplifies the interaction process among the server, mobile reader and tag, and realizes mobile reader and tag, and The mutual authentication between the mobile reader and the background server can meet the requirement of fast completion when the same tag needs to be read multiple times in actual needs, improve the authentication efficiency, and ensure the security of the system at the same time.

The technical solution adopted by the present invention to solve the technical problem is: a mobile radio frequency identification authentication method based on low-cost tags, which is characterized in that it includes the following steps:

Step 1. In the registration stage before the operation of the authentication protocol, the execution system is initialized;

(1) Store information (Rid _j , K _i , Sy _j , Pk, △T _j where △T _j =1) to the mobile reader.

(2) Store the information (K _i , Tid _i ) in the tag.

(3) Store information (Rid _j , K _i , Sy _j , △T _j , Tid _i , T _info , Sk where △T _j =0) to the server.

Step 2, normal authentication stage;

(1) The mobile reader issues a query authentication request. The mobile reader generates a random number Nr _j , and then calculates and M ₂ =h(Nr _j ). The mobile reader sends m ₁ and M ₂ to the tag.

(2) The tag uses its own stored shared key K _i to calculate and judge Whether it is established. if If established, it proves that the mobile reader is legal, otherwise the tag does not respond. After the tag verifies that the mobile reader is legal, it generates a random number Nt _i . Then calculate: $m_3={\mathrm{Nt}}_i\⊕K_i,$ $m_4=h({\mathrm{Nt}}_i\⊕{\mathrm{Nr}}_j),$ $m_5=h({\mathrm{Tid}}_i\⊕{\mathrm{Nt}}_i).$ The tag sends the information (M ₃ , M ₄ , M ₅ ) to the mobile reader.

(3) After receiving the message, the mobile reader uses the shared key K _i to calculate Nt _i , and then verifies Whether it is established. if Established, it proves that the label is legal, and proceeds to the next step. if If it is not established, it proves that the label is illegal and the certification is abandoned. After proving that the tag is legal, the mobile reader first looks up whether Tid _i exists in itself, and verifies Whether it is established. if If it is established, the authentication is successful; otherwise, the counter of the mobile reader increases by 1, that is, △T _j =△T _j +1. Then the mobile reader uses the server public key Pk to encrypt the information (Rid _j , △T _j , Nr _j , M ₅ , Nt _i ), and obtain M ₆ =E _Pk (Rid _j ||△T _j ||Nr _j ||M ₅ ||Nt _i ). The mobile reader sends the information M ₆ to the server.

(4) After receiving the message M ₆ , the server decrypts it with its own private key Sk, that is, calculates D _Sk (M ₆ ), and obtains information (Rid _j , △T _j , Nr _j , M ₅ , Nt _i ). Firstly, the server checks whether there is a mobile reader whose identity number is equal to Rid _j , and if it exists, it proves that the mobile reader is legal, and continues the authentication process. If there is no proof that the mobile reader is illegal, the certification will be abandoned. If the mobile reader is legal, compare the △T _j corresponding to the mobile reader Rid _j stored in the server with the △T _j ' obtained by decrypting the private key. If the △T _j ′ obtained by decrypting the private key is not greater than the △T _j stored in the server, it means that the message is a replay message and the authentication is abandoned. Otherwise, look up the tag information in the server, calculate and judge is established, if Establishment indicates that the tag is legal, and the △T _j updated and stored by the server is the △T _j ′ decrypted by the private key, and the symmetric key Sy _j of the mobile reader is used to encrypt the information (Tid _i , T _info , Nr _j ), and M ₇ = E _Syj (Tid _i ||T _info ||Nr _j ). The server sends the information N ₇ to the mobile reader.

Step 3, fast authentication stage;

(1) The mobile reader issues a query authentication request. The mobile reader generates a random number Nr _j , and then calculates and M ₂ =h(Nr _j ). _The mobile reader sends M1 and _M2 to the tag.

(2) The tag uses its own stored shared key K _i to calculate and judge Whether it is established. if If established, it proves that the mobile reader is legal, otherwise the tag does not respond. If the tag verifies that the mobile reader is legal, a random number Nt _i is generated. Then calculate: $m_3={\mathrm{Nt}}_i\⊕K_i,$ $m_4=h({\mathrm{Nt}}_i\⊕{\mathrm{Nr}}_j),$ $m_5=h({\mathrm{Tid}}_i\⊕{\mathrm{Nt}}_i).$ The tag sends the information (M ₃ , M ₄ , M ₅ ) to the mobile reader.

(3) After receiving the message, the mobile reader uses the shared key K _i to calculate Nt _i , and then verifies is established, if Founded to prove the label is legal. The mobile reader first looks up whether Tid _i exists in itself, and verifies Whether it is established. if Established, the authentication is successful.

The beneficial effects of the present invention are: because the method divides mobile radio frequency identification authentication into three stages of registration, normal authentication and fast authentication, reduces the number of information interactions, and simplifies the interaction process among the server, mobile reader and tag, Realize mutual authentication between the mobile reader and the tag, and between the mobile reader and the background server, which meets the requirement of fast completion when the same tag needs to be read multiple times in actual needs, not only improves the authentication efficiency, but also ensures the system security.

The present invention will be described in detail below in conjunction with the accompanying drawings and embodiments.

Description of drawings

Fig. 1 is a flow chart of the low-cost tag-based mobile radio frequency identification authentication method of the present invention.

Fig. 2 is a flow chart of the registration stage of the low-cost tag-based mobile radio frequency identification authentication method of the present invention.

Fig. 3 is a flow chart of the normal authentication stage of the low-cost tag-based mobile radio frequency identification authentication method of the present invention.

Fig. 4 is a flow chart of the rapid authentication stage of the low-cost tag-based mobile radio frequency identification authentication method of the present invention.

Detailed ways

Refer to Figures 1-4. This example is for an actual mobile RFID system. The specific process of the method of the present invention will be described in detail below. The specific process is divided into three stages: registration stage, normal authentication stage and fast authentication stage. Follow the steps below to implement:

Symbolic descriptions of variables and operations in the examples.

(1) Registration stage.

The tag T and the mobile reader R must be registered on the server S first, and the mobile reader R can authenticate the tag T only after the registration is successful. The method of the invention can enable the mobile reader to only identify specific labels through the authorization of the server. For example, in the method of the present invention, if the shared key of the labels of the A-type products is all X, and the shared key of the labels of the B-type products is Y. In this way, if the server sets the shared key of mobile reader R and tag T to X during registration, the mobile reader can only identify Type A products, but not Type B products. In this way, the control of mobile reader permissions is realized. Of course, it is also possible to make the shared keys K _i of all tags the same. Thus legal mobile readers can identify and authenticate all products.

Before the operation of the authentication protocol, the execution system of the registration phase (such as the manufacturer, the application system, etc.) initializes the mobile reader, the tag and the server through a secure channel, which are divided into three steps.

Step 1: Store information (Rid _j , Ki , Sy _j , Pk, ΔT _j where ΔT _{j =} 1) to the mobile reader.

Step 2: Store the information (K _i , Tid _i ) in the tag.

Step 3: Store information (Rid _j , K _i , Sy _j , ΔT _j , Tid _i , T _info , Sk where ΔT _j =0) to the server.

(2) Normal authentication stage.

The normal authentication phase is divided into four steps.

Step 1: The mobile reader sends a query authentication request. The mobile reader generates a random number Nr _j , and then calculates and M ₂ =h(Nr _j ). The mobile reader sends m ₁ and M ₂ to the tag.

Step 2: The tag uses its stored shared key K _i to calculate and judge Whether it is established. if If established, it proves that the mobile reader is legal, otherwise the tag does not respond. After the tag verifies that the mobile reader is legal, it generates a random number Nt _i . Then calculate: $m_3={\mathrm{Nt}}_i\⊕K_i,$ $m_4=h({\mathrm{Nt}}_i\⊕{\mathrm{Nr}}_j),$ $m_5=h({\mathrm{Tid}}_i\⊕{\mathrm{Nt}}_i).$ The tag sends the information (M ₃ , M ₄ , M ₅ ) to the mobile reader.

Step 3: After receiving the message, the mobile reader uses the shared key K _i to calculate Nt _i , and then verifies Whether it is established. if Established, it proves that the label is legal, and proceeds to the next step. if If it is not established, it proves that the label is illegal and the certification is abandoned. After proving that the tag is legal, the mobile reader first looks up whether Tid _i exists in itself, and verifies Whether it is established. if If it is established, the authentication is successful; otherwise, the counter of the mobile reader increases by 1, that is, △T _j =△T _j +1. Then the mobile reader uses the server public key Pk to encrypt the information (Rid _j , △T _j , Nr _j , M ₅ , Nt _i ), and obtain M ₆ =E _Pk (Rid _j ||△T _j ||Nr _j ||M ₅ ||Nt _i ). The mobile reader sends the information M ₆ to the server.

Step 4: After receiving the message M ₆ , the server decrypts it with its own private key Sk, that is, calculates D _Sk (M ₆ ), and obtains information (Rid _j , △T _j , Nr _j , M ₅ , Nt _i ). Firstly, the server checks whether there is a mobile reader whose identity number is equal to Rid _j , and if it exists, it proves that the mobile reader is legal, and continues the authentication process. If there is no proof that the mobile reader is illegal, the certification will be abandoned. If the mobile reader is legal, compare the △T _j corresponding to the mobile reader Rid _j stored in the server with the △T _j ' obtained by decrypting the private key. If the △T _j ′ obtained by decrypting the private key is not greater than the △T _j stored in the server, it means that the message is a replay message and the authentication is abandoned. Otherwise, look up the tag information in the server, calculate and judge is established, if Establishment indicates that the tag is legal, and the △T _j updated and stored by the server is the △T _j ′ decrypted by the private key, and the symmetric key Sy _j of the mobile reader is used to encrypt the information (Tid _i , T _info , Nr _j ), and M ₇ = E _Syj (Tid _i ||T _info ||Nr _j ). _The server sends the information M7 to the mobile reader.

(3) Rapid authentication stage.

The rapid certification stage is divided into three steps.

Step 1: The mobile reader sends a query authentication request. The mobile reader generates a random number Nr _j , and then calculates and M ₂ =h(Nr _j ). _The mobile reader sends M1 and _M2 to the tag.

Step 2: The tag uses its stored shared key K _i to calculate and judge Whether it is established. if If established, it proves that the mobile reader is legal, otherwise the tag does not respond. If the tag verifies that the mobile reader is legal, a random number Nt _i is generated. Then calculate: $m_3={\mathrm{Nt}}_i\⊕K_i,$ $m_4=h({\mathrm{Nt}}_i\⊕{\mathrm{Nr}}_j),$ $m_5=h({\mathrm{Tid}}_i\⊕{\mathrm{Nt}}_i).$ The tag sends the information (M ₃ , M ₄ , M ₅ ) to the mobile reader.

Step 3: After receiving the message, the mobile reader uses the shared key K _i to calculate Nt _i , and then verifies is established, if Founded to prove the label is legal. The mobile reader first looks up whether Tid _i exists in itself, and verifies Whether it is established. if Established, the authentication is successful, and the mobile reader no longer needs to interact with the server, thereby realizing fast authentication and reducing waiting time.

Claims (1)

1. A mobile radio frequency identification authentication method based on low-cost tags, characterized in that comprising the following steps: Step 1. In the registration stage before the operation of the authentication protocol, the execution system is initialized; (1) Store information Rid _j ,K _i ,Sy _j ,Pk,△T _j to the mobile reader, where △T _j =1; (2) store information K _i , Tid _i to the tag; (3) Store information Rid _j ,K _i ,Sy _j ,△T _j ,Tid _i ,T _info ,Sk to the server, where △T _j =0; Among them, Rid _j is the identity number of the jth mobile reader, Ki is the shared key between the mobile reader and the ith tag, Sy _j is the symmetric encryption key between the _jth mobile reader and the server key, Pk is the public key of the server, △T _j is the counter of the j-th mobile reader, Tid _i is the identity number of the i-th tag, T _info is the detailed information of the product represented by the tag, and Sk is the private key of the server ; Step 2, normal authentication stage; (1) The mobile reader sends a query authentication request; the mobile reader generates a random number Nr _j , and then calculates M ₁ =Nr _j ⊕K _i and M ₂ =h(Nr _j ); the mobile reader sends M ₁ and M ₂ give the label; (2) The tag uses its own stored shared key K _i to calculate and judge is established; if If it is established, it proves that the mobile reader is legal, otherwise the tag does not respond; after the tag verifies that the mobile reader is legal, it generates a random number Nt _i ; and then calculates: M ₃ =Nt _i ⊕K _i , M ₄ =h(Nt _i ⊕Nr _j ) , M ₅ ＝h(Tid _i ⊕Nt _i ); the tag sends information M ₃ , M ₄ , M ₅ to the mobile reader; (3) After receiving the message, the mobile reader uses the shared key K _i to calculate Nt _i , and then verifies is established; if Established, it proves that the label is legal, and proceeds to the next step; if If it is not established, it proves that the tag is illegal, and the certification is abandoned; after the tag is proved to be legal, the mobile reader first checks whether there is Tid _i in itself, and verifies is established; if If it is established, the authentication is successful, otherwise, the counter of the mobile reader increases by 1, that is, △T _j = △T _j + 1; then the mobile reader uses the server public key Pk to encrypt the information Rid _j , △T _j , Nr _j , M ₅ , Nt _i , get M ₆ =E _Pk (Rid _j ||△T _j ||Nr _j ||M ₅ ||Nt _i ); the mobile reader sends the information M ₆ to the server; (4) After receiving the message M ₆ , the server decrypts it with its own private key Sk, that is, calculates D _Sk (M ₆ ), and obtains information Rid _j , △T _j , Nr _j , M ₅ , Nt _i ; firstly, the server searches Whether there is a mobile reader whose identity number is equal to Rid _j , if it exists, it proves that the mobile reader is legal, continue the authentication process; if it does not exist, it proves that the mobile reader is illegal, give up the authentication; if the mobile reader is legal, move Compare the △T _j corresponding to the reader Rid _j with the △T _j ′ obtained by decrypting the private key; if the △T _j ′ obtained by decrypting the private key is not greater than the △T _j stored in the server, it means that the message is a replay message and discard Authentication; otherwise, look up the tag information in the server, calculate and judge is established, if Establishment indicates that the tag is legal, and the △T _j updated and stored by the server is the △T _j ′ decrypted by the private key. Use the symmetric key Sy _j of the mobile reader to encrypt the information Tid _i , T _info , Nr _j , and get M ₇ =E _Syj (Tid _i ||T _info ||Nr _j ); the server sends the information M ₇ to the mobile reader; Among them, Nr _j is the random number generated by the jth mobile reader, Nt _i is the random number generated by the i-th tag, h(.) is a one-way hash function, E _Pk (c) is the public key of the server To encrypt information c, D _Sk (c) is to decrypt information c with the private key of the server, and E _Syj (c) is to encrypt information c with symmetric key Sy _j ; Step 3, fast authentication stage; (1) The mobile reader sends a query authentication request; the mobile reader generates a random number Nr _j , and then calculates M ₁ =Nr _j ⊕K _i and M ₂ =h(Nr _j ); the mobile reader sends M ₁ and M ₂ give the label; (2) The tag uses its own stored shared key K _i to calculate and judge is established; if If it is established, it proves that the mobile reader is legal, otherwise the tag does not respond; if the tag verifies that the mobile reader is legal, it generates a random number Nt _i ; and then calculates: M ₃ =Nt _i ⊕K _i , M ₄ =h(Nt _i ⊕Nr _j ), M ₅ ＝h(Tid _i ⊕Nt _i ); the tag sends the information M ₃ , M ₄ , M ₅ to the mobile reader; (3) After receiving the message, the mobile reader uses the shared key K _i to calculate Nt _i , and then verifies is established, if The establishment proves that the tag is legal; the mobile reader first looks up whether Tid _i exists in itself, and verifies is established; if Established, the authentication is successful.