• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.11
• /
• pp.25-32
• /
• 2007

In this paper, we propose the Group Separation Algorithm for RFID Tag Anti-Collision. We study the RFID Tag anti-collision technique of ALOHA and the anti-collision algorithm of binary search. The existing technique is several problems; the transmitted data rate included of data, the recognition time and energy efficiency. For distinction of all tags, the Group Separation algorithm identify each Tag_ID bit#s sum of bit #1#. In other words, Group Separation algorithm had standard of selection by collision table, the algorithm can reduce unnecessary number of search even than the exisiting algorithm. The Group Separation algorithm had performance test that criterions were reader#s number of repetition and number of transmitted bits for understanding tag. We showed the good performance of Group Separation algorithm better than exisiting algorithm.

• The Journal of the Korea Contents Association
• /
• v.19 no.9
• /
• pp.637-645
• /
• 2019

The RFID group proof is an extension of the yoking proof proving that multiple tags are scanned by a reader simultaneously. Existing group proof schemes provide only delayed tag loss detection which detects loss of tag response in a verification phase. However, delayed tag loss detection is not suitable for real-time applications where tag loss must be detected immediately. In this study, I propose a tag response loss detection scheme which detects loss of tag response in the proof generation process quickly. In the proposed scheme, the tag responds with the sequence number assigned to the tag group, and the reader detects the loss of the tag response through the sequence number. Through an experiment for indistinguishability, I show that the sequence number is secure against an analyzing message attack to distinguish between specific tags and tag groups. In terms of efficiency, the proposed scheme requires fewer transmissions and database operations than existing techniques to determine which tags response is lost.

• 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.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.29-30
• /
• 2007

In this paper, we propose Group Separation(GS) algorithm for RFID tag recognition. In GS algorithm, reader calculates tag ID by collision point, stores memory with the collision table. And reader classifies according to total number of tag ID's 1, requests each group. If tag comes into collision with the other tag, reader searches tag ID in collision table. As a result, we observes that transmitted data rate, the recognition time is decreased.

• The Journal of the Korea Contents Association
• /
• v.9 no.9
• /
• pp.9-17
• /
• 2009

RFID (Radio Frequency Identification) is a next generation technology that will replace barcode. RFID can identify an object by reading ID inside a RFID tag using radio frequency. However, because a RFID tag replies its unique ID to the request of any reader through wireless communication, it is vulnerable to attacks on security or privacy through wiretapping or an illegal reader's request. The RFID authentication protocol has been studied actively in order to solve security and privacy problems, and is used also in tag search. Recently, as the number of tags is increasing in RFTD systems and the cost of data collection is also rising, the importance of effective tag search is increasing. This study proposed an efficient search method that solved through ta9 group the problem of large volume of database computation in Miyako Ohkubo's hash chain mechanism, which meets requirements for security and privacy protection. When we searched first the group of tags with access rate of 5 or higher in a database with 100,000 records, search time decreased by around 30%.

• Journal of KIISE:Information Networking
• /
• v.36 no.4
• /
• pp.275-285
• /
• 2009

RFID technology using the smart tag technology as a part of the sensor network is currently in the spotlight. But there are still many problems in applying the technology in a ubiquitous environment, induding at the point when anybody can read the tag information and the authentication between the tag and the reader, and security problems in very low-cost smart tag implementation. The proposed scheme is designed to enhance security and efficiency related to various services required in RF networks, based on the reliable peripheral devices for users of passive RFID tag. Using passive RFID tag, which has been applied to authentication transactions in existing papers, this study also proposed an appropriate management scheme that is suitable for a dynamic environment and setting a temporary group to provide various services. also proposed scheme is support RFID grouping, temporary group of service and security servicce, improved efficiency of communication.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1B
• /
• pp.62-67
• /
• 2010

Our research group has investigated that RFID tag packaging development and RFID tag flip chip bonding method influences on the industry-environmental customized RFID tag development that has applications to various industry environmental conditions. RFID tag flip chip bonding is consisting with wire bonding, ultrasonic bonding, heat plate bonding, and laser bonding and those methods are also depending on the different RFID tag development. Our research data shows that, among the various industrial environments such as an extremely high temperature, cryogenic, high-humidity, flexible, high-durable, development of RFID tag in an extremely high temperature is inappropriate for laser bonding method, converting of heat energy as absorbing light energy or heat plate bonding method of straight heat transferring manner, on the other hand, is suitable for wire bonding method which directly connect bump to pattern using wire.

• Journal of electromagnetic engineering and science
• /
• v.13 no.4
• /
• pp.208-213
• /
• 2013

This paper proposes a tag antenna for radio frequency identification (RFID) food system. The RFID tag antenna is designed and fabricated based on the rectangular loop concept used in the UHF band (Korean and Japanese standards, 916.7-923.5MHz). The proposed tag antenna is composed of a radiation patch, sensor tag chip, temperature sensor, oscillator, and battery. We conjugated matching between the tag antenna and the sensor tag using a U-shaped stub. Details of the proposed tag antenna design and the simulated and measured results are presented and discussed.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.2
• /
• pp.81-94
• /
• 2006

This study, in particular, aims to regulate the core techniques of ubiquitous computing, such as the use of an ad hoc network and the smart-tag technique, and to look more closely into RFID Tag's smart-tag-related security service. The study aims to do so because several important technical factors and structures must be taken into account for RFID Tag to be applied in the ubiquitous-computing-related infrastructure, and the security of the tag is considered one of the core technologies. To realize secure ubiquitous computing in the case of the Passive-tag-Performing RF communication, a less costly security service, the technical items needed to carry this out, a security service to be applied to passive tags, and network management techniques are required. Therefore, the passive-tag-based networks as the authentication level is established based on the secure authentication of each tag and the service that the tag delivers in the passive-tag-based networks and as the same service and authentication levels are applied, and the active-tag-based network system proposed herein is not merely a security service against illegal RFID tags by performing a current-location and service registration process after the secure authentication process of the active RFID tag, but is also a secure protocol for single and group services, is proposed in this study.

• 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.