Backward Channel Protection Method For RFID Tag Security in the Randomized Tree Walking Algorithm 


Vol. 30,  No. 5, pp. 415-421, May  2005


PDF
  Abstract

Passive RFID tag does not have its own power, so it has very poor computation abilities and it can deliver signals in very short range. From the facts, most RFID Tag security schemes assumed that the backward channel from tags to a reader is safe from eavesdropping. However, eavesdroppers near a tag can overhear message from a tag illegally. In this paper, we propose a method to protect the backward channel from eavesdropping by illegal readers. The proposed scheme can overcome the problems of conventional schemes such as randomized tree walking, which have been proposed to secure tag information in tree-walking algorithm as an anti-collision scheme for RFID tags. We showed the efficiency of our proposed method by using an analytical model, and it is also shown that the proposed method can provide the probability of eavesdropping in some standardized RFID tag system such as EPCglobal, ISO, uCode near to ‘0’.

  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]

W. Choi, B. Roh, S. Yoo, Y. C. Oh, "Backward Channel Protection Method For RFID Tag Security in the Randomized Tree Walking Algorithm," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 5, pp. 415-421, 2005. DOI: .

[ACM Style]

Wonjoon Choi, Byeong-hee Roh, S.W. Yoo, and Young Cheol Oh. 2005. Backward Channel Protection Method For RFID Tag Security in the Randomized Tree Walking Algorithm. The Journal of Korean Institute of Communications and Information Sciences, 30, 5, (2005), 415-421. DOI: .

[KICS Style]

Wonjoon Choi, Byeong-hee Roh, S.W. Yoo, Young Cheol Oh, "Backward Channel Protection Method For RFID Tag Security in the Randomized Tree Walking Algorithm," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 5, pp. 415-421, 5. 2005.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880