Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2491288.2491299acmconferencesArticle/Chapter ViewAbstractPublication PagesmobihocConference Proceedingsconference-collections
research-article

Informative counting: fine-grained batch authentication for large-scale RFID systems

Published: 29 July 2013 Publication History

Abstract

Many algorithms have been introduced to deterministically authenticate Radio Frequency Identification (RFID) tags, while little work has been done to address the scalability issue in batch authentications. Deterministic approaches verify them one by one, and the communication overhead and time cost grow linearly with increasing size of tags. We design a fine-grained batch authentication scheme, INformative Counting (INC), which achieves sublinear authentication time and communication cost in batch verifications. INC also provides authentication results with accurate estimates of the number of counterfeiting tags and genuine tags, while previous batch authentication methods merely provide 0/1 results indicating the existence of counterfeits. We conduct detailed theoretical analysis and extensive experiments to examine this design and the results show that INC significantly outperforms previous work in terms of effectiveness and efficiency.

References

[1]
Thorsten Staake, Frédéric Thiesse, and Elgar Fleisch. Business strategies in the counterfeit market. Journal of Business Research, 65(5):658 -- 665, 2012.
[2]
ICC Counterfeiting Intelligence Bureau. Countering counterfeiting: A guide to protecting and enforcing intellectual property rights. 1997.
[3]
The spread of counterfeiting: Knock-offs catch on. The Economist, 2010.
[4]
S. Weis, S. Sarma, R. Rivest, and D. Engels. Security and privacy aspects of low-cost radio frequency identification systems. Security in pervasive computing, pages 50--59, 2004.
[5]
L. Lu, J. Han, L. Hu, Y. Liu, and L.M. Ni. Dynamic key-updating: Privacy-preserving authentication for rfid systems. In Proc. of IEEE PERCOM, 2007.
[6]
L. Lu, J. Han, R. Xiao, and Y. Liu. Action: breaking the privacy barrier for rfid systems. In Proc. of IEEE INFOCOM, 2009.
[7]
L. Yang, J. Han, Y. Qi, and Y. Liu. Identification-free batch authentication for rfid tags. In Proc. of IEEE ICNP, 2010.
[8]
L. Bolotnyy and G. Robins. Physically unclonable function-based security and privacy in rfid systems. In Proc. of IEEE PERCOM, 2007.
[9]
Y.K. Lee, L. Batina, and I. Verbauwhede. Ec-rac (ecdlp based randomized access control): Provably secure rfid authentication protocol. In Proc. of IEEE RFID, 2008.
[10]
Y.K. Lee, L. Batina, and I. Verbauwhede. Untraceable rfid authentication protocols: Revision of ec-rac. In Proc. of IEEE RFID, 2009.
[11]
L.G. Roberts. Aloha packet system with and without slots and capture. ACM SIGCOMM Computer Communication Review, 5(2):28--42, 1975.
[12]
B. Sheng, Q. Li, and W. Mao. Efficient continuous scanning in rfid systems. In Proc. of IEEE INFOCOM, 2010.
[13]
D. Benedetti, G. Maselli, and C. Petrioli. Fast identification of mobile rfid tags. In Proc. of IEEE MASS, 2012.
[14]
T.F. La Porta, G. Maselli, and C. Petrioli. Anticollision protocols for single-reader rfid systems: Temporal analysis and optimization. IEEE Transactions on Mobile Computing, 10(2):267 --279, 2011.
[15]
R. Kumar, T.F. La Porta, G. Maselli, and C. Petrioli. Interference cancellation-based rfid tags identification. In Proc. of ACM MSWiM, 2011.
[16]
J. Capetanakis. Tree algorithms for packet broadcast channels. IEEE Transactions on Information Theory, 25(5):505--515, 1979.
[17]
J. Myung and W. Lee. Adaptive splitting protocols for rfid tag collision arbitration. In Proc. of ACM MobiHoc, 2006.
[18]
Epcglobal radio-frequency identity protocols class-1 generation-2 uhf rfid protocol for communications at 860 mhz-960mhz, 2008.
[19]
Information technology radio frequency identification for item management part 6: Parameters for air interface communications at 860 mhz to 960 mhz, 2010.
[20]
T. Dimitriou. A secure and efficient rfid protocol that could make big brother (partially) obsolete. In Proc. of IEEE PERCOM, 2006.
[21]
Li Lu, Yunhao Liu, and Xiang-Yang Li. Refresh: Weak privacy model for rfid systems. In Proc. of IEEE INFOCOM, 2010.
[22]
M. Kodialam and T. Nandagopal. Fast and reliable estimation schemes in rfid systems. In Proc. of ACM MobiCom, 2006.
[23]
C. Qian, H. Ngan, Y. Liu, and L.M. Ni. Cardinality estimation for large-scale rfid systems. IEEE Transactions on Parallel and Distributed Systems, 22(9):1441--1454, 2011.
[24]
Y. Zheng and M Li. Pet: Probabilistic estimating tree for large-scale rfid estimation. IEEE Transactions on Mobile Computing, 11(11):1763--1774, 2012.
[25]
M. Shahzad and A. Liu. Every bit counts - fast and scalable rfid estimation. In Proc. of ACM MobiCom, 2012.
[26]
T. Li, S. S. Wu, S. Chen, and M. C. K. Yang. Generalized energy-efficient algorithms for the rfid estimation problem. IEEE/ACM Transactions on Networking, 20(6):1978 --1990, 2012.
[27]
Y. Zheng and M. Li. Zoe: Fast cardinality estimation for large-scale rfid systems. In Proc. of IEEE INFOCOM, 2013.
[28]
P.H. Cole and D.C. Ranasinghe. Networked rfid systems. Networked RFID Systems and Lightweight Cryptography, pages 45--58, 2008.
[29]
S. Devadas, E. Suh, S. Paral, R. Sowell, T. Ziola, and V. Khandelwal. Design and implementation of puf-based unclonable rfid ics for anti-counterfeiting and security applications. In Proc. of IEEE RFID, 2008.
[30]
R. Zhang, Y. Liu, Y. Zhang, and J. Sun. Fast identification of the missing tags in a large rfid system. In Proc. of IEEE SECON, 2011.
[31]
P. Flajolet and G. Nigel Martin. Probabilistic counting algorithms for data base applications. Journal of computer and system sciences, 31(2):182--209, 1985.
[32]
R. Motwani and P. Raghavan. Randomized algorithms. Chapman & Hall/CRC, 2010.
[33]
P.S. Bullen. Handbook of Means and their Inequalities. Springer, 2003.
[34]
Open rfid lab, http://pdcc.ntu.edu.sg/wands/orl.

