• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.6
• /
• pp.999-1012
• /
• 2020

As the utilize of personal health records increases in recent years, research on cryptographic protocol for protecting personal information of personal health records has been actively conducted. Currently, personal health records are commonly encrypted and outsourced to the cloud. However, this method is limited in verifying the integrity of personal health records, and there is a problem with poor data availability because it is essential to use it in decryption. To solve this problem, this paper proposes a verifiable cloud-based personal health record management scheme using Redactable signature scheme and zero-knowledge proof. Verifiable cloud-based personal health record management scheme can be used to verify the integrity of the original document while preserving privacy by deleting sensitive information by using Redactable signature scheme, and to verify that the redacted document has not been deleted or modified except for the deleted part of the original document by using the zero-knowledge proof. In addition, it is designed to increase the availability of data than the existing management schemes by designing to recover deleted parts only when necessary through the Redact Recovery Authority. And we propose a verifiable cloud-based personal health record management model using the proposed scheme, and analysed its efficiency by implementing the proposed scheme.

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

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06c
• /
• pp.77-79
• /
• 2011

최근 플래시 메모리가 디지털 기기의 저장장치로 많이 사용되면서 범죄와 관련하여 중요 증거나 단서가 디지털 기기 내에 저장되는 경우가 많아지고 있다. 이러한 현상은 플래시 메모리에 저장된 데이터는 디지털 포렌식 수사에 도움이 될 가능성이 있기 때문에 와이핑 툴(Wiping Tool)을 사용하여 저장된 데이터를 영구 삭제하게 된다. 플래시 메모리는 덮어쓰기가 불가능하기 때문에 와이핑(Wiping) 되어도 이전 데이터가 남아있는 특성이 있다. 이전 데이터를 복구하기 위해서는 기존 하드디스크 기반의 복구기법으로는 복구하기 어렵다. 최근 연구된 플래시 메모리 복구기법은 메타정보의 의존도가 높은 문제가 있다. 그래서 기존 플래시 메모리 복구기법을 보완하여 플래시 메모리 특성을 이용한 다른 방식의 연구가 필요하다. 본 기법은 플래시 메모리에 데이터 와이프로 삭제된 파일을 검색하고, 검증 절차를 거쳐 파일을 복구하는 기법을 제안한다.

• Proceedings of the KIPE Conference
• /
• 2015.07a
• /
• pp.305-306
• /
• 2015

기존 소용량 전원 장치의 경우, Primary 측에 단상 AC 전압 평활을 위한 고압 전해 커패시터가 사용되는 것이 일반적이다. 이러한 전해 커패시터는 회로의 전체적인 부피를 키우고 제작 단가를 증가시킨다. 뿐만 아니라, 전원 열악 지역(인도향 제품 등)과 같이 300Vac 이상의 전압 한계치를 갖는 경우에는 전해 커패시터 파열에 의한 회로의 손상을 야기할 수 있다. 본 논문에서는 고압 DC 평활 커패시터를 삭제한 소용량 전원 장치 구현 방안을 제안한다. 제안 방식은 고전압 전해 커패시터의 삭제와 스위치 내장형 IC를 채용함으로써 소형화 및 원가 저감이 가능하며, 동시에 불안정한 입력 전원에도 전해 커패시터 파열에 의한 회로 손상을 막을 수 있다. 본 논문에서는 절연형 Flyback 컨버터를 이용하여, 이론적 특성 분석과 5W급 시작품을 통한 실험적 분석을 통해 그 타당성을 검증한다.

• Journal of dental hygiene science
• /
• v.17 no.1
• /
• pp.20-29
• /
• 2017

The purpose of this study was to investigate the validity and reliability of the Korean version of a tool used to measure dental anxiety and fear. The Index of Dental Anxiety and Fear ($IDAF-4C^+$) was translated into Korean, and modified and revised to adapt to Korean culture. A survey was conducted among 457 patients in a dental clinic. The validity and reliability were determined using PASW Statistics ver. 18.0 and IBM SPSS AMOS ver. 21.0. Factor analysis showed that Korean version of $IDAF-4C^+$ was composed of three elements: dental anxiety, dental phobia, feared stimulus. The validity of the model was examined by confirmatory factor analysis and satisfied relevant requirements. All elements had convergent validity and discriminant validity exceeding requirements to ensure validity. Cronbach's ${\alpha}$ showed good reliability. In conclusion, the findings of this study demonstrate that the Korean version of $IDAF-4C^+$ has high validity and reliability. Furthermore, it can be used in clinical practice and research to decrease dental anxiety and fear.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.1
• /
• pp.1-6
• /
• 2016

