An efficient and provably secure RFID grouping proof protocol | Zendy

Shu Cheng | Zendy; Vijay Varadharajan | Zendy; Yi Mu | Zendy; Willy Susilo | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An efficient and provably secure RFID grouping proof protocol

Author(s) -

Shu Cheng,

Vijay Varadharajan,

Yi Mu,

Willy Susilo

Publication year - 2016

Publication title -

proceedings of the australasian computer science week multiconference

Language(s) - English

Resource type - Conference proceedings

DOI - 10.1145/3014812.3014885

Subject(s) - computer science , protocol (science) , proof of concept , formal proof , distributed computing , computer network , theoretical computer science , embedded system , operating system , mathematical proof , mathematics , medicine , alternative medicine , geometry , pathology

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.7 page(s

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research