Visible to the public An Efficient and Provably Secure RFID Grouping Proof Protocol

TitleAn Efficient and Provably Secure RFID Grouping Proof Protocol
Publication TypeConference Paper
Year of Publication2017
AuthorsCheng, Shu, Varadharajan, Vijay, Mu, Yi, Susilo, Willy
Conference NameProceedings of the Australasian Computer Science Week Multiconference
PublisherACM
Conference LocationNew York, NY, USA
ISBN Number978-1-4503-4768-6
KeywordsHuman Behavior, human factor, pubcrawl, radio frequency identification, resilience, Resiliency, RFID, RFIDs
Abstract

RFID Grouping proof convinces an offline verifier that multiple tags are simultaneously scanned. Various solutions have been proposed but most of them have security and privacy vulnerabilities. In this paper, we propose an elliptic-curve-based RFID grouping proof protocol. Our protocol is proven secure and narrow-strong private. We also demonstrate that our grouping proof can be batch verified to improve the efficiency for large-scale RFID systems and it is suitable for low-cost RFID tags.

URLhttp://doi.acm.org/10.1145/3014812.3014885
DOI10.1145/3014812.3014885
Citation Keycheng_efficient_2017