Grouping Proofs for Dynamic Groups of RFID Tags: A Secure and Scalable Protocol
Document Type
Conference Proceeding
Publication Date
1-1-2020
Abstract
Radio Frequency Identification (RFID) improves the efficiency of tracking, monitoring, and managing assets throughout an entire life cycle or while in transit. A grouping proof built by an RFID reader establishes that the RFID tags belonging to a group are present in range of the reader at the same time. In many practical scenarios, such as supply chain applications, RFID grouping proofs improve item (group)-level visibility throughout the supply chain and accuracy of tracking. RFID grouping-proof protocols aim to construct a proof in a way that is efficient in terms of computation and communication while preserving the privacy of the tags. Further, a protocol must be robust to attacks on its security that could cause the proof to fail or that would expose secret information on the tags. In this work, we present a grouping-proof protocol for subgroups of a larger group that are defined dynamically and that can overlap. We analyze our dynamic grouping-proof protocol in comparison to existing grouping-proof protocols in terms of privacy, security, and efficiency.
Publication Source (Journal or Book title)
2020 10th Annual Computing and Communication Workshop and Conference, CCWC 2020
First Page
97
Last Page
103
Recommended Citation
Cherneva, V., & Trahan, J. (2020). Grouping Proofs for Dynamic Groups of RFID Tags: A Secure and Scalable Protocol. 2020 10th Annual Computing and Communication Workshop and Conference, CCWC 2020, 97-103. https://doi.org/10.1109/CCWC47524.2020.9031231
