History


Please fill in your query. A complete syntax description you will find on the General Help page.
Privacy-preserving ECC-based grouping proofs for RFID. (English)
Burmester, Mike (ed.) et al., Information security. 13th international conference, ISC 2010, Boca Raton, FL, USA, October 25‒28, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-18177-1/pbk). Lecture Notes in Computer Science 6531, 159-165 (2011).
Summary: The concept of grouping proofs has been introduced by Juels to permit RFID tags to generate a verifiable proof that they have been scanned simultaneously, even when readers or tags are potentially untrusted. In this paper, we extend this concept and propose a narrow-strong privacy-preserving RFID grouping proof and demonstrate that it can easily be extended to use cases with more than two tags, without any additional cost for an RFID tag. Our protocols rely exclusively on the use of Elliptic Curve Cryptography (ECC). To illustrate the implementation feasibility of our proposed solutions, we present a novel ECC hardware architecture designed for RFID.
WorldCat.org
Valid XHTML 1.0 Transitional Valid CSS!