Enhanced Mobile Agent Scheme for RFID Privacy Protection 


Vol. 33,  No. 2, pp. 208-218, Feb.  2008


PDF
  Abstract

We are sure that RFID system should be a widely used automatic identification system because of its various advantages and applications. However, many people know that invasions of privacy in RFID system is still critical problem that makes it difficult to be used. Many works for solving this problem have focused on light-weight cryptographic functioning in the RFID tag. An agent scheme is another approach that an agent device controls communications between the tag and the reader for protecting privacy. Generally an agent device has strong security modules and enough capability to process high-level cryptographic protocols and can guarantees consumer privacy. In this paper, we present an enhanced mobile agent for RFID privacy protection. In enhanced MARP, we modified some phases of the original MARP to reduce the probability of successful eavesdropping and to reduce the number of tag's protocol participation. And back-end server can authenticate mobile agents more easily using public key cryptography in this scheme. It guarantees not only privacy protection but also preventing forgery.

  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]

S. Kim, S. Yeo, S. K. Kim, "Enhanced Mobile Agent Scheme for RFID Privacy Protection," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 2, pp. 208-218, 2008. DOI: .

[ACM Style]

Soo-Cheol Kim, Sang-Soo Yeo, and Sung Kwon Kim. 2008. Enhanced Mobile Agent Scheme for RFID Privacy Protection. The Journal of Korean Institute of Communications and Information Sciences, 33, 2, (2008), 208-218. DOI: .

[KICS Style]

Soo-Cheol Kim, Sang-Soo Yeo, Sung Kwon Kim, "Enhanced Mobile Agent Scheme for RFID Privacy Protection," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 2, pp. 208-218, 2. 2008.