Nan Li
ABSTRACT
Yoking-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 simultaneously. Grouping-proof, which is an extension of yoking-proofs, allows multiple tags to be proved together, while existing protocols cannot support multiple groups. In this paper, we introduce a novel concept called "yoking-group proofs". Additionally, we propose an anonymous yoking-proof protocol and an anonymous yoking-group proof protocol and prove their security in Universal Composability framework.
- L. Batina, Y. K. Lee, S. Seys, D. Singelée, and I. Verbauwhede. Privacy-preserving ecc-based grouping proofs for RFID. In ISC, LNCS, pages 159--165. Springer, 2010. Google Scholar
Digital Library
- L. Batina, Y. K. Lee, S. Seys, D. Singelée, and I. Verbauwhede. Extending ecc-based RFID authentication protocols to privacy-preserving multi-party grouping proofs. Personal and Ubiquitous Computing, 16(3):323--335, 2012. Google ScholarDigital Library
- L. Bolotnyy and G. Robins. Generalized "yoking-proofs" for a group of RFID tags. In MobiQuitous'05, pages 1--4.Google Scholar
- M. Burmester, B. de Medeiros, and R. Motta. Provably secure grouping-proofs for RFID tags. In CARDIS, volume 5189 of LNCS, pages 176--190, 2008. Google ScholarDigital Library
- M. Burmester and J. Munilla. Lightweight RFID authentication with forward and backward security. ACM Trans. Inf. Syst. Secur., 14(1):11, 2011. Google ScholarDigital Library
- M. Burmester and J. Munilla. Distributed group authentication for RFID supply management. IACR Cryptology ePrint Archive, 2013:779, 2013.Google Scholar
- R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In FOCS, pages 136--145. IEEE Computer Society, 2001. Google ScholarDigital Library
- H.-Y. Chien, C.-C. Yang, T.-C. Wu, and C.-F. Lee. Two RFID-based solutions to enhance inpatient medication safety. J. Medical Systems, 35(3):369--375, 2011. Google ScholarDigital Library
- D. N. Duc and K. Kim. Grouping-proof protocol for RFID tags: Security definition and scalable construction. IACR Cryptology ePrint Archive, 2009:609, 2009.Google Scholar
- J. Hermans and R. Peeters. Private yoking proofs: Attacks, models and new provable constructions. In RFIDSec, LNCS, pages 96--108. Springer, 2012. Google ScholarDigital Library
- H.-H. Huang and C.-Y. Ku. A RFID grouping proof protocol for medication safety of inpatient. J. Medical Systems, 33(6):467--474, 2009. Google ScholarDigital Library
- A. Juels. "yoking-proofs" for RFID tags. In PerCom Workshops, pages 138--143. IEEE Computer Society, 2004. Google ScholarDigital Library
- Y. K. Lee, L. Batina, D. Singelée, and I. Verbauwhede. Low-cost untraceable authentication protocols for RFID. In WISEC, pages 55--64. ACM, 2010. Google ScholarDigital Library
- Y. K. Lee, L. Batina, D. Singelée, and I. Verbauwhede. Wide-weak privacy-preserving RFID authentication protocols. In MOBILIGHT, volume 45 of LNCS, Social Informatics and Telecommunications Engineering, pages 254--267. Springer, 2010.Google ScholarCross Ref
- T. Li, G. Wang, and R. H. Deng. Security analysis on a family of ultra-lightweight RFID authentication protocols. JSW, 3(3):1--10, 2008.Google ScholarCross Ref
- Y. Lien, X. Leng, K. Mayes, and J. Chiu. Reading order independent grouping proof for RFID tags. In ISI 2008, pages 128--136. IEEE, 2008.Google Scholar
- H. Liu, H. Ning, Y. Zhang, D. He, Q. Xiong, and L. T. Yang. Grouping-proofs-based authentication protocol for distributed RFID systems. IEEE Trans. Parallel Distrib. Syst., 24(7):1321--1330, 2013. Google ScholarDigital Library
- P. Peris-Lopez, J. C. Hernandez-Castro, J. M. Estévez-Tapiador, and A. Ribagorda. Solving the simultaneous scanning problem anonymously: Clumping proofs for RFID tags. SECPerU, pages 55--60. IEEE Computer Society, 2007.Google ScholarCross Ref
- P. Peris-Lopez, A. Orfila, J. C. Hernandez-Castro, and J. C. A. van der Lubbe. Flaws on RFID grouping-proofs. Guidelines for future sound protocols. J. Network and Computer Applications, 34(3):833--845, 2011. Google ScholarDigital Library
- J. Saito and K. Sakurai. Grouping proof for RFID tags. In AINA, pages 621--624. IEEE Computer Society, 2005. Google ScholarDigital Library
- B. Song and C. J. Mitchell. RFID authentication protocol for low-cost tags. In WISEC'08, pages 140--147. ACM, 2008. Google ScholarDigital Library
Index Terms
- Anonymous Yoking-Group Proofs
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 ...
Privacy-Preserving Yoking Proof with Key Exchange in the Three-Party Setting
Yoking proof is a very useful security primitive that can be used to prove the co-existence of two or multiple entities in an identification protocol. It can be incorporated into radio frequency identification (RFID) protocols and used in many practical ...
(α, k)-anonymous data publishing
Privacy preservation is an important issue in the release of data for mining purposes. The k-anonymity model has been introduced for protecting individual identification. Recent studies show that a more sophisticated model is necessary to protect the ...
Comments