• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.06a
• /
• pp.514-517
• /
• 2001

정보보호를 위한 공개키 기반 구조의 구축은 사용자들에게 많은 미정을 줄 수 있다. 그러나 암호 키의 분실이나 불법적인 사용 등의 문제점을 내포하고 있다. 이러한 문제점을 해결할 수 있는 기술로서 공개키 기반 구조와 연동 가능한 키 복구 기술이 있으며, 현재 많은 연구가 진행중에 있다. 기존에 제안되어 있는 방식은 인증기관에게 저장공간을 요구하거나, 인증기관과 위탁기관간의 통신량이 증가하는 문제점을 가지고 있다. 본 논문에서는 이러한 문제점을 지적하고 이를 해결하는 변형된 SE-PKI 키 복구 시스템을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04a
• /
• pp.295-297
• /
• 2000

무선이동통신 기술의 발달은 이용자의 수와 데이터 양의 폭발적인 증가를 가져왔다. 이러한 추세에 따라 Cellular, PCS, Radio-paging, Multimedia data, Internet services를 통합하는 제3세대 무선이동통신이 연구 중에 있다. 모든 서비스들이 무선이동통신으로 이동함에 따라 보안문제들(인증, 키교환, 키복구등)이 중요시되고 있다. 그 중에서도 범법자들의 통신에 대한 국가적 법집행능력 확보를 위한 키 복구 모델은 꼭 필요 할 것이다. 따라서, 본 논문에서는 이동통신시스템에서의 효율적인 키 복구를 위한 모델을 제안하고 이에 따른 데이터 타입을 정의한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.263-265
• /
• 2003

그룹 통신 보안에 사용되는 그룹키의 갱신 메시지가 전송상에서 분실될 경우, 멤버들은 그룹 데이터의 복호화가 불가능해진다. 그러므로 신뢰성 있는 그룹키 갱신 메시지의 전달 뿐 아니라, 분실된 키의 복구는 매우 중요한 문제이다. 본 논문에서는 키 갱신 메시지의 분실이나 멤버의 로그인시에 발생할 수 있는 문제점을 분석하고 효율적으로 그룹키 및 보조키들을 복구하는 방법들을 제시한다. 또한 그룹 관리자가 메시지를 저장하지 않고 임의의 그룹키를 복구할 수 있도록 하였으며, 멤버의 중복된 키 복구 요청과 불필요한 보조키들의 전송을 줄였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.12
• /
• pp.739-745
• /
• 2014

It has been shown in compressive sensing that every s-sparse $x{\in}R^N$ can be recovered from the measurement vector y=Ax or the noisy vector y=Ax+e via ${\ell}_1$-minimization as soon as the 3s-restricted isometry constant of the sensing matrix A is smaller than 1/2 or smaller than $1/\sqrt{3}$ by applying the Iterative Hard Thresholding (IHT) algorithm. However, recovery can be guaranteed by practical algorithms for some certain assumptions of acquisition schemes. One of the key assumption is that the sensing matrix must satisfy the Restricted Isometry Property (RIP), which is often violated in the setting of many practical applications. In this paper, we studied a generalization of RIP, called Restricted Biorthogonality Property (RBOP) for anisotropic cases, and the new recovery algorithms called oblique pursuits. Then, we provide an analysis on the success of sparse recovery in terms of restricted biorthogonality constant for the IHT algorithms.

• Resources Recycling
• /
• v.21 no.4
• /
• pp.26-34
• /
• 2012

Recently, the recovery of resources from waste material of manufacturing electric and electronic equipment has been investigated. It is very important to extract metallic components from electric and electronic manufacturing processes with the view point of recycling of the used resources as well as an environmental protection. In this paper, open/registered patents of US, JP, EP, and KR and SCI journal related to metal recovery technologies from wastes produced in the electric and electronic manufacturing processes between 1975~2011 were reviewed. Patents and papers were collected using key-words searching and filtered by filtering criteria. The trends of the patents and papers were analyzed by the years, countries, companies, and technologies.

