A Privacy-Preserving Grouping Proof Protocol Based on ECC with Untraceability for RFID

HTML  Download Download as PDF (Size: 266KB)  PP. 336-341  
DOI: 10.4236/am.2012.34051    4,167 Downloads   7,797 Views  Citations

ABSTRACT

An RFID (Radio-Frequency IDentification) system provides the mechanism to identify tags to readers and then to execute specific RFID-enabled applications. In those applications, secure protocols using lightweight cryptography need to be developed and the privacy of tags must be ensured. In 2010, Batina et al. proposed a privacy-preserving grouping proof protocol for RFID based on ECC (Elliptic Curve Cryptography) in public-key cryptosystem. In the next year, Lv et al. had shown that Batina et al.’s protocol was insecure against the tracking attack such that the privacy of tags did not be preserved properly. Then they proposed a revised protocol based on Batina et al.’s work. Their revised protocol was claimed to have all security properties and resisted tracking attack. But in this paper, we prove that Lv et al.’s protocol cannot work properly. Then we propose a new version protocol with some nonce to satisfy the functions of Batina et al.’s privacy-preserving grouping proof protocol. Further we try the tracing attack made by Lv et al. on our protocol and prove our protocol can resist this attack to recover the untraceability.

Share and Cite:

W. Ko, S. Chiou, E. Lu and H. Chang, "A Privacy-Preserving Grouping Proof Protocol Based on ECC with Untraceability for RFID," Applied Mathematics, Vol. 3 No. 4, 2012, pp. 336-341. doi: 10.4236/am.2012.34051.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.