Cited By

View all
  • (2022)RFID Batch Authentication—A Usable Scheme Providing AnonymityIEEE Access10.1109/ACCESS.2022.319779510(85368-85383)Online publication date: 2022
  • (2020)Fast and Accurate Detection of Unknown Tags for RFID Systems – Hash Collisions are DesirableIEEE/ACM Transactions on Networking10.1109/TNET.2019.295723928:1(126-139)Online publication date: Feb-2020
  • (2020)Security and privacy issues of physical objects in the IoT: challenges and opportunitiesDigital Communications and Networks10.1016/j.dcan.2020.09.001Online publication date: Sep-2020
  • Show More Cited By

Index Terms

  1. Informative counting: fine-grained batch authentication for large-scale RFID systems

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    MobiHoc '13: Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
    July 2013
    322 pages
    ISBN:9781450321938
    DOI:10.1145/2491288
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 29 July 2013

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. RFID tags
    2. batch authentication
    3. informative counting

    Qualifiers

    • Research-article

    Conference

    MobiHoc '13
    Sponsor:

    Acceptance Rates

    MobiHoc '13 Paper Acceptance Rate 42 of 234 submissions, 18%;
    Overall Acceptance Rate 296 of 1,843 submissions, 16%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)7
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 03 Sep 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2022)RFID Batch Authentication—A Usable Scheme Providing AnonymityIEEE Access10.1109/ACCESS.2022.319779510(85368-85383)Online publication date: 2022
    • (2020)Fast and Accurate Detection of Unknown Tags for RFID Systems – Hash Collisions are DesirableIEEE/ACM Transactions on Networking10.1109/TNET.2019.295723928:1(126-139)Online publication date: Feb-2020
    • (2020)Security and privacy issues of physical objects in the IoT: challenges and opportunitiesDigital Communications and Networks10.1016/j.dcan.2020.09.001Online publication date: Sep-2020
    • (2019)Fast RFID Sensory Data CollectionIEEE/ACM Transactions on Networking10.1109/TNET.2019.291441227:3(1179-1191)Online publication date: 1-Jun-2019
    • (2019)Implementation of Differential Tag Sampling for COTS RFID SystemsIEEE Transactions on Mobile Computing10.1109/TMC.2019.2917444(1-1)Online publication date: 2019
    • (2019)Efficient and Lightweight Batch Authentication for Large-Scale RFID SystemsIEEE Wireless Communications Letters10.1109/LWC.2019.29152328:4(1272-1275)Online publication date: Aug-2019
    • (2018)Fast Identification of Blocked RFID TagsIEEE Transactions on Mobile Computing10.1109/TMC.2018.279321917:9(2041-2054)Online publication date: 1-Sep-2018
    • (2018)Fast and Accurate Missing Tag Detection for Multi-category RFID Systems2018 IEEE International Conference on Smart Internet of Things (SmartIoT)10.1109/SmartIoT.2018.00-12(135-142)Online publication date: Aug-2018
    • (2017)Top- $k$ Queries for Categorized RFID SystemsIEEE/ACM Transactions on Networking10.1109/TNET.2017.272248025:5(2587-2600)Online publication date: 1-Oct-2017
    • (2017)RFID Estimation With Blocker TagsIEEE/ACM Transactions on Networking10.1109/TNET.2016.259557125:1(224-237)Online publication date: 1-Feb-2017
    • Show More Cited By

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media