An efficient and provably secure RFID grouping proof protocol

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 narrowstrong 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. In this paper, we propose an elliptic-curvebased 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.

One‐round provably secure yoking‐proof for RFID applications

“…Therefore, another technique route is to design the yoking‐proof schemes based on the public‐key cryptographic primitives. Some public‐key based yoking‐proof schemes were presented to address similar security and privacy problems as the symmetric‐key based yoking‐proof schemes. From the efficiency concern, it is clear that the symmetric‐key based yoking‐proof schemes are more suitable for the RFID applications than the public‐key based yoking‐proof schemes.…”