Analysis and realization of RFID grouping-proof protocol based on elliptic-curves cryptography
/ 0
- Details
- Category: Information technologies, systems analysis and administration
- Last Updated on 04 February 2016
- Published on 04 February 2016
- Hits: 4078
Authors:
Hongyan Kang, Heze University, Heze, Shandong, China
Abstract:
Purpose. With the wide application of RFID (Radio Frequency Identification) systems, scholars have become highly concerned about the design of efficient and secure grouping-proof protocols. Responding to the problems of privacy protection, security and efficiency of existing grouping-proof protocols, a new ECC (Elliptic Curves Cryptography) based RFID grouping-proof protocol is proposed after the analysis of existing grouping proof protocols.
Methodology. Some ECC-based grouping-proof protocols cannot resist impersonation attack and other common attacks, since there is no reader and verifier authentication or the reader and the verifier can be untrusted, one can also query the tags actively to collect the attack tuple and trick genuine reader and verifier. So we propose a scheme can realize the authorized access and mutual authentication of tags, readers, and verifier.
Findings. This paper attempts to expound on the initialization phase, the authorization phase, the group proof generation phase, and the group proof verification phase of the new grouping-proof protocol, and also make analyses in terms of privacy preservation, untraceability, reader anonymity, tag anonymity, authorization and authentication, etc.
Originality. In comparison to currently available ECC-based grouping-proof protocols, this protocol can realize the authorized access and mutual authentication of tags, readers, and backend servers.
Practical value. Analysis results show that this new project meets the security and privacy requirements of RFID system grouping-proof protocols, demonstrating better scalability and higher efficiency than similar protocols.
References:
1. Juels, A. (2004), “Yoking-Proofs” for RFID Tags”, Proc. of the 2nd IEEE Annual Conference on Pervasive Computing and Communications Workshops, pp. 138−143.
2. Selwyn Piramuthu (2006), “On Existence Proofs for Multiple RFID Tags”, IEEE International Conference on Pervasive Services, Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing, pp. 317−320.
3. Mike Burmester, Breno de Medeiros and Rossana Motta (2008), “Provably Secure Grouping-Proofs for RFID Tags”, Lecture Notes in Computer Science, vol. 5189, pp. 176−190.
4. Chien, H.Y., Yang, C.C., Wu, T.C. and Lee, C.F. (2011), “Two RFID-based solutions to enhance inpatient medication safety”, Journal of Medical Systems, vol. 35, no. 3, pp. 369−375.
5. Peris-Lopez, P., Orfila, A., Hernandez-Castro, J.C. and Lubbe, J.C.A.V.D. (2011), “Flaws on RFID grouping-proofs Guidelines for Future Sound Protocols”, Journal of Network and Computer Applications, vol. 34, no. 3, pp. 833−845.
6. Batina, L., Lee, Y., Seys, S., Singele, D. and Verbauwhede, I. (2011), “Privacy-preserving ECC-based grouping proofs for RFID”, Lecture Notes in Computer Science, vol. 6531, pp. 159−165.
7. Lv, C., Li, H., Ma, J., Niu, B. and Jiang, H. (2011), “Security analysis of a privacy-preserving ECC-based grouping-proof protocol”, Journal of Convergence Information Technology, vol. 6, no. 3, pp. 113−119.
8. Ko, W., Chiou, S., Lu, E., Chang, H. (2011), “An improvement of privacy-preserving ECC-based grouping proof for RFID”, Cross Strait Quad-Regional Radio Science and Wireless Technology Conference, pp. 1062−1064.
9. Lin, Q., and Zhang, F. (2012), “ECC-based grouping-proof RFID for inpatient medication safety”, Journal of Medical Systems, vol. 36, no. 6, pp. 3527−3531.
10. Bellare, M. and Palacio, A. (2002), “GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks”, Lecture Notes in Computer Science, vol.2442, pp. 162−177.
 2015_05_kang
|
|
 2016-02-03  454.37 KB  975 |
|
Archive