Skip to Content
You are currently on the new version of our website. Access the old version .
Future InternetFuture Internet
  • Article
  • Open Access

1 January 2018

15 Pages

An Anonymous Offline RFID Grouping-Proof Protocol

,
,
and
1
School of Information Science and Engineering, Central South University, Changsha 410083, China
2
College of Physics and Information Science, Hunan Normal University, Changsha 410012, China
3
School of Information Science and Engineering, Central South University, Changsha 410083, China
4
College of Computer Science and Electronic Engineering, Hunan University, Changsha 410082, China

Abstract

As more and more items are tagged with RFID (Radio Frequency Identification) tags, grouping-proof technology is widely utilized to provide a coexistence evidence for a group of related items. Due to the wireless channel used in RFID systems, a security risk exists in the communication between the reader and tags. How to ensure the tag’s information security and to generate reliable grouping-proof becomes a hot research topic. To protect the privacy of tags, the verification of grouping-proof is traditionally executed by the verifier, and the reader is only used to collect the proof data. This approach can cause the reader to submit invalid proof data to the verifier in the event of DoP (Deny of Proof) attack. In this paper, an ECC-based, off-line anonymous grouping-proof protocol (EAGP) is proposed. The protocol authorizes the reader to examine the validity of grouping-proof without knowing the identities of tags. From the security and performance analysis, the EAGP can protect the security and privacy of RFID tags, and defence impersonation and replay attacks. Furthermore, it has the ability to reduce the system overhead caused by the invalid submission of grouping-proofs. As a result, the proposed EAGP equips practical application values.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.