Enhanced Yoking Proof Protocols for RFID Tags and Tag Groups

Cho, Jung-Sik; Yeo, Sang-Soo; Hwang, Suchul; Rhee, Sang-Yong; Kim, Sung Kwon

doi:10.1109/waina.2008.204

Cited by 31 publications

(20 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, the right side of Equation (18) can be simplified to x(T n )k t 1 P · x(T n ) −1 = k t 1 P. Therefore, the Equation (18) is proved.…”

Section: Proof Of the Correctness About Reader Verifymentioning

confidence: 94%

“…framework [23]. Cho et al [18] described a grouping-proof protocol resisted replay attack. In [24], the authors used the code scheme to check the tag information and improve the protocol security.…”

Section: Related Workmentioning

confidence: 99%

“…In this vein, the verifier in offline mode does not need to communicate with any specific tag (via the reader), it only needs the connection before and after the generation of grouping-proof. The connection requirement is more flexible during the protocol, however, there are many security problems need to be solved in this mode, which has become the research focus in many works proposed in the state of the art [3,4,[11][12][13][14][15][16][17][18]. Figure 1 shows a common offline mode of RFID grouping-proof system.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An Anonymous Offline RFID Grouping-Proof Protocol

Zhou

Liu

et al. 2018

Future Internet

View full text Add to dashboard Cite

Abstract:As more and more items are tagged with RFID (Radio Frequency Identification) tags, grouping-proof technology is widely utilized to provide a coexistence evidence for a group of related items. Due to the wireless channel used in RFID systems, a security risk exists in the communication between the reader and tags. How to ensure the tag's information security and to generate reliable grouping-proof becomes a hot research topic. To protect the privacy of tags, the verification of grouping-proof is traditionally executed by the verifier, and the reader is only used to collect the proof data. This approach can cause the reader to submit invalid proof data to the verifier in the event of DoP (Deny of Proof) attack. In this paper, an ECC-based, off-line anonymous grouping-proof protocol (EAGP) is proposed. The protocol authorizes the reader to examine the validity of grouping-proof without knowing the identities of tags. From the security and performance analysis, the EAGP can protect the security and privacy of RFID tags, and defence impersonation and replay attacks. Furthermore, it has the ability to reduce the system overhead caused by the invalid submission of grouping-proofs. As a result, the proposed EAGP equips practical application values.

show abstract

“…Then, the right side of Equation (18) can be simplified to x(T n )k t 1 P · x(T n ) −1 = k t 1 P. Therefore, the Equation (18) is proved.…”

Section: Proof Of the Correctness About Reader Verifymentioning

confidence: 94%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Anonymous Offline RFID Grouping-Proof Protocol

Zhou

Liu

et al. 2018

Future Internet

View full text Add to dashboard Cite

show abstract

“…A c c e p t e d m a n u s c r i p t Cho et al (2008) proposed a variant of Piramithu's protocol to make it immune to brute force attacks. However, it turns out to be vulnerable to multi-proof session replay attacks.…”

Section: Related Workmentioning

confidence: 99%

Flaws on RFID grouping-proofs. Guidelines for future sound protocols

Peris-López

Orfila

Hernández-Castro³

et al. 2011

Journal of Network and Computer Applications

View full text Add to dashboard Cite

During the last years many RFID authentication protocols have been proposed with major or minor success (van Deursen and Radomirović (2008)). Juels (2004) introduced a different and novel problem that aims to evidence that two tags have been simultaneously scanned. He called this kind of evidence a yoking-proof that is supposed to be verifiable offline. Then, some authors suggested the generalization of the proof for a larger number of tags. In this paper, we review the literature published in this research topic and show the security flaws of the proposed protocols, named RFID groupingproofs generally. More precisely, we cryptanalyze five of the most recent schemes and we also show how our techniques can be applied to older proposals. We provide some guidelines that should be followed to design secure protocols and preclude past errors. Finally, we present a yoking-proof for low-cost RFID tags, named Kazahaya, that conforms to the proposed guidelines. Keywords:RFID; Grouping-proof; Security; Privacy, Cryptanalysis * Corresponding author Email addresses: P.PerisLopez@tudelft.nl (Pedro Peris-Lopez), Preprint submitted to Journal of Network and Computer Applications March 25, 2010A c c e p t e d m a n u s c r i p t

show abstract

“…Later, Peris-Lopez, Orfila, HernandezCastro and Lubbe [17] showed that the protocol is vulnerable to impersonation attacks. Some other protocols based on symmetric-key cryptography were proposed in [15,7,6,11,5]. However they all suffer impersonation attacks and/or anonymity attacks as illustrated in [17].…”

Section: Introductionmentioning

confidence: 99%

An efficient and provably secure RFID grouping proof protocol

Cheng

Varadharajan

et al. 2017

Proceedings of the Australasian Computer Science Week Multiconference

View full text Add to dashboard Cite

RFID Grouping proof convinces an offline verifier that multiple tags are simultaneously scanned. Various solutions have been proposed but most of them have security and privacy vulnerabilities. In this paper, we propose an elliptic-curve-based RFID grouping proof protocol. Our protocol is proven secure and narrowstrong private. We also demonstrate that our grouping proof can be batch verified to improve the efficiency for large-scale RFID systems and it is suitable for low-cost RFID tags. In this paper, we propose an elliptic-curvebased RFID grouping proof protocol. Our protocol is proven secure and narrow-strong private. We also demonstrate that our grouping proof can be batch verified to improve the efficiency for large-scale RFID systems and it is suitable for low-cost RFID tags.

show abstract

Enhanced Yoking Proof Protocols for RFID Tags and Tag Groups

Cited by 31 publications

References 5 publications

An Anonymous Offline RFID Grouping-Proof Protocol

An Anonymous Offline RFID Grouping-Proof Protocol

Flaws on RFID grouping-proofs. Guidelines for future sound protocols

An efficient and provably secure RFID grouping proof protocol

Contact Info

Product

Resources

About