• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.3
• /
• pp.19-26
• /
• 2012

To resist the relay attacks in RFID system, it is commonly used RFID distance bounding protocols using the round trip time measurement for 1 bit challenge and response between a reader and a tag. If the success probability of relay attacks for the 1 bit challenge and response can be reduced in these protocols, it is possible to make an efficient distance bounding protocol. In this paper, we propose an efficient RFID distance bounding protocol based on 2 bit challenge and response which is modified the RFID distance bounding protocol proposed by Hancke and Khun based on 1 bit challenge and response. The success probability of relay attack for the proposed protocol is (7/16)n for the n times of challenge and response, which is much lower than (3/4)n given by Hancke and Khun's protocol.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.17 no.5
• /
• pp.289-296
• /
• 2022

In this paper, we developed a deep learning-based recyclable object detection model. The model is developed based on YOLOv5 that is a one-stage detector. The deep learning model detects and classifies the recyclable object into 7 categories: paper, carton, can, glass, pet, plastic, and vinyl. We propose two methods for recyclable object detection models to solve problems during training. Bounding Box CutMix solved the no-objects training images problem of Mosaic, a data augmentation used in YOLOv5. Standardized Distance-based IoU replaced DIoU using a normalization factor that is not affected by the center point distance of the bounding boxes. The recyclable object detection model showed a final mAP performance of 0.91978 with Bounding Box CutMix and 0.91149 with Standardized Distance-based IoU.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.892-895
• /
• 2012

RIFD 시스템은 개체 인증, 전자결제 등 다양한 분야에서 사용되고 있다. 무선통신의 특성상 악의적인 공격자로부터 중계공격이 가능하여 공격자가 정당한 사용자로 가장할 수 있다. 이러한 중계공격을 예방하기 위하여 Distance Bounding이라는 개념의 프로토콜이 제안되어 왔다. 하지만, 기존 연구는 태그 ID 전달의 기밀성을 보장하지만 ID 검색의 비효율성 및 불필요한 두 번째 저속 단계가 존재하는 단점이 있다. 따라서 본 논문은 ID의 검색 없고, 시도 값과 응답 값을 2bits로 하여 마지막 저속 단계를 생략하며, 고속 단계에서 공격자의 공격 탐지 및 Terrorist 공격에 대하여 $(1/2)^n$의 공격 성공률을 갖는 2BP(2Bit 2Phase) Distance Bounding 프로토콜을 제안한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9B
• /
• pp.1350-1359
• /
• 2010

Recently many researchers have been proved that general RFID system for proximity authentication is vulnerable to various location-based relay attacks such as distance fraud, mafia fraud and terrorist fraud attacks. The distance-bounding protocol is used to prevent the relay attacks by measuring the round trip time of single challenge-response bit. In 2008, Munilla and Peinado proposed an improved distance-bounding protocol applying void-challenge technique based on Hancke-Kuhn's protocol. Compare with Hancke-Kuhn's protocol, Munilla and Peinado's protocol is more secure because the success probability of an adversary has (5/8)n. However, Munilla and Peinado's protocol is inefficient for low-cost passive RFID tags because it requires large storage space and many hash function computations. Thus, this paper proposes a new RFID distance-bounding protocol for low-cost passive RFID tags that can be reduced the storage space and hash function computations. As a result, the proposed distance-bounding protocol not only can provide both storage space efficiency and computational efficiency, but also can provide strong security against the relay attacks because the adversary's success probability can be reduced by $(5/8)^n$.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2020.05a
• /
• pp.595-598
• /
• 2020

IoU (Intersection over Union) is the most commonly used index in target detection. The core requirement of target detection is what is in the image and where. Based on these two problems, classification training and positional regression training are needed. However, in the process of position regression, the most commonly used method is to obtain the IoU of the predicted bounding box and ground-truth bounding box. Calculating bounding box regression losses should take into account three important geometric measures, namely the overlap area, the distance, and the aspect ratio. Although GIoU (Generalized Intersection over Union) improves the calculation function of image overlap degree, it still can't represent the distance and aspect ratio of the graph well. As a result of technological progress, Bounding-Box is no longer represented by coordinates x,y,w and h of four positions. Therefore, the IoU can be further optimized with the center point and aspect ratio of Bounding-Box.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4B
• /
• pp.610-619
• /
• 2010

RFID (radio frequency identification) systems, recently being used in a wide range of areas, are vulnerable to relay attack from malicious attackers. For that reason, Brands, et al. proposed a certification protocol between a certifier and a verifier based on the concept of distance-bounding, and in addition Hancke et al. introduced the concept of RFID. However, the delivery of tag IDs, one of the main RFID features, is not still available, and there are two important demerits: anonymity in the delivery of tag IDs suggested by Kim et al. and inefficiency in finding a tag ID with regard to how to check errors which may occur in the process of data exchange between readers and tags. Therefore, this study proposes a protocol that meets the requirements of tag anonymity and location untraceability, has resistance to errors which may take place in the phase of tag data exchange, and is very efficient in finding tag IDs.

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

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.7
• /
• pp.453-457
• /
• 2005

With the expansion of Internet, a variety of image databases are widely used and it is needed to select the part of an image what he wants. In contents-based image retrieval system, Zernikie moment and ART Descriptors are used fur shape descriptors in MPEC-7. This paper presents a fast computation method to determine the radius of a bounding circle that encloses an object in a binary image. With conventional methods, the whole area of the image should be scanned first and the distance from every pixel to the center point be computed. The proposed 4-directional scan method and fast circle-drawing algorithm is utilized to minimize the scanning area and reduce the number of operations fur computing the distance. Experimental results show that proposed method saves the computation time to determine the radius of a bounding circle efficiently.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.3
• /
• pp.298-300
• /
• 2016

We propose a RFID distance bounding protocol that RFID tag still responds when reader sends a void challenge in order to reduce the probability of a relay attack. We analyze the success probability of relay attack depending on the full challenge ratio. Our experimental results show that our protocol is secure to relay attack.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.809-811
• /
• 2015

VANET은 차량간 통신 네트워크로 사고나 교통정보를 차량간 전달하거나 인프라를 통해 교통시스템 등의 서비스를 가능하게 한다. 사용자의 편의와 교통시스템의 효율을 위해 확산이 기대된다. 이에 다수의 차량과 인프라 간, 차량과 차량간 통신에서 악의적인 해커의 공격에 대비할 수 있는 보다 안전한 인증 프로토콜이 필요하다. 본 논문에서는 VANET 환경에서 Distance-Bounding Protocol과 Diffie-Hellman을 이용한 상호 인증 및 키 교환 프로토콜을 제안한다. 제안하는 프로토콜은 보안성평가를 통해 안전성을 검증하였으며, 이를 통해 VANET 환경에서 불법적인 RSU나 해커의 공격으로부터 안전한 통신을 가능하게 할 것으로 예상된다.