• Economic and Environmental Geology
• /
• v.45 no.1
• /
• pp.59-68
• /
• 2012

With the decline in discoveries of new oil fields and increasing demand from developing countries it is believed that enhanced oil recovery (EOR) technologies will play a key role to meet the energy demand in years to come. Based on the recently-published data, this paper discusses current status of global EOR market and technical development trends. The EOR market includes oil produced through various EOR recovery methods, such as thermal recovery, gas injection, chemical injection. Also, EOR methods are addressed screening criteria by reservoir and fluid characteristics including lithology, depth, thickness, and oil properties such as composition and gravity. Finally, the examples of field applied by various EOR methods are discussed with respect to reservoir characteristics and performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.1
• /
• pp.404-421
• /
• 2020

A reversible data hiding scheme in JPEG compressed bitstreams is proposed, which could avoid decoding failure and file expansion by means of removing of bitstreams corresponding to high frequency coefficients and embedding of secret data in file header as comment part. We decode original JPEG images to quantified 8×8 DCT blocks, and search for a high frequency as an optimal termination point, beyond which the coefficients are set to zero. These blocks are separated into two parts so that termination point in the latter part is slightly smaller to make the whole blocks available in substitution. Then spare space is reserved to insert secret data after comment marker so that data extraction is independent of recovery in receiver. Marked images can be displayed normally such that it is difficult to distinguish deviation by human eyes. Termination point is adaptive for variation in secret size. A secret size below 500 bits produces a negligible distortion and a PSNR of approximately 50 dB, while PSNR is also mostly larger than 30 dB for a secret size up to 25000 bits. The experimental results show that the proposed technique exhibits significant advantages in computational complexity and preservation of file size for small hiding capacity, compared to previous methods.

• ETRI Journal
• /
• v.42 no.5
• /
• pp.748-760
• /
• 2020

MapReduce is a framework that can process huge datasets in parallel and distributed computing environments. However, a single machine failure during the runtime of MapReduce tasks can increase completion time by 50%. MapReduce handles task failures by restarting the failed task and re-computing all input data from scratch, regardless of how much data had already been processed. To solve this issue, we need the computed key-value pairs to persist in a storage system to avoid re-computing them during the restarting process. In this paper, the task failure resilience (TFR) technique is proposed, which allows the execution of a failed task to continue from the point it was interrupted without having to redo all the work. Amazon ElastiCache for Redis is used as a non-volatile cache for the key-value pairs. We measured the performance of TFR by running different Hadoop benchmarking suites. TFR was implemented using the Hadoop software framework, and the experimental results showed significant performance improvements when compared with the performance of the default Hadoop implementation.

• Journal of Microbiology and Biotechnology
• /
• v.29 no.4
• /
• pp.607-616
• /
• 2019

In this study, functionalized poplar powder (FPP) was used as a support material for the immobilization of enoate reductase (ER) and glucose-6-phosphate dehydrogenase (GDH) by covalent binding. Under optimal conditions, the immobilization efficiency of ER-FPP and GDH-FPP was 95.1% and 84.7%, and the activity recovery of ER and GDH was 47.5% and 37.8%, respectively. Scanning electron microscopy (SEM) and energy dispersive spectroscopy (EDS) analysis indicated that FPP was a suitable carrier for enzyme immobilization. ER-FPP and GDH-FPP exhibit excellent thermal stabilities and superior reusability. Especially, ER-FPP and GDH-FPP enable the continuous conversion of 4-(4-Methoxyphenyl)-3-buten-2-one with $NAD^+$ recycling. While the immobilization strategies established here were simple and inexpensive, they exploited a new method for the immobilization and application of ER and its cofactor recycling system.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.1
• /
• pp.3-10
• /
• 2012

In this paper, we propose a fault injection attack on stream cipher A5/3 used in GSM. The fault assumption of this attack is based on that of fault injection attacks proposed in FDTC'05 and CISC-W'10. This attack is applicable to A5/3 supporting 64/128-bit session key, respectively, and can recover the session key by using a small number of fault injections. These works are the first known key recovery attack results on A5/3.