• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.328-330
• /
• 2001

무선 인터넷 환경하에서 신뢰성이 보장되어야 할 데이터의 전송이나 음성 데이터의 전송시에 혼잡으로 인한 손실이 발생했을 때, 라우터나 스위치에서의 손실을 네트웍 레이어에서 직접 복구를 함으로서 양단에서의 손실을 극소화함은 물론 지연시간을 최소화하여, 멀티미디어 데이터의 재생시에 치명적으로 작용할 수 있는 Jitter의 발생을 줄이며 네트웍 레이어에서의 손실을 최소화함으로써 무선 링크를 통한 복구 횟수를 줄여서 신뢰성 향상 및 전반적인 모바일 네트웍의 성능을 향상시킬 수 있는 방법을 제시하고 이에 대한 시뮬레이션을 통해 그 성능을 입증하도록 하겠다.

• Journal of Korea Multimedia Society
• /
• v.10 no.3
• /
• pp.358-364
• /
• 2007

This paper suggests MPLS restoration method that use an aggregation tree. For the restoration of the MPLS network, this paper presents a scheme that reconstruct multiple path through aggregation tree that grow from many node to a target node. Contrary to a multicast tree where a message that send at one node is passed to a group of node, an aggregation tree is a tree that data is passed from many node to one destination node. Through an experiment we confirmed that the restoration scheme that uses aggregation tree shows taster speed comparing with the existing other restoration scheme.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.288-290
• /
• 1999

현재 국내에서는 암호이용에 대한 법 제정을 가지고 많은 문제들이 제기되고 있다. 일반인에게 암호의 사용은 피상적이지만, 일부 선진국에서는 전자상거래 및 인터넷에서의 암호사용에 대하여 구체화시켜 실행하는 단계에 이르고 있다. 그러나, 이러한 암호 선진국에 있어서도 암호의 양면성, 즉 암호의 기밀성을 통한 개인정보와 기업정보 등을 포함하는 데이터의 보호와 범죄의 은닉에 사용될 수 있다는 문제를 가지고 있으며, 이에 대한 해결책으로 키 복구 방법을 사용하고 있다. 그런, 키 복구 방법은 개인의 인권 침해라는 새로운 문제를 대두시켰으며, 암호선진국들은 인권보호단체와 민간단체 그리고 기업의 반발에 의하여 키 복구 방법에 대한 새로운 서비스를 제공하고 있다. 국내에서도 연구 및 개발은 미비하지만 키 복구로 인하여 암호이용에 대한 법 제정이 지연될 정도로 전자상거래에 있어서, 그 비중이 크다고 할 수 있다. 본 논문에서는 키 복구 서비스를 사용하면서, 개인의 인권을 보호할 수 있는 키 복구 시스템을 소개한다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.12
• /
• pp.487-496
• /
• 2017

In MySQL InnoDB, there are two ways of storing data. One is to create a separate tablespace for each table and store it separately. Another is to store all table and index information in a single system tablespace. You can use this information to recover deleted data from the record. However, in most of the current database forensic studies, the former is actively researched and its structure is analyzed, whereas the latter is not enough to be used for forensics. Both approaches must be analyzed in terms of database forensics because their storage structures are different from each other. In this paper, we propose a method for recovering deleted records in a method of storing records in IBDATA file, which is a single system tablespace. First, we analyze the IBDATA file to reveal its structure. And introduce delete record recovery algorithm which extended to an unallocated page area which was not considered in the past. In addition, we show that the recovery rate is improved up to 68% compared with the existing method through verification using real data by implementing the algorithm as a tool.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.34 no.2
• /
• pp.193-206
• /
• 2024

In tandem with the advancements in the digital era, the significance of digital data has escalated, necessitating an increased focus on digital forensics investigations. However, the process of collecting and analyzing digital evidence faces significant challenges, such as the unidentifiability of damaged files due to issues like media corruption and anti-forensic techniques. Moreover, the technological limitations of existing tools hinder the recovery of damaged files, posing difficulties in the evidence collection process. This paper aims to propose solutions for the recovery of corrupted MS Office files commonly used in digital data creation. To achieve this, we analyze the structure of MS Office files in the OOXML format and present a novel approach to overcome the limitations of current recovery tools. Through these efforts, we aim to contribute to enhancing the quality of evidence collection in the field of digital forensics by efficiently recovering and identifying damaged data.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10b
• /
• pp.383-387
• /
• 2007

