• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.3
• /
• pp.405-415
• /
• 2012

In many applications a reader needs to determine whether a particular tag exists within a group of tags without a server. This is referred to as serverless RFID tag searching. A few protocols for the serverless RFID searching are proposed but they are the single tag search protocol which can search a tag at one time. In this paper, we propose a multi-tag search protocol based on a hash function and a random number generator which can search some tags at one time. For this study, we introduce a protocol which can resolve the problem of synchronization of seeds when communication error occurs in the S3PR protocol[1], and propose a multi-tag search protocol which can reduce the communication overhead. The proposed protocol is secure against tracking attack, impersonation attack, replay attack and denial-of-service attack. This study will be the basis of research for multi-tag serach protocol.

• The KIPS Transactions:PartC
• /
• v.16C no.3
• /
• pp.347-356
• /
• 2009

In an RFID search protocol, a reader uses designated query to determine whether a specific tag is in the vicinity of the reader. This fundamental difference makes search protocol more vulnerable to replay attacks than authentication protocols. Due to this, techniques used in existing RFID authentication protocols may not be suitable for RFID search protocols. In this paper, we propose two RFID search protocols, one based on static ID and the other based on dynamic ID, which use counter to prevent replay attacks. Moreover, we propose a security model for RFID search protocols that includes forward/backward traceability, de-synchronization and forgery attack. Based on this model, we analyze security of our protocols and related works.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.5
• /
• pp.125-134
• /
• 2008

A great number of RFID authentication protocols have been proposed for the secure RFID system. These are typically divided into three types according to primitive that they use : Hash-based, Re-encryption based, and XORing-based protocol. The well-known attacks in RFID system are eavesdropping. impersonating, location tracking, and so on. However, existing protocols could not provide security against above attacks, or it was not efficient to search for tags on database. Therefore, in this paper we present a protocol which is secure against above attacks by using hash function and makes Database search tags easily by attaining the state information of previous session through the shared values with all tags and database.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.1
• /
• pp.143-151
• /
• 2011

When a real-time data transfer is not possible between a reader and a back-end server in the mobile environment, the reader should support a capability to search a certain tag without communicating with a back-end server. Some recent papers related to the mobile reader-based tag search protocol have addressed privacy concerns for the reader and the tags. However, to our best knowledge, there are no papers addressing the problem arising from reusing tag lists existed in the mobile reader. In other words, there arise a problem that a mobile reader which has lost an right to access to a specific tag is able to search that tag by reusing a tag list for searching a particular tag. If mobile reader having an unauthorized tag list, the mobile reader can reuse a particular tag list. Our protocol provides the enhanced secure tag lists preventing the reuse of the tag lists and an efficient tag search protocol based on dynamic identity in the mobile reader-based RFID environments.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.2
• /
• pp.73-90
• /
• 2010

Recently, Tan et al. introduced a serverless search protocol in which a mobile reader maintains a tag authentication list and authenticates a tag using the list without connecting authentication server. A serverless RFID system is different from general RFID systems which use on-line server models. In the serverless RFID system, since the mobility of a personalized reader must be considered, we have to protect not only the privacy of a tag but also the privacy of a mobile reader. In this paper, we define new security requirements for serverless RFID search system and propose a secure serverless RFID search system. In our system, since tag authentication information maintained by a reader is updated in every session, we can provide the backward untraceability of a mobile reader. Also we use an encrypted timestamp to block a replay attack which is major weakness of search protocols. In addition, we define a new adversary model to analyze a serverless RFID search system and prove the security of our proposed system using the model.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.10
• /
• pp.121-128
• /
• 2010

In this paper, we proposed a new secure RFID(Radio Frequency IDentification) mutual authentication protocol on insecure communication channel which assumed that all communication channels between the database, the reader and the tag are insecure communication channels. The proposed protocol used a secure one-way hash function and the goal is to improve search time of a tag ID and overload of hash calculational load in DB. In addition, the proposed protocol supports not only basic security requirements to be provided by RFID mutual authentication protocol but also forward secrecy, and the tag does not generate a random number to reduce overload of processing capacity in it.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.5
• /
• pp.59-69
• /
• 2009

RFID tag search system which is used to find a specific tag has an application such as asset management, supply chain, and this search scheme has been given much attention so far. In RFID tag search system, especially, mobility of the reader is important in order to search tags. Therefore, even though the handheld reader cannot connect with the central database because of unreliable wireless connection or remote location, handheld reader should search the specific tag without help of the central database. In addition, in RFID tag search system, users hold not the tag but the reader, the privacy of users should be considered. Since the signal strength of the reader is stronger than that of the tag, the privacy of the reader holder is very important. Recently, in order to solve these problems, a number of RFID tag search schemes have been proposed. However, since these schemes did not consider the privacy of reader holders, there are serious privacy breaches of reader holders. In this paper, we propose efficient RFID tag search protocol for passive tags. Our proposed scheme preserves the privacy of reader holders.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6B
• /
• pp.585-594
• /
• 2009

Efficient filtering is an important factor in RFID system performance. Because of huge volume of tag data in future ubiquitous environment, if RFID readers transmit tag data without filtering to upper-layer applications, which results in a significant system performance degradation. In this paper, we provide an efficient filtering technique which operates on RFID air protocol. RFID air protocol filtering between tags and a reader has some advantages over filtering in readers and middleware, because air protocol filtering reduces the volume of filtering work before readers and middleware start filtering. Exploiting the air protocol filtering advantage, we introduce a geometrical algorithm for generating air protocol filters and verify their performance through simulation with analytical time models. Results of dense RFID reader environment show that air protocol filtering algorithms reduce almost a half of the total filtering time when compared to the results of linear search.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.1
• /
• pp.77-87
• /
• 2008

Recently, many hash-based authentication protocols were presented to guarantee mutual authentication between tag and DB in RFID system. To be suitable for distributed DB environment, one generally uses fixed constant value as a tag ID. However, some existing protocols have security flaws or heavy computational loads in DB in order to search a tag ID. We propose a secure authentication protocol which is suitable for distributed DB environment by using unchangeable tag ID. The storage method of pre-synchronized information in DB at previous session is core idea of our proposal which gives low-cost ID search of DB at next session. In normal synchronization state, our protocol only requires 3 hash operations in tag and DB respectively.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.9
• /
• pp.109-117
• /
• 2010

Recently, study on RFID Tag Searching technique which is used to find a specific tag in particular tag group were developed continuously. RFID tag searching technique can be applicate in various fields such as product management, finding children, and electronic anklet. To implement a RFID tag search system, RFID tag searching protocol should be considered various security threats such as reader and tag tracking, privacy, etc. For implementing a safe RFID tag lookup system, it is important to consider the potential security threats such as the tag tracking problem, and the privacy of the owner of the tag reader problem. There exists an RFID tag lookup system that satisfies a few security requirements, but the privacy of the owner of the tag reader problem has still been left unsolved, and even if it were solved, it requires a considerable amount of cryptographic operations to be performed which results in a decrease in performance. This paper proposes a system that does not degrade the performance while solving the privacy of the owner of the tag reader problem.