Visible to the public A Secure and Efficient Parallel-Dependency RFID Grouping-Proof Protocol

TitleA Secure and Efficient Parallel-Dependency RFID Grouping-Proof Protocol
Publication TypeConference Paper
Year of Publication2019
AuthorsCherneva, V., Trahan, J.
Conference Name2019 IEEE International Conference on RFID (RFID)
ISBN Number978-1-7281-1210-7
Keywordscryptographic protocols, data privacy, Elliptic curve cryptography, grouping-proofs, Human Behavior, human factors, improved offline protocol, missing tags, parallel protocol, parallel-dependency grouping-proof protocol, parallel-dependency RFID grouping-proof protocol, privacy, Protocols, pubcrawl, radio frequency identification, radiofrequency identification, resilience, Resiliency, RFID, RFID tagged objects group, RFIDs, robust privacy mechanisms, Scalability, security, serial-dependent grouping-proof protocol, Sundaresan grouping-proof protocols, telecommunication security
Abstract

In this time of ubiquitous computing and the evolution of the Internet of Things (IoT), the deployment and development of Radio Frequency Identification (RFID) is becoming more extensive. Proving the simultaneous presence of a group of RFID tagged objects is a practical need in many application areas within the IoT domain. Security, privacy, and efficiency are central issues when designing such a grouping-proof protocol. This work is motivated by our serial-dependent and Sundaresan et al.'s grouping-proof protocols. In this paper, we propose a light, improved offline protocol: parallel-dependency grouping-proof protocol (PDGPP). The protocol focuses on security, privacy, and efficiency. PDGPP tackles the challenges of including robust privacy mechanisms and accommodates missing tags. It is scalable and complies with EPC C1G2.

URLhttps://ieeexplore.ieee.org/document/8719277
DOI10.1109/RFID.2019.8719277
Citation Keycherneva_secure_2019