# American Institute of Mathematical Sciences

August & September  2019, 12(4&5): 1489-1500. doi: 10.3934/dcdss.2019102

## An efficient RFID anonymous batch authentication protocol based on group signature

 1 School of Information and Control Engineering, Xi'an University of Architecture and Technology, Xi'an 710055, Shaanxi, China 2 The State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an 710071, China

* Corresponding author: Lanjun Dang

Received  June 2017 Revised  November 2017 Published  November 2018

In order to address the anonymous batch authentication problem of a legal reader to many tags in RFID (Radio Frequency Identification) system, an efficient RFID anonymous batch authentication protocol was proposed based on group signature. The anonymous batch authentications of reader to many tags are achieved by using a one-time group signature based on Hash function; the authentication of the tag to the reader is realized by employing MAC (Message Authentication Code). The tag's anonymity is achieved via the dynamic TID (Temporary Identity) instead of the tag's identity. The proposed protocol can resist replay attacks by using random number. Theoretical analyses show that, the proposed protocol reaches the expected security goals. Compared with the protocol proposed by Liu, the proposed protocol reduces the computation and storage of the server and tag while improving the security.

Citation: Jie Xu, Lanjun Dang. An efficient RFID anonymous batch authentication protocol based on group signature. Discrete & Continuous Dynamical Systems - S, 2019, 12 (4&5) : 1489-1500. doi: 10.3934/dcdss.2019102
##### References:

show all references

##### References:
A typical RFID system
The proposed RFID batch authentication protocol based on group signature
The comparison of the calculation time of server in the two protocols
The comparison of the storage amount of tag in the two protocols
The comparison of the storage amount of server in the two protocols
Notations
 $K_{ID_i}$ authentication key of each tag, used to authenticate a reader $K_{i}$ private key of each tag in the group signature scheme $X_{i}$ exclusive-OR of the Hash values of $n$ strings in one tag's private key $Y$ group public key $C_{i}$ exclusive-OR of the other $m$-1 tags' $X$ values except the tag that generated group signature $\sigma$ $\sigma =(\sigma_{1}, \sigma_{2}, \ldots, \sigma_{n}, C_{i})$, the group signature be generated by one tag ID$_{i}$ one tag's identity information $K$ MAC value of message $M$ under key $K$ $\vert\vert$ concatenation of two data
 $K_{ID_i}$ authentication key of each tag, used to authenticate a reader $K_{i}$ private key of each tag in the group signature scheme $X_{i}$ exclusive-OR of the Hash values of $n$ strings in one tag's private key $Y$ group public key $C_{i}$ exclusive-OR of the other $m$-1 tags' $X$ values except the tag that generated group signature $\sigma$ $\sigma =(\sigma_{1}, \sigma_{2}, \ldots, \sigma_{n}, C_{i})$, the group signature be generated by one tag ID$_{i}$ one tag's identity information $K$ MAC value of message $M$ under key $K$ $\vert\vert$ concatenation of two data
The security comparisons of the two protocols
 Mutualauthentication Taganonymity Messageconfidentiality Messageintegrity Messagefreshness The Protocol [13] $\backslash$ $\surd$ $\surd$ $\surd$ $\surd$ Our protocol $\surd$ $\surd$ $\surd$ $\surd$ $\surd$
 Mutualauthentication Taganonymity Messageconfidentiality Messageintegrity Messagefreshness The Protocol [13] $\backslash$ $\surd$ $\surd$ $\surd$ $\surd$ Our protocol $\surd$ $\surd$ $\surd$ $\surd$ $\surd$
The performance comparisons of the two protocols
 Tag'scalculation Server'scalculation Tag'sstorage Server'sstorage The protocol [13] 0 mSM+2$P$ 20$k(m$+2)bytes 20($k+m)$bytes Our protocol 82$h$ ($m$+81)$h$ 3260bytes (42$m$+20)bytes
 Tag'scalculation Server'scalculation Tag'sstorage Server'sstorage The protocol [13] 0 mSM+2$P$ 20$k(m$+2)bytes 20($k+m)$bytes Our protocol 82$h$ ($m$+81)$h$ 3260bytes (42$m$+20)bytes
The cryptography operation times of server (ms)
 Pairing Scalar multiplication Hash operation 3.16 0.79 0.0002
 Pairing Scalar multiplication Hash operation 3.16 0.79 0.0002
 [1] Xu Zhang, Xiang Li. Modeling and identification of dynamical system with Genetic Regulation in batch fermentation of glycerol. Numerical Algebra, Control & Optimization, 2015, 5 (4) : 393-403. doi: 10.3934/naco.2015.5.393 [2] Arseny Egorov. Morse coding for a Fuchsian group of finite covolume. Journal of Modern Dynamics, 2009, 3 (4) : 637-646. doi: 10.3934/jmd.2009.3.637 [3] Xiaohong Li, Mingxin Sun, Zhaohua Gong, Enmin Feng. Multistage optimal control for microbial fed-batch fermentation process. Journal of Industrial & Management Optimization, 2021  doi: 10.3934/jimo.2021040 [4] Zhimin Chen, Kaihui Liu, Xiuxiang Liu. Evaluating vaccination effectiveness of group-specific fractional-dose strategies. Discrete & Continuous Dynamical Systems - B, 2021  doi: 10.3934/dcdsb.2021062

2019 Impact Factor: 1.233

## Tools

Article outline

Figures and Tables