• Title/Summary/Keyword: Tag Authentication

Search Result 157, Processing Time 0.022 seconds

Efficient Mutual Authentication Protocol Suitable to Passive RFID System (수동형 RFID 시스템에 적합한 효율적인 상호 인증 프로토콜 설계)

  • Won, Tae-Youn;Chun, Ji-Young;Park, Choon-Sik;Lee, Dong-Hoon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.6A
    • /
    • pp.63-73
    • /
    • 2008
  • RFID(Radio Frequency IDentification) system is an automated identification system that basically consists of tags and readers and Back-End-Databases. Tags and Readers communicate with each other by RF signal. As a reader can identify many tags in contactless manner using RF signal, RFID system is expected to do a new technology to replace a bar-code system in supply-chain management and payment system and access control and medical record and so on. However, RFID system creates new threats to the security of systems and privacy of individuals, Because tags and readers communicate with each other in insecure channel using RF signal. So many people are trying to study various manners to solve these problems against attacks, But they are difficult to apply to RFID system based on EPCglobal UHF Class-1 Generation-2 tags. Recently, Chien and Chen proposed a mutual Authentication protocol for RFID conforming to EPCglobal UHF Class-1 Generation-2 tags. we discover vulnerabilities of security and inefficiency about their protocol. Therefore, We analyze vulnerabilities of their protocol and propose an efficient mutual authentication protocol that improves security and efficiency.

A Light-Weight RFID Distance Bounding Protocol (경량 RFID 경계 결정 프로토콜)

  • Ahn, Hae-Soon;Bu, Ki-Dong;Yoon, Eun-Jun;Nam, In-Gil
    • The KIPS Transactions:PartC
    • /
    • v.17C no.4
    • /
    • pp.307-314
    • /
    • 2010
  • Recently, it is proved that contactless smart-card based RFID tags, which is used for proximity authentication, are vulnerable to relay attacks with various location-based attacks such as distance fraud, mafia fraud and terrorist fraud attacks. Moreover, distance bounding protocols have been researched to prevent these relay attacks that can measure the message transmitted round-trip time between the reader and the tag. In 2005, Hancke and Kuhn first proposed an RFID distance bounding protocol based on secure hash function. However, the Hancke-Kuhn protocol cannot completely prevent the relay attacks because an adversary has (3/4)$^n$ attack success probability. Thus, this paper proposes a new distance-bounding protocol for light-weight RFID systems that can reduce to (5/8)$^n$ for the adversary's attack success probability. As a result, the proposed protocol not only can provide high-space efficient based on a secure hash function and XOR operation, but also can provide strong security against the relay attacks because the adversary's attack success probability is optimized to (5/8)$^n$.

Security Authentication Technique using Hash Code in Wireless RFID Environments (무선 RFID 환경에서 해시코드를 이용한 EPC 코드 보안)

  • Lee, Cheol-Seung
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.14 no.6
    • /
    • pp.1077-1082
    • /
    • 2019
  • The development of computing technology and networking has developed into a fundamental technology of the Fourth Industrial Revolution, which provides a ubiquitous environment. In the ubiquitous environment, the IoT environment has become an issue so that various devices and the things can be actively accessed and connected. Also, the RFID system using the wireless identification code attaches an RFID tag to the object, such as the production and distribution of products. It is applied to the management very efficiently. EPCglobal is conducting a research on RFID system standardization and various security studies. Since RFID systems use wireless environment technology, there are more security threats than wire problems. In particular, failure to provide confidentiality, indistinguishability, and forward safety could expose them to various threats in the Fourth Industrial Revolution. Therefore, this study analyzes the standard method of EPCgolbal and proposes RFID security method using hash code that can consider the amount of computation.

