short-paper

Anonymous Yoking-Group Proofs

Authors:

Vijay VaradharajanAuthors Info & Claims

ASIA CCS '15: Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security

Pages 615 - 620

https://doi.org/10.1145/2714576.2714609

Published: 14 April 2015 Publication History

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.

References

[1]

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.

Digital Library

[2]

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.

Digital Library

[3]

L. Bolotnyy and G. Robins. Generalized "yoking-proofs" for a group of RFID tags. In MobiQuitous'05, pages 1--4.

[4]

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.

Digital Library

[5]

M. Burmester and J. Munilla. Lightweight RFID authentication with forward and backward security. ACM Trans. Inf. Syst. Secur., 14(1):11, 2011.

Digital Library

[6]

M. Burmester and J. Munilla. Distributed group authentication for RFID supply management. IACR Cryptology ePrint Archive, 2013:779, 2013.

[7]

R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In FOCS, pages 136--145. IEEE Computer Society, 2001.

Digital Library

[8]

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.

Digital Library

[9]

D. N. Duc and K. Kim. Grouping-proof protocol for RFID tags: Security definition and scalable construction. IACR Cryptology ePrint Archive, 2009:609, 2009.

[10]

J. Hermans and R. Peeters. Private yoking proofs: Attacks, models and new provable constructions. In RFIDSec, LNCS, pages 96--108. Springer, 2012.

Digital Library

[11]

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.

Digital Library

[12]

A. Juels. "yoking-proofs" for RFID tags. In PerCom Workshops, pages 138--143. IEEE Computer Society, 2004.

Digital Library

[13]

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.

Digital Library

[14]

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.

[15]

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.

[16]

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.

[17]

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.

Digital Library

[18]

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.

[19]

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.

Digital Library

[20]

J. Saito and K. Sakurai. Grouping proof for RFID tags. In AINA, pages 621--624. IEEE Computer Society, 2005.

Digital Library

[21]

B. Song and C. J. Mitchell. RFID authentication protocol for low-cost tags. In WISEC'08, pages 140--147. ACM, 2008.

Digital Library

Cited By

Zhou ZLiu PLiu QWang G(2018)An Anonymous Offline RFID Grouping-Proof ProtocolFuture Internet10.3390/fi1001000210:1(2)Online publication date: 1-Jan-2018
https://doi.org/10.3390/fi10010002
Sun DXu G(2017)One-Round Provably Secure Yoking-Proof for RFID Applications2017 IEEE Trustcom/BigDataSE/ICESS10.1109/Trustcom/BigDataSE/ICESS.2017.253(315-322)Online publication date: Aug-2017
https://doi.org/10.1109/Trustcom/BigDataSE/ICESS.2017.253
Zhou ZLiu PLiu QWang G(2017)An ECC-Based Off-line Anonymous Grouping-Proof ProtocolSecurity, Privacy, and Anonymity in Computation, Communication, and Storage10.1007/978-3-319-72389-1_16(186-200)Online publication date: 7-Dec-2017
https://doi.org/10.1007/978-3-319-72389-1_16

Index Terms

Anonymous Yoking-Group Proofs
1. Security and privacy
  1. Security services
    1. Access control
    2. Authentication
  2. Systems security
    1. Operating systems security

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

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

ASIA CCS '15: Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security

April 2015

698 pages

ISBN:9781450332453

DOI:10.1145/2714576

General Chairs:
Feng Bao
Huawei Technologies Pte Ltd, Singapore
,
Steven Miller
Singapore Management University, Singapore
,
Program Chairs:
Jianying Zhou
Institute for Infocomm Research, Singapore
,
Gail-Joon Ahn
Arizona State University, USA

Copyright © 2015 ACM.

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

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 April 2015

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Short-paper

Funding Sources

Australian Research Council

Conference

ASIA CCS '15

Sponsor:

SIGSAC

ASIA CCS '15: 10th ACM Symposium on Information, Computer and Communications Security

April 14 - March 17, 2015

Singapore, Republic of Singapore

Acceptance Rates

ASIA CCS '15 Paper Acceptance Rate 48 of 269 submissions, 18%;

Overall Acceptance Rate 418 of 2,322 submissions, 18%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
185
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)1

Reflects downloads up to 09 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhou ZLiu PLiu QWang G(2018)An Anonymous Offline RFID Grouping-Proof ProtocolFuture Internet10.3390/fi1001000210:1(2)Online publication date: 1-Jan-2018
https://doi.org/10.3390/fi10010002
Sun DXu G(2017)One-Round Provably Secure Yoking-Proof for RFID Applications2017 IEEE Trustcom/BigDataSE/ICESS10.1109/Trustcom/BigDataSE/ICESS.2017.253(315-322)Online publication date: Aug-2017
https://doi.org/10.1109/Trustcom/BigDataSE/ICESS.2017.253
Zhou ZLiu PLiu QWang G(2017)An ECC-Based Off-line Anonymous Grouping-Proof ProtocolSecurity, Privacy, and Anonymity in Computation, Communication, and Storage10.1007/978-3-319-72389-1_16(186-200)Online publication date: 7-Dec-2017
https://doi.org/10.1007/978-3-319-72389-1_16

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents