• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.5
• /
• pp.83-94
• /
• 2011

Yoking proof is a concept proposed by A. Juels in 2004. It proves that a pair of tags are scanned simultaneously by one reader. After the first yoking proof protocol is proposed by A. Juels, replay attack vulnerabilities of yoking proof are considered and many other yoking proof schemes are proposed to improve it. However, compared with the first yoking proof scheme which emphasizes protocol efficiency due to the limited performance of tags, other yoking proof protocols need more computing power and storage of the tags. We propose two security protocols that consider both the general condition and limited performance of tags. The proposed scheme can protect the tags from replay attack and Brute-force attack as well. Moreover, many pairs of tags or several tag groups can be proved at the same time by executing the protocol only once.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3B
• /
• pp.462-473
• /
• 2010

The RFID system has the security problem of location tracking and user privacy. In order to solve this problem, the cryptographic access method using hash function is difficult to in real applications. Because there is a limit of computing and storage capacity of Tag, but the safety is proved. The lightweight authentication methods like HB and LMAP guarantee the high efficiency, but the safety is not enough to use. In this paper, we use the AES for RFID Authentication, and solve the problem of using fixed key with key change step by step. The symmetric keys of the tag and server are changed by the random number generated by tag, reader and server successively. This could prevent the key exposure. As a result, the output of the tag and reader always changes. These key changes could make it possible to prevent eavesdropping, replay attack, location tracking and spoofing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.8B
• /
• pp.1028-1037
• /
• 2011

Recently, Selim et al proposed public key cryptography based privacy preserving multi-context RFID authentication protocol. However Selim et al's proposed protocol not only doesn't fit into passive tag based RFID system because it uses public key based encryption algorithm to perform authentication between reader and tag, but also is insecure to an impersonation attack because it doesn't provide mutual authentication. In order to eliminate the above described efficiency problem and security vulnerabilities, this paper proposes a new multi-context RFID mutual authentication protocol that can prevent privacy invasion and tag impersonation attack through providing mutual authentication between single passive tag which is located different application space and readers which provide multi-context purposes and can secure against relay attack and denial-of-service attack. As a result, the proposed protocol performs secure mutual authentication based on the collected space and time information from the RFID reader and provides strong security and high computation efficiency because if performs secure one-way hash function and symmetric encryption operations suitable to the environments of passive RFID tags.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.4
• /
• pp.149-157
• /
• 2011

Passive tags are inferior to active tags in processing efficiency, so they have difficulty in largevolume processing. The proposed protocol reduces the volume of computation in passive tags and, at the same time, improves authentication for enhanced safety and security. That is, different from existing RFID protocols that return the same value even if an error happens when the reader reads a tag, the improved RFID security protocol returns a new value using a re-counter and processes the computation part of a tag in the reader or in a back.end system. Even if the information of a tag is acquired by an malicious way, it is not actual information but encrypted information that is not usable. In addition, even if tag information is read in sequence, it is changed in each read, so the protocol is safe from Location Tracking.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.10
• /
• pp.71-80
• /
• 2013

In this paper, we analyze the security vulnerability through the several attack scenarios for the MCR-MAP(Multi-Context RFID Mutual Authentication Protocol) proposed by Ahn et al. And we propose the secure mutual authentication protocol that improved a prior MCR-MAP. The suggested protocol uses the ID of the legal tag and the timestamp generated by the server, when the tag tries to authenticate. And when the tag creates the credential, we create the new secret key computing the XOR operation between the secret key shared with the server and the tag timestamp generated by the server. As a result, the proposed protocol provides the secure mutual authentication and then is safe to spoofing attack. Also it provides forward-secrecy and then is safe to offline brute-burst attack. In this paper, we compare and verify the security vulnerability of the prior and the proposed protocol through the security analysis.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.4
• /
• pp.89-108
• /
• 2010

Recently many mutual authentication protocol for light-weight hash-based for RFID have been proposed. Most of them have assumed that communications between a backend server and reader are secure, and not considered threats for backend server and RFID reader impersonation. In the real world, however, attacks against database or reader are more effective rather than attacks against RFID tag, at least from attacker's perspective. In this paper, we assume that all communications are not secure to attackers except the physical attack, and considering realistic threats for designing a mutual authentication protocol based on hash function. And It supports a mutual authentication and can protect against the replay attack, impersonation attack, location tracking attack, and denial of service attack in the related work. We besides provide a secure and efficient RFID mutual authentication protocol which resists impersonation attacks on all of the entities and alow a backend server to search tag-related information efficiently. We conclude with analyzing the safety and efficiency among latest works.

