Hyoungmin Ham
ABSTRACT
An offline grouping proof shows that multiple Radio Frequency Identification tags are scanned simultaneously, regardless of a reader device's network connectivity. However, the previous offline grouping proof schemes are unsuitable for passive tags, and do not handle errors that cause performance degradation, such as transmission loss or synchronization failure of shared values between tags and a back-end database. In this paper, we propose an efficient offline grouping proof scheme using multiple types of tags. It makes use of an agent tag which does computing operations instead of the passive tags to reduce the computational cost of them, thus it eventually shortens the time for generating a grouping proof. We show that the number of modules and operations of the passive tags in our scheme are less than half of the previous schemes while it achieves the enhanced security and scalability.
- ISO/IEC 18000-7. 2009. Information technology, radio frequency identification for item management, part 7: Parameters for active air interface communications at 433 MHz.Google Scholar
- EPC radio-frequency identity protocols generation-2. 2013. UHF RFID specification for RFID air interface protocol for communications at 860 MHz 960 MHz version 2.0.0 ratified. http://www.gs1.org/gsmp/kc/epcglobal/uhfc1g2Google Scholar
- Bolotnyy, L. and Robins, G. 2006. Generalized yoking-proofs for a group of RFID tags. In Proceedings of the Annual International Conference on Mobile and Ubiquitous Systems: Networking Services (CA, USA, Jul 17--21, 2006). MobiQuitous, IEEE, New Jersey, 1--4. DOI=10.1109/MOBIQ.2006.340395Google ScholarCross Ref
- Burmester, M., Medeiros, B. and Motta. R. 2008. Provably secure grouping proofs for RFID tags. In Proceedings of IFIP WG 8.8/11.2 International Conference on Smart Card Research and Advanced Applications (London, UK, Sep 08--11, 2008). CARDIS'08, Springer-Verlag, Berlin, Heidelberg, 176--190. Google ScholarDigital Library
- Cormen, T. H., Leiserson, C. E., Rivest, R. L. and Stein, C. 2009. Introduction to Algorithms, third edition. MIT Press, 253--260. Google ScholarDigital Library
- Juels, A. Yoking-proofs for RFID tags. 2004. In Proceedings of IEEE Annual Conference on Pervasive Computing and Communications Workshops (Orlando, USA, Mar 14--17, 2004). PerCom'04, IEEE, New Jersey, 138--143. Google ScholarDigital Library
- Juels, A. 2006. RFID security and privacy: a research survey. J-SAC, 24, 2 (Feb. 2006), 381--394. Google ScholarDigital Library
- Karygiannis, A. T., Eydt, B., Barber, G., Bunn, L. and Phillips, T. 2007. Guidelines for securing radio frequency identification systems (sp800-98). Technical Report. Gaithersburg, MD, USA. Google ScholarDigital Library
- Hermans, J. and Peeters, R. 2012. Private yoking proofs: attacks, models and new provable constructions. In revised papers from the 8th International workshop on Radio Frequency Identification. Security and Privacy Issues (Nijmegen, The Netherlands, Jul 02--03, 2012). RFIDsec 2012. Springer-Verlag, Berlin, Heidelberg, 7739, 96--108. DOI= 10.1007/978-3-642-36140-1_7 Google ScholarDigital Library
- Lien, Y., Leng, X., Mayes, K. and Chiu, J. 2008. Reading order independent grouping proof for RFID tags. In Proceedings of IEEE International Conference on Intelligence and Security Informatics (Taipei, Taiwan, Jun 17--20, 2008). ISI'08. IEEE, New Jersey, 128--136. DOI = 10.1109/ISI.2008.4565042Google Scholar
- Lo, N. and Yeh, K. 2007. Anonymous coexistence proofs for RFID tags. JISE, 26, 4(Jul. 2007), 1213--1230.Google Scholar
- Molnar, D. and Wagner, D. 2004. Privacy and security in library RFID: Issues, practices, and architectures. In Proceedings of ACM Conference on Computer and Communications Security (Washington, DC, Oct 25--29, 2004). CCS'04. ACM, New York, NY. 210--219. DOI= 10.1145/1030083.1030112 Google ScholarDigital Library
- Peris-Lopez, P. J., Hernandez-Castro, C., Estevez-Tapiador, J. M. and Ribagorda, A. 2006. M2AP: A minimalist mutual-authentication protocol for low-cost RFID tags. In Proceedings of International Conference on Ubiquitous Intelligence and Computing (Wuhan, China, Sep 03--06, 2006). UIC 2006. Springer-Verlag, Berlin, Heidelberg, 4159, 2, 912--923. DOI= 10.1007/11833529_93 Google ScholarDigital Library
- Peris-Lopez, P., Hernandez-Castro, J. C., Estevez-Tapiador, J. M. and Ribagorda, A. 2007. Solving the simultaneous scanning problem anonymously: Clumping proofs for RFID tags. In Proceedings of International Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing (Istanbul, Turkey, Jul 19, 2007). SECPerU. IEEE, New Jersey, 55--60. DOI = 10.1109/SECPERU.2007.12Google Scholar
- Piramuthu, S. 2006. On existence proofs for multiple RFID tags. In Proceedings of ACS/IEEE International Conference on Pervasive Services (Lyon, France, Jun 26--29, 2006). PERSER'06, IEEE Computer Society Washington, DC, 317--320. DOI = 10.1109/PERSER.2006.1652252 Google ScholarDigital Library
- Saito, J. and Sakurai, K. 2005. Grouping proof for RFID tags. In Proceedings of IEEE International Conference on Advanced Information Networking and Applications (New Taipei, Taiwan, Mar 28--30, 2005). AINA 2005. IEEE, New Jersey, 2, 621--624. DOI= 10.1109/AINA.2005.197 Google ScholarDigital Library
- Sarma, S. E., Weis, S. A. and Engels, D. W. 2003. RFID systems and security and privacy implications. In revised papers from the International Workshop on Cryptographic Hardware and Embedded Systems (CA, USA, Aug 13--15, 2002). CHES 2002. Springer-Verlag, Berlin, Heidelberg, 454--469. DOI=10.1007/3-540-36400-5_3 Google ScholarDigital Library
- Song B. and Mitchell, C. J. 2008. RFID authentication protocol for low-cost tags. In Proceedings of ACM Conference on Wireless Network Security (Virginia, USA, Mar 31--April 02, 2008). WiSec'08. ACM, New York, NY, 140--147. Google ScholarDigital Library
- Sun, H., Ting, W. and Chang, S. 2009. Offlined simultaneous grouping proof for RFID tags. In Proceedings of International Symposium on Computer Science and its Applications (Hobart, Australia, Oct 13--15, 2009). CSA-08. FTRA, 1--6.Google Scholar
- Weis, S. A., Sarma, S. E., Rivest, R. L. and Engels. D. W. 2004. Security and privacy aspects of low-cost radio frequency identification systems. In revised papers from International Conference on Security in Pervasive Computing (Boppard, Germany, Mar 12--14, 2003). Springer-Verlag, Berlin, Heidelberg, 2802, 201--212.Google Scholar
- Ma, Cunqing., Lin, Jingqiang., Wang, Yuewu. and Shang, Ming. 2012. Offline RFID grouping proofs with trusted timestamp. In Proceedings of IEEE International Conference on Trust, Security and Privacy in Computing and Communications (Liverpool, England, Jun 25--27, 2012). TrustCom 2012. IEEE Computer Society, Washington, DC, 674--681. DOI=10.1109/TrustCom.2012.212 Google ScholarDigital Library
Index Terms
- An efficient offline grouping proof protocol using multiple types of tags
Recommendations
Improved yoking proof protocols for preserving anonymity
In emerging RFID applications, the yoking proof provides a method not only to ensure the physical proximity of multiple objects but also to verify that a pair of RFID tags has been scanned simultaneously by a reader. Previous studies have focused on ...
Anonymous Yoking-Group Proofs
ASIA CCS '15: Proceedings of the 10th ACM Symposium on Information, Computer and Communications SecurityYoking-proofs show an interesting application in Radio Frequency Identification (RFID) that a verifier can check whether two tags are simultaneously scanned by a reader. We consider a scenario that multi-group of tags can be proved to be scanned ...
A hidden mutual authentication protocol for low-cost RFID tags
Radio-frequency identification (RFID) technology enables the identification and tracking of objects by means of the wireless signals emitted by a tag attached to the objects of interest. Without adequate protection, however, malicious attackers can ...
Comments