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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