Development of Reproducible EST-derived SSR Markers and Assessment of Genetic Diversity in Panax ginseng Cultivars and Related Species

  • Choi, Hong-Il;Kim, Nam-Hoon;Kim, Jun-Ha;Choi, Beom-Soon;Ahn, In-Ok;Lee, Joon-Soo;Yang, Tae-Jin
    • Journal of Ginseng Research
    • /
    • v.35 no.4
    • /
    • pp.399-412
    • /
    • 2011
  • Little is known about the genetics or genomics of Panax ginseng. In this study, we developed 70 expressed sequence tagderived polymorphic simple sequence repeat markers by trials of 140 primer pairs. All of the 70 markers showed reproducible polymorphism among four Panax species and 19 of them were polymorphic in six P. ginseng cultivars. These markers segregated 1:2:1 manner of Mendelian inheritance in an $F_2$ population of a cross between two P. ginseng cultivars, 'Yunpoong' and 'Chunpoong', indicating that these are reproducible and inheritable mappable markers. A phylogenetic analysis using the genotype data showed three distinctive groups: a P. ginseng-P. japonicus clade, P. notoginseng and P. quinquefolius, with similarity coefficients of 0.70. P. japonicus was intermingled with P. ginseng cultivars, indicating that both species have similar genetic backgrounds. P. ginseng cultivars were subdivided into three minor groups: an independent cultivar 'Chunpoong', a subgroup with three accessions including two cultivars, 'Gumpoong' and 'Yunpoong' and one landrace 'Hwangsook' and another subgroup with two accessions including one cultivar, 'Gopoong' and one landrace 'Jakyung'. Each primer pair produced 1 to 4 bands, indicating that the ginseng genome has a highly replicated paleopolyploid genome structure.

Design of Image Tracking System Using Location Determination Technology (위치 측위 기술을 이용한 영상 추적 시스템 설계)

  • Kim, Bong-Hyun
    • Journal of Digital Convergence
    • /
    • v.14 no.11
    • /
    • pp.143-148
    • /
    • 2016
  • There is increasing concern about security as a need for increased safety in the information industry society. However, it does not meet the needs for safety including CCTV. Therefore, in this paper, we link the processing technology using the image information to the IPS system consisting of GPS and Beacon. It designed a conventional RFID tag attached discomfort and image tracking system is limited to complement the disadvantages identifiable area. To this end, we designed a smart device and the Internet of Things convergence system and a research to ensure the accuracy and reliability of the IPS of the access control system. Finally, by leveraging intelligent video information using a PTZ camera, and set the entrant management policies it was carried out to control the situation and control. Also, by designing the integrated video tracking system, an authentication server, visualization systems were designed to establish an efficient technique for analyzing the IPS entrant behavior patterns.

A Secure Yoking-Proof Protocol Providing Offline Verification (오프라인 검증을 지원하는 안전한 요킹증명 프로토콜)

  • Ham, Hyoungmin
    • The Journal of the Korea Contents Association
    • /
    • v.21 no.2
    • /
    • pp.113-120
    • /
    • 2021
  • RFID (Radio Frequency Identification) yoking authentication provides methods scanning a pair of RFID tags with a reader device and verifying them to ensure the physical proximity of objects. In the first yoking proof protocols, a verifier connected to a reader device online is essential to verify the yoking proof, and this condition limits the environment in which yoking proof can be applied. To solve this limitation, several studies have been conducted on offline yoking proof protocol that does not require the online connection between a reader and a verifier. However, the offline yoking proof protocols do not guarantee the basic requirements of yoking proof, and require relatively more operations on the tag compared to the previous yoking proof protocols. This paper proposes an efficient offline yoking proof protocol that supports offline verification without the need for an online verifier. The proposed protocol provides a secure yoking proof with fewer number of operations than the existing ones, and it also can be extended to the group proof for more than a pair of tags without additional devices. The analysis in this paper shows that the proposed protocol provides offline verification securely and effectively.

ID-Based Proxy Re-encryption Scheme with Chosen-Ciphertext Security (CCA 안전성을 제공하는 ID기반 프락시 재암호화 기법)

  • Koo, Woo-Kwon;Hwang, Jung-Yeon;Kim, Hyoung-Joong;Lee, Dong-Hoon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.1
    • /
    • pp.64-77
    • /
    • 2009
  • A proxy re-encryption scheme allows Alice to temporarily delegate the decryption rights to Bob via a proxy. Alice gives the proxy a re-encryption key so that the proxy can convert a ciphertext for Alice into the ciphertext for Bob. Recently, ID-based proxy re-encryption schemes are receiving considerable attention for a variety of applications such as distributed storage, DRM, and email-forwarding system. And a non-interactive identity-based proxy re-encryption scheme was proposed for achieving CCA-security by Green and Ateniese. In the paper, we show that the identity-based proxy re-encryption scheme is unfortunately vulnerable to a collusion attack. The collusion of a proxy and a malicious user enables two parties to derive other honest users' private keys and thereby decrypt ciphertexts intended for only the honest user. To solve this problem, we propose two ID-based proxy re-encryption scheme schemes, which are proved secure under CPA and CCA in the random oracle model. For achieving CCA-security, we present self-authentication tag based on short signature. Important features of proposed scheme is that ciphertext structure is preserved after the ciphertext is re-encrypted. Therefore it does not lead to ciphertext expansion. And there is no limitation on the number of re-encryption.