• The KIPS Transactions:PartC
• /
• v.13C no.5 s.108
• /
• pp.595-600
• /
• 2006

Nowadays, low-cost radio frequency identification (RFID) technique, is recognizable without the physical contact between the reader and the tag, has been attracting more and more interests from both industry and academic institutes. however, it causes the serious privacy infringement such as excessive information exposure and user's location information tracking due to the wireless characteristics. The security problem of read only tag can be only solved by physical method. In this paper, we propose a low-cost authentication protocol which can be adopted for read-only RFID tag using XOR and Partial ID. The proposed protocol is secure against reply attacking, eavesdropping and spoofing attacking so that avoiding the location privacy exposure

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1421-1424
• /
• 2009

RFID(Radio-Frequency IDentification) 시스템은 무선주파수를 이용한 자동 인식 기술로 개인의 위치 추적이나 사용자 프라이버시와 같은 정보 유출의 위험성을 내포하고 있다. 이러한 문제점을 해결하기 위해 대칭키 기반의 AES 암호화 알고리즘은 해시함수나 공개키 암호화 기법에 비해 메모리를 적게 소모하고 구현이 쉬운 장점 때문에 수동형 RFID태그에 더 적합하다. 그러나 기존의 AES를 이용한 RFID 인증 프로토콜에서는 항상 고정된 키를 이용하여 암호화하였고 태그와 리더사이의 안전하지 않은 무선 채널에서 공격자에 의해 키 값이 노출될 수 있는 또 다른 문제점을 가지고 있다. 본 논문에서는 태그와 서버의 고정된 키와, 리더 태그 서버에서 생성된 난수를 차례로 이용하여 대칭키를 변환한다. 그리고 매 세션마다 변환된 키로 난수를 암호화 하면서 태그와 리더를 상호 인증한다. 이와 같이 변환된 키를 이용할 경우 키 값의 노출 문제가 해결되며, 이 키를 통해 암호화하여 인증할 경우 재전송, 도청, 위치추적 및 스푸핑과 같은 공격에도 안전하다.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2007.05a
• /
• pp.239-245
• /
• 2007

차세대 유비쿼터스 환경에서 중요한 기술적, 산업적 위치를 차지하는 RFID 네트워크에는 다수의 RFID 리더(Reader)와 수많은 RFID 태그(Tag)들이 통신을 하면서 존재하게 된다. 이러한 RFID 네트워크에서 리더와 태그간의 원활한 통신을 위해서는 주파수 충돌이 발생하지 않아야 한다. 주파수 충돌 현상은 리더와 다수의 태그들 간의 태그 충돌(Tag Collision)과 리더간 주파수 간섭으로 인한 리더간 충돌(Reader Collision)로 나뉘어 질 수 있다. 따라서 리더간 충돌 현상을 피하기 위해서는 근접한 리더들 간에 서로 다른 타임슬롯(Timeslot)을 사용하여 태그와 통신을 시도하여야 한다. 본 연구에서는 RFID 네트워크에서 다수의 리더간 충돌을 최소화하며 안전한 태그 인식을 할 수 있도록 타임 슬롯 할당 문제를 CSP(Constraint Satisfaction Problem)로 접근한다. 그리고 CSP를 풀기 위해 리더간 충돌 문제가 가지고 있는 제약조건을 찾아내고 해를 찾기 위한 목적함수를 모델링 한다.

• Review of KIISC
• /
• v.15 no.4
• /
• pp.72-79
• /
• 2005

지금까지 개발된 암호원천기술들이 RFID 태그와 같은 매우 제한된 환경에 맞춰 개발된 사례는 찾기 힘들다. 물론 기존 암호원천기술들이 지향해 온 방향이 초고속화 등에 집중되어 있어, 작은 구현 면적이나 낮은 전력 소비에 맞춰 구현된 시도가 있을 수 있으나, 아직까지는 기존의 알려진 암호원천기술을 RFID 태그와 같은 환경에 적용하기는 어렵다고 보여 진다. 그러므로 현재 활용할 수 있는 태그에 탑재 가능한, 기존 암호원천기술들의 안전성을 유지하며, 경량화 되고 저전력을 소비하는 암호원천기술의 개발이 절실히 필요하다. 이를 위한 사전 단계로 본 논문에서는 상업성을 고려한 RFID 태그의 환경에서 보안을 위해 허용되는 구현 면적, 전력 소비량 등과 암호원천기술이 태그에 사용되기 위해 고려되어야 하는 사항들을 도출한다.