Strong Yoking Proof Protocols for RFID Tags 


Vol. 32,  No. 3, pp. 310-318, Mar.  2007


PDF
  Abstract

The RFID system is a non-contact automatic identification system that identifies tags through a reading device by attaching small, inexpensive tags on goods. This system is expected to supplant barcodes, the contactless reading technique that is most widely used at present. The RFID system can be applied in a variety of areas. Among those, Ari Juels proposed an environment to prove that a pair of tags has been scanned simultaneously. And he presented a yoking proof protocol for this. But the yoking-proof protocol is vulnerable to replay attack. Although modified yoking-proof protocols for alleviating this drawback have been proposed, they are not immune to replay attack, either. In this paper, we analyze problems of existing yoking-proof protocols and present a new protocol, which will make replay attack difficult, based on this analysis. We have also extend this protocol so that it can provide yoking proofs for n tags.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Cho, S. Yeo, S. Kim, "Strong Yoking Proof Protocols for RFID Tags," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 3, pp. 310-318, 2007. DOI: .

[ACM Style]

Jung-Sik Cho, Sang-Soo Yeo, and Sung-Kwon Kim. 2007. Strong Yoking Proof Protocols for RFID Tags. The Journal of Korean Institute of Communications and Information Sciences, 32, 3, (2007), 310-318. DOI: .

[KICS Style]

Jung-Sik Cho, Sang-Soo Yeo, Sung-Kwon Kim, "Strong Yoking Proof Protocols for RFID Tags," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 3, pp. 310-318, 3. 2007.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880