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

• Journal of the Korea Society for Simulation
• /
• v.16 no.2
• /
• pp.27-35
• /
• 2007

When sensor networks are deployed in open environments, all the sensor nodes are vulnerable to physical threat. An attacker can physically capture a sensor node and obtain the security information including the keys used for data authentication. An attacker can easily inject false reports into the sensor network through the compromised node. False report can lead to not only false alarms but also the depletion of limited energy resource in battery powered sensor networks. To overcome this threat, Fan Ye et al. proposed that statistical on-route filtering scheme(SEF) can do verify the false report during the forwarding process. In this scheme, the choice of a security threshold value is important since it trades off detection power and energy, where security threshold value is the number of message authentication code for verification of false report. In this paper, we propose a fuzzy rule-based system for security threshold determination that can conserve energy, while it provides sufficient detection power in the SEF based sensor networks. The fuzzy logic determines a security threshold by considering the probability of a node having non-compromised keys, the number of compromised partitions, and the remaining energy of nodes. The fuzzy based threshold value can conserve energy, while it provides sufficient detection power.

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

• The Journal of the Korea Contents Association
• /
• v.17 no.10
• /
• pp.567-575
• /
• 2017

In this study, when diagnosis pancreatic cancer by dual time point PET/CT, we propose SUVm 2.52 as the threshold value for performing the dual time point PET/CT exam. The hypothesis of normal distribution was adopted through data conversion of 60 pancreatic diseases. The proposed SUVm2.52 boundary value showed a significance level that could be applied to both 120 and 180 minutes of delay time scan for pancreatic cancer determination (p<0.05). C-value variation shows that delay time 2 hour test is more useful than delay time 3 hour test. When the SUVm 2.52 is set to the boundary value and the double-time point PET/CT exam is performed, the probability of distinguishing cancer from inflammation in the delayed image is 95%. When the delayed test is performed with the proposed boundary value SUVm 2.52, Compared with general PET / CT scans, it is thought that it may be helpful to distinguish pancreatic cancer.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.728-731
• /
• 2007

Though the Hough transform is a well-known method for detecting analytical shape represented by a number of free parameters, the basic property of the Hough transform, the one-to-many mapping from an image space to a Hough space, causes the innate problem, the sensitivity to noise. To remedy this problem, Edge Strength Hough Transform (ESHT) was proposed and proved to reduce the noise sensitivity. However the performance of ESHT depends on the size of a Hough space and image and some other parameters, which play an important role in ESHT and should be decided experimentally. In this paper, we derived a formula to decide decreasing parameter. Using the derived formulae, the decreasing parameter value can be decided only with the pre-determined values, the size of a Hough space and an image, which make it possible to decide them automatically.

• The KIPS Transactions:PartC
• /
• v.19C no.1
• /
• pp.9-18
• /
• 2012

In 2010, Pedro et al. proposed RFID distance bounding protocol based on WSBC cryptographic puzzle. This paper points out that Pedro et al.'s protocol not only is vulnerable to tag privacy invasion attack and location tracking attack because an attacker can easily obtain the secret key(ID) of a legal tag from the intercepted messages between the reader and the tag, but also requires heavy computation by performing symmetric key operations of the resource limited passive tag and many communication rounds between the reader and the tag. Moreover, to resolve the security weakness and the computation/communication efficiency problems, this paper also present a new RFID distance bounding protocol based on WSBC cryptographic puzzle that can provide strong security and high efficiency. As a result, the proposed protocol not only provides computational and communicational efficiency because it requires secure one-way hash function for the passive tag and it reduces communication rounds, but also provides strong security because both tag and reader use secure one-way hash function to protect their exchanging messages.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.149-150
• /
• 2012

This paper presents a shot boundary detection method based on the global decision tree that allows for extraction of boundaries of high variations occurring due to camera breaks from frame difference values. For a start, difference values between frames are calculated through local X2-histogram and normalization. Next, the distances between difference values are calculated through normalization.

• Journal of the Korean Society for Precision Engineering
• /
• v.1 no.1
• /
• pp.23-29
• /
• 1984

소성역학에 의해서 소성가공중의 현상을 해석하여 제품의 형상, 강도, 잔유응력, 가공력, 가공한계 및 결함의 발생등을 견적하고 이것에 의해 가공기계의 강도, 강성 및 제어량등이 결정된다. 또 재질에 대한 지침이 얻어진다. 탄성론이나 소성론에서 경계치 문제는 응력젼위방정식, 응력의 경계조건, 변위에 관한 변위 스트레인 관계식과 변위의 경계조건, 그리고 응력과 스트레인을 관계시 키는 구성방정식으로 되어 있는 기초방정식으로 구성된다. 문제의 구성방정식은 재료의 거동이 매우 복잡하기 때문에 실제의 거동을 충실히 표시 할 수 없다. 재료의 이방성, 유한도형, 이방성주축의 회 전, 가공경화, 고온, 고속가공 등에 의해서 재료의 변형거동은 매우 복잡해진다. 이상의 정량적 고찰 과 전위 또는 결정의 슬립모델과 같은 정성적 고찰도 있다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.07a
• /
• pp.330-332
• /
• 2012

H.264/AVC를 비롯한 대부분의 동영상 압축 표준에 의해 부호화 및 복호화된 영상은 블록화 현상(blocking artifacts)이 생긴다. 이러한 화질 열화 현상은 블록 기반의 정수형 이산코사인 변환(Integer DCT)을 수행한 후 계수를 양자화 하기 때문에 발생한다. 이러한 블록화 현상을 줄이기 위해 H.264/AVC에서는 디블록킹 필터를 이용한다. 본 논문에서는 H.264/AVC의 디블록킹 필터의 복잡도를 감소시키면서 화질을 유지하는 알고리듬을 제안하고 실험을 통한 평가를 제시한다. 복잡도를 줄이기 위해 제안하는 알고리듬에서는 블록 경계강도(Bs) 결정 과정에서 한 화소 줄의 경계강도를 이용하여 네 화소 줄 모두에 적용한다. 실험결과 경계강도 결정의 계산량을 줄이면서 주관적, 객관적 화질 또한 향상되는 결과를 보였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2003.11a
• /
• pp.65-68
• /
• 2003

블록화 현상은 블록 기반의 부호화와 이에 따른 거친 양자화 계수를 적용할 때 나타날 뿐 아니라 블록화가 나타난 블록을 움직임 보상으로 가져와 적용할 때 이후 영상에 전파되게 된다. 이를 방지하기 위해 H.264/MPEG-4 AVC 표준은 부호화 및 복호화 과정에 동시에 포함된 형태의 루프 필터를 적용하였다. 필터는 블록 경계에서 경계 양쪽의 블록 예측 모드에 기반 한 필터의 세기를 결정하고 양자화 계수를 이용한 한계 값과 화소 값윽 비교하여 블록 경계에 적응적으로 적용한다. 이 때 필터의 특성을 결정하는 편차 값을 부호기에서 전송하게 되는데 이 값은 부호기 구현에 따라 달라질 수 있다. 본 논문은 부호화하는 각 영상의 특성을 정의하고 편차 값을 정함으로써 영상에 적응적인 디블로킹 필터 알고리즘을 구현 및 실험을 통하여 검증한다.