An efficient and provably secure RFID grouping proof protocol

Authors

Shu Cheng, Macquarie University
Vijay Varadharajan, Macquarie University
Yi Mu, University of WollongongFollow
Willy Susilo, University of WollongongFollow

RIS ID

111309

Publication Details

Cheng, S., Varadharajan, V., Mu, Y. & Susilo, W. (2017). An efficient and provably secure RFID grouping proof protocol. Australasian Computer Science Week Multiconference (ACSW '17) (pp. 1-7). New York: ACM.

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.