This paper focuses on algorithm innovation of NAND Flash Memory for enhancing cell lifetime. During flash memory read/write/erase, the voltage of a specific cell should be a valid voltage level. If not, we cannot read the data correctly. This type of interference/disturbance tends to be serious when program and erase operation will go on. This is because FN tunneling results in tunnel oxide damage due to increased trap site on repetitive high biased state. In order to resolve this problem, we make the cell degradation by reducing the amount of stress in terms of erase cell, resulting in minimizing the cell disturbance on erase verify.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06c
• /
• pp.75-77
• /
• 2012

플래시 메모리가 각종 IT 기기의 저장장치로 많이 사용되면서 범죄 관련 증거나 단서가 기기 내에 저장되는 경우가 증가하고 있다. 이러한 경우에 기기 내에 저장된 데이터를 완전히 삭제하기 위하여 안티 포렌식 기술인 와이핑 기법을 사용하는데 이에 대응하기 위해서는 플래시 메모리에 저장된 디지털 증거를 분석하기 위한 디지털 포렌식 기술이 필요하다. 플래시 메모리에 저장되어 있는 데이터를 복구하는 기법이 연구되었으나 특정한 상황을 가정한 특정 파일의 복원에 초점을 두고 있다. 하지만 디지털 포렌식 수사에서 범죄 증거뿐만 아니라 범죄 행위에 관련한 증거도 확보할 필요성이 있지만 이와 같은 연구가 미흡하다. 본 논문은 플래시 메모리에서 안티 포렌식 기술인 파일 와이핑으로 삭제된 파일에 대한 와이핑 증거 확보 기법을 제안한다. 제안 내용은 장치 내의 원본파일과 와이핑 파일로 추정되는 블록들을 검색한 후 갱신시각, 파일에 대한 정보를 통해 서로 비교하여 검증한다.

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

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.2
• /
• pp.103-114
• /
• 2013

This paper suggests a method to reduce the number of performances of Kruskal and Reverse-delete algorithms. Present Kruskal and Reverse-delete algorithms verify whether the cycle occurs within the edges of the graph. For this reason, they have problems of unnecessarily performing extra algorithms from the edges, even though they've already obtained the minimum spanning tree. This paper, first of all, suggests the 1st method which reduces the no. of performances by introducing stop point criteria of algorithm, but at the same time, performs algorithms from all the edges, just like how Kruskal and Reverse-delete algorithms. Next, it suggests the 2nd method which finds the minimum spanning tree from the remaining edges after getting rid of all the unnecessary edges which are considered not to affect the minimum spanning tree. These suggested methods have an effect of terminating algorithm at least 1.4 times and at most 3.86times than Kruskal and Reverse-delete algorithms, when applied to the real graphs. We have found that the 2nd method of the Reverse-delete algorithm has the fastest speed in terminating an algorithm, among 4 algorithms which are results of the 2 suggested methods being applied to 2 algorithms.

• The Journal of the Korea Contents Association
• /
• v.21 no.8
• /
• pp.608-618
• /
• 2021

The aim of this study was to verify the feasibility and reliability of the program outcome indirect measurement tool developed for nursing college students in Korean. 396 nursing students from 5 nursing colleges participated in this study, data were collected from November 22 to December 10, 2019. Data analysis was conducted using the IBM Statistics SPSS 21.0 and AMOS 21.0 programs to analyze item analysis, exploratory and confirmatory factor analysis. As a result of the item analysis, all 79 items were selected for factor analysis. In the exploratory factor analysis, five items that were loaded with other factors were deleted. The final factor loading range was from .37 to .86, and the cumulative explanatory variance for 12 factors was 71.71%. No items were deleted as a result of the confirmatory factor analysis, and the final scale was consisted of 74 items. The average score for scale was 3.78 and Cronbach' α was .98. The feasibility and reliability of the program outcome indirect measurement tool have been verified through this study. Therefore it can be used as a more standardized indirect measurement tool for nursing college students.