Wei Gong
Yunhao Liu
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.
- Thorsten Staake, Frédéric Thiesse, and Elgar Fleisch. Business strategies in the counterfeit market. Journal of Business Research, 65(5):658 -- 665, 2012.Google Scholar
Cross Ref
- ICC Counterfeiting Intelligence Bureau. Countering counterfeiting: A guide to protecting and enforcing intellectual property rights. 1997.Google Scholar
- The spread of counterfeiting: Knock-offs catch on. The Economist, 2010.Google Scholar
- 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.Google Scholar
- 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. Google ScholarDigital Library
- L. Lu, J. Han, R. Xiao, and Y. Liu. Action: breaking the privacy barrier for rfid systems. In Proc. of IEEE INFOCOM, 2009.Google ScholarCross Ref
- L. Yang, J. Han, Y. Qi, and Y. Liu. Identification-free batch authentication for rfid tags. In Proc. of IEEE ICNP, 2010. Google ScholarDigital Library
- L. Bolotnyy and G. Robins. Physically unclonable function-based security and privacy in rfid systems. In Proc. of IEEE PERCOM, 2007. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- Y.K. Lee, L. Batina, and I. Verbauwhede. Untraceable rfid authentication protocols: Revision of ec-rac. In Proc. of IEEE RFID, 2009.Google Scholar
- L.G. Roberts. Aloha packet system with and without slots and capture. ACM SIGCOMM Computer Communication Review, 5(2):28--42, 1975. Google ScholarDigital Library
- B. Sheng, Q. Li, and W. Mao. Efficient continuous scanning in rfid systems. In Proc. of IEEE INFOCOM, 2010. Google ScholarDigital Library
- D. Benedetti, G. Maselli, and C. Petrioli. Fast identification of mobile rfid tags. In Proc. of IEEE MASS, 2012. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- R. Kumar, T.F. La Porta, G. Maselli, and C. Petrioli. Interference cancellation-based rfid tags identification. In Proc. of ACM MSWiM, 2011. Google ScholarDigital Library
- J. Capetanakis. Tree algorithms for packet broadcast channels. IEEE Transactions on Information Theory, 25(5):505--515, 1979. Google ScholarDigital Library
- J. Myung and W. Lee. Adaptive splitting protocols for rfid tag collision arbitration. In Proc. of ACM MobiHoc, 2006. Google ScholarDigital Library
- Epcglobal radio-frequency identity protocols class-1 generation-2 uhf rfid protocol for communications at 860 mhz-960mhz, 2008.Google Scholar
- Information technology radio frequency identification for item management part 6: Parameters for air interface communications at 860 mhz to 960 mhz, 2010.Google Scholar
- T. Dimitriou. A secure and efficient rfid protocol that could make big brother (partially) obsolete. In Proc. of IEEE PERCOM, 2006. Google ScholarDigital Library
- Li Lu, Yunhao Liu, and Xiang-Yang Li. Refresh: Weak privacy model for rfid systems. In Proc. of IEEE INFOCOM, 2010. Google ScholarDigital Library
- M. Kodialam and T. Nandagopal. Fast and reliable estimation schemes in rfid systems. In Proc. of ACM MobiCom, 2006. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Y. Zheng and M Li. Pet: Probabilistic estimating tree for large-scale rfid estimation. IEEE Transactions on Mobile Computing, 11(11):1763--1774, 2012. Google ScholarDigital Library
- M. Shahzad and A. Liu. Every bit counts - fast and scalable rfid estimation. In Proc. of ACM MobiCom, 2012. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Y. Zheng and M. Li. Zoe: Fast cardinality estimation for large-scale rfid systems. In Proc. of IEEE INFOCOM, 2013.Google ScholarCross Ref
- P.H. Cole and D.C. Ranasinghe. Networked rfid systems. Networked RFID Systems and Lightweight Cryptography, pages 45--58, 2008.Google ScholarCross Ref
- 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.Google ScholarCross Ref
- 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.Google ScholarCross Ref
- P. Flajolet and G. Nigel Martin. Probabilistic counting algorithms for data base applications. Journal of computer and system sciences, 31(2):182--209, 1985. Google ScholarDigital Library
- R. Motwani and P. Raghavan. Randomized algorithms. Chapman & Hall/CRC, 2010.Google ScholarDigital Library
- P.S. Bullen. Handbook of Means and their Inequalities. Springer, 2003.Google ScholarCross Ref
- Open rfid lab, http://pdcc.ntu.edu.sg/wands/orl.Google Scholar
Index Terms
- Informative counting: fine-grained batch authentication for large-scale RFID systems
Recommendations
Wise counting: fast and efficient batch authentication for large-scale RFID systems
MobiHoc '14: Proceedings of the 15th ACM international symposium on Mobile ad hoc networking and computingRadio Frequency Identification technology (RFID) is widely used in many applications, such as asset monitoring, e-passport and electronic payment, and is becoming one of the most effective solutions in cyber physical system. Since the identification ...
Fast and scalable counterfeits estimation for large-scale RFID systems
Many algorithms have been introduced to deterministically authenticate Radio Frequency Identification (RFID) tags, while little work has been done to address scalability issue in batch authentications. Deterministic approaches verify tags one by one, ...
Lattice‐based batch authentication scheme with dynamic identity revocation in VANET
AbstractAggregate signatures allow someone to aggregate multiple signatures into one signature, which is suitable for resource‐constrained and computationally inefficient environments. Identify‐based aggregate signature can solve the storage problem of ...
Comments