Download now Free registration required
Since the introduction of the concept of grouping proofs by Juels, which permit RFID tags to generate evidence that they have been scanned simultaneously, various new schemes have been proposed. Their common property is the use of symmetric-key primitives. However, it has been shown that such schemes often entail scalability, security and/or privacy problems. In this paper, the authors extend the notion of public-key RFID authentication protocols, and propose a privacy-preserving multiparty grouping-proof protocol which relies exclusively on the use of Elliptic Curve Cryptography (ECC). It allows to generate a proof which is verifiable by a trusted verifier in an offline setting, even when readers or tags are potentially untrusted, and it is privacy-preserving in the setting of a narrow-strong attacker.
- Format: PDF
- Size: 220.16 KB