Next Article in Journal
Review of Latest Advances in 3GPP Standardization: D2D Communication in 5G Systems and Its Energy Consumption Models
Next Article in Special Issue
Investigating the Influence of Special On–Off Attacks on Challenge-Based Collaborative Intrusion Detection Networks
Previous Article in Journal / Special Issue
A New Lightweight Watchdog-Based Algorithm for Detecting Sybil Nodes in Mobile WSNs
Article Menu
Issue 1 (January) cover image

Export Article

Open AccessArticle
Future Internet 2018, 10(1), 2;

An Anonymous Offline RFID Grouping-Proof Protocol

School of Information Science and Engineering, Central South University, Changsha 410083, China
College of Physics and Information Science, Hunan Normal University, Changsha 410012, China
School of Information Science and Engineering, Central South University, Changsha 410083, China
College of Computer Science and Electronic Engineering, Hunan University, Changsha 410082, China
School of Computer Science and Educational Software, Guangzhou University, Guangzhou 510006, China
These authors contributed equally to this work.
Author to whom correspondence should be addressed.
Received: 29 November 2017 / Revised: 23 December 2017 / Accepted: 26 December 2017 / Published: 1 January 2018
(This article belongs to the Special Issue Security and Privacy in Wireless and Mobile Networks)
Full-Text   |   PDF [1378 KB, uploaded 1 January 2018]   |  


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. View Full-Text
Keywords: grouping-proof; anonymous; elliptic curve cryptography grouping-proof; anonymous; elliptic curve cryptography

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Printed Edition Available!
A printed edition of this Special Issue is available here.

Share & Cite This Article

MDPI and ACS Style

Zhou, Z.; Liu, P.; Liu, Q.; Wang, G. An Anonymous Offline RFID Grouping-Proof Protocol. Future Internet 2018, 10, 2.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Future Internet EISSN 1999-5903 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top