본 논문은 NAND 플래시 메모리를 기반으로 한 임베디드 시스템에서 예기치 않은 오류에 대해 데이터 일관성 지원하는 파일 시스템을 제안 한다. 플래시 메모리는 하드디스크에 비해 작고, 내구성, 저 전력, 읽기속도 등 많은 부분에서 장점을 지니고 있어 임베디드 기기에 유리하다. 하지만 제자리 덮어쓰기가 되지 않고 추가적인 연산을 통해 지움 연산을 해야 하는 단점이 있다. 본 논문에서는 이미지 로그를 사용하여 시스템의 비정상적인 종료를 판단하고 플래시 메모리의 외부 갱신 쓰기 특징을 이용하여 파일 연산 전후 메타데이터의 타입을 다르게 하여 추가적인 로그 쓰기 연산 없이 파일 연산 중 오류를 판단하고 이전의 데이터로 복구론 할 수 있는 파일 시스템을 제안 한다. 또한 빠른 마운트를 지원 하는 파일 시스템에 복구 기법을 추가하고 마운트 시간을 실험 하였다. 실험 결과 정상적인 종료 시 YAFFS에 비해 $76%{\sim}85%$ 마운트 시간을 감소 시켰고 비정상 적인 종료로 인해 오류 복구를 해야 할 때 마운트 시간은 YAFFS에 비해 $40%{\sim}60%$감소 시켰다. 그리고 파일에 대한 연산 시간도 YAFFS 와 차이가 없었다.

• KIISE Transactions on Computing Practices
• /
• v.23 no.3
• /
• pp.177-182
• /
• 2017

To develop computer and communication in the information society, difficulties exist in managing the enormous data manually. Also, loss of data due to natural disasters or hacker attacks, generate a variety of disasters in the IT securities. Hence, there is an urgent need for an information protection management system in order to mitigate these incidents. Information Security Management System has various existing frameworks for IT disaster management. These include Cyber Security Framework, Risk Management Framework, ISO / IEC 27001: 2013, and COBIT 5.0. Each framework analyses and compares the entry for IT disaster recovery from among the various available data. In this paper, we describe a single integrated management scheme for fast resolution of IT disasters.

• The KIPS Transactions:PartA
• /
• v.16A no.1
• /
• pp.17-26
• /
• 2009

Large-scale wireless sensor network are expected to play an increasingly important role for the data collection in harmful area. However, the physical fragility of sensor node makes reliable routing in harmful area a challenging problem. Since several sensor nodes in harmful area could be damaged all at once, the network should have the availability to recover routing from node failures in large area. Many routing protocols take accounts of failure recovery of single node but it is very hard these protocols to recover routing from large scale failures. In this paper, we propose a routing protocol, which we refer to as LSFA, to recover network fast from failures in large area. LSFA detects the failure by counting the packet loss from parent node and in case of failure detection LSFAdecreases the routing interval to notify the failure to the neighbor nodes. Our experimental results indicate clearly that LSFA could recover large area failures fast with less packets than previous protocols.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.5
• /
• pp.885-896
• /
• 2014

The files in computer storages can be deleted due to unexpected failures or accidents. Some malicious users often delete data by himself for anti-forensics. If deleted files are associated with crimes or important documents in business, they should be recovered and the recovery tool is necessary. The recovery methods and tools for some filesystems such as NTFS, FAT, and EXT have been developed actively. However, there has not been any researches for recovering deleted files in XFS filesystem applied to NAS or CCTV. In addition, since the current related tools are based on the traditional signature detection methods, they have low recovery rates. Therefore, this paper suggests the recovery methods for deleted files based on metadata and signature detection in XFS filesystem, and verifies the results by conducting experiment in real environment.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.7
• /
• pp.507-517
• /
• 2003

A single fiber failure in mesh-based WDM networks may result in the loss of a large number of data. To remedy this problem, an efficient restoration algorithm for a single fiber failure in the mesh- based WDM network is necessary. We propose a new algorithm for restoration scheme in WDM networks and compare it with previous schemes. Path restoration and link restoration are two representative restoration schemes which deal with only a single link failure. In this paper, we propose two kinds of efficient restoration scheme. In the proposed schemes the restoration path for each link failure is not secured. The mesh network is decomposed into a number of small loops. In one algorithm, any link failure in a certain loop is regarded as the failure of the loop and the restoration lightpath is selected by detouring the failed loop. In another scheme any link failure in a certain loop is restored within the loop. We compare performance of the proposed schemes with conventional path restoration scheme and link restoration scheme. Simulation results show that CPU time in the proposed schemes decreases compared with that in path restoration scheme and link restoration scheme, although total wavelength mileage usage increases by 10% to 50%.