A universally composable secure grouping‐proof protocol for RFID tags. (21st May 2015)

• Record Type: Journal Article
• Authors: Yuan, Bianqing; Liu, Jiqiang
• Other Names: Zhang Yunquan guestEditor.; Zhang Ji‐Lin guestEditor.; Notare Mirela Sechi Moretti Annoni guestEditor.; Li Gang guestEditor.; Niu Wenjia guestEditor.; Guo Li guestEditor.; Batten Lynn guestEditor.; Liu Yinlong guestEditor.; Cai Guoyong guestEditor.
• Is Part Of: Concurrency and computation. Volume 28:Number 6(2016)
• Page Start: 1872
• Page End: 1883
• Publication Date: 2015-05-21
• Subjects: universally composable -- RFID -- grouping‐proof -- broadcast -- security protocol; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.3548
• Languages: English
• ISSNs: 1532-0626

Abstract

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.