Premium
A universally composable secure grouping‐proof protocol for RFID tags
Author(s) -
Yuan Bianqing,
Liu Jiqiang
Publication year - 2015
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.3548
Subject(s) - computer science , protocol (science) , proof of concept , anonymity , adversary , scheme (mathematics) , mathematical proof , computer security , provable security , universal composability , replay attack , cryptographic protocol , cryptography , theoretical computer science , authentication (law) , mathematics , medicine , mathematical analysis , alternative medicine , geometry , pathology , operating system
Summary A grouping‐proof protocol is to generate a proof that a group of tags have been scanned simultaneously in the range of a reader. Security and efficiency become the core issues when designing a grouping‐proof protocol. In this paper, we first describe the deployment model, adversary model, and security requirements of a grouping‐proof protocol. Then, we propose an offline reading order‐independent grouping‐proof protocol. To demonstrate security of our scheme, we present an ideal grouping‐proof functionality in the universally composable framework. Subsequently, we prove that the proposed protocol realizes the defined ideal functionality. Compared with the existing grouping‐proof protocols, our scheme satisfies the privacy and security requirements of a grouping‐proof protocol including tag/reader anonymity, tag/reader location privacy, mutual authorized access, anti‐active attack, anti‐replay attack, concurrent security, and so on. Meanwhile, our scheme has desirable performance. It conforms to the computational constraints of low‐cost passive radio frequency identification tags, which makes it suitable for large‐scale application. Copyright © 2015 John Wiley & Sons, Ltd.