RFID Tags Batch Authentication Revisited – Communication Overhead and Server Computational Complexity Limits

Błaśkiewicz, Przemysław; Krzywiecki, Łukasz; Syga, Piotr

doi:10.1007/978-3-319-49151-6_15

Cited by 1 publication

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Notably, since the publication of our original paper [BKS16] a similar approach to ours has been presented in [LLW19], also utilising Bloom filters. However, this work differs from our approach in the assumption that the database of legitimate tags is small enough to fit in a reasonably short filter without much loss of information.…”

Section: B Related Workmentioning

confidence: 99%

“…The amount of information exchanged between the reader and the server grows with the size of the batch. This paper is an extended version of [BKS16], whose main contributions are:…”

Section: Problem Statement and Our Contributionmentioning

confidence: 99%

“…2 The full version of the paper was presented in ISPEC 2016 [BKS16] positive ratio of the filters. Cuckoo filter is a data structure that supports approximate set membership tests and can replace Bloom filters.…”

Section: Problem Statement and Our Contributionmentioning

confidence: 99%

See 2 more Smart Citations

RFID Batch Authentication—A Usable Scheme Providing Anonymity

et al. 2022

Self Cite

View full text Add to dashboard Cite

Businesses are slowly replacing Universal Product Code (barcodes used for tracking items) with radio-frequency identification (RFID). Unlike a barcode, RFID tag does not need to be within the line of sight of the reader, and can be interrogated from up to hundreds of meters from the reader in the case of active tag. Some readers are designed to read multiple RFID tags concurrently, which is useful in, e.g., warehouses. We address the problem of efficient methods for simultaneous authentication of multiple RFID tags -batch tag authentication. We provide a general design to build a provable secure batch tag authentication protocol from a single-tag authentication scheme using some aggregation function. Our main goal is to build a computationally-efficient batch tag authentication method that provides a reasonable level of anonymity in a model with an untrusted RFID reader. We provide an efficiency analysis of a protocol where the Bloom filter is used as the aggregation function together with a brief comparison with alternative data structures.

show abstract

Section: B Related Workmentioning

confidence: 99%

“…The amount of information exchanged between the reader and the server grows with the size of the batch. This paper is an extended version of [BKS16], whose main contributions are:…”

Section: Problem Statement and Our Contributionmentioning

confidence: 99%