• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.4
• /
• pp.885-894
• /
• 2016

As smartphones become more common, anybody can take pictures and record videos easily nowadays. Video files taken from smartphones can be used as important clues and evidence. While you analyze video files taken from smartphones, there are some occasions where you need to prove that a video file was recorded by a specific smartphone. To do this, you can utilize various fingerprint techniques mentioned in existing research. But you might face the situation where you have to strengthen the result of fingerprinting or fingerprint technique can't be used. Therefore forensic investigation of the smartphone must be done before fingerprinting and the database of metadata of video files should be established. The artifacts in a smartphone after video recording and the database mentioned above are discussed in this paper.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.6
• /
• pp.1361-1372
• /
• 2017

If an external attacker takes from a victim's smartphone a copy of a secret application or an application to which fingerprinting technique is applied, secret information can be leaked or the legitimate user can be misunderstood as an illegal redistributor, which results in a serious security problem. To solve this problem, this paper proposes an Android application code protection scheme using fingerprint authentication and dynamic loading. The proposed scheme divides one application into CLR(Class LoadeR) and SED(SEperated Dex). CLR is an APK file with the ability to dynamically load the SED, and the SED is a file containing the classes required to run the application. The SED is stored inside the smartphone after being encrypted, and the SED can be decrypted only if the user is successfully authenticated using his or her fingerprint. The proposed scheme can protect the application code from the attacker who physically acquired user's smartphone.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06b
• /
• pp.460-463
• /
• 2008

현재의 스토리지 시스템 및 백업 시스템에서 중복된 데이터의 증가로 인한 문제가 점점 대두되고 있다. 이러한 중복 데이터를 검사하거나 파일의 유사성을 검사하는 데에는 BSW알고리즘이 많이 사용되고 있으며 이 BSW알고리즘 내에서 해시 값을 구하는데에는 Rabin's Fingerprint알고리즘이 일반적으로 사용되고 있다. 본 논문에서는 Rabin's Fingerprint알고리즘에 비해 보다 빠르고 간단한 Modulo-K알고리즘을 제안하며 BSW알고리즘에서 Rabin's Fingerprint를 대체함으로써 최종적으로 BSW알고리즘의 속도를 향상 시킬 수 있는 Modulo-K알고리즘을 제안한다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.1
• /
• pp.93-98
• /
• 2016

A large number of victims or witnesses to incidents and accidents should visit a police station and fill the decree stated. Stated decree workaround discomfort and hygienic problems in unnecessary step process using the fingerprint after you modify the modified portion when due modify the request as of the import or typos recognized that modifications and police in the. Stated decree in the investigation phase when creating KICS and electronic Resources investigation into the identity of the one-touch fingerprint reader linked with the introduction table system and thinning, which can simplify the day of the procedure.

• Bulletin of the Korean Chemical Society
• /
• v.22 no.5
• /
• pp.488-492
• /
• 2001

As gas chromatography/infrared spectrometry (GC/IR) becomes routinely avaliable, methods must be developed to deal with the large amount of data produced. We demonstrate computer methods that quickly search through a large data file, locating thos e spectra that display a spectral feature of interest. Based on a modified library search routine, these selective data reduction methods retrieve all or nearly all of the compounds of interest, while rejecting the vast majority of unrelated compounds. To overcome the shifting problem of IR spectra, a search method of moving the average pattern was designed. In this moving pattern search, the average pattern of a particular functional group was not held stationary, but was allowed to be moved a little bit right and left.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.1
• /
• pp.8-18
• /
• 2010

Traditional storage server suffers from duplicated data blocks which cause an waste of storage space and network bandwidth. To address this problem, various de-duplication mechanisms are proposed. Especially, lots of works are limited to backup server that exploits Contents-Defined Chunking (CDC). In backup server, duplicated blocks can be easily traced by using Anchor, therefore CDC scheme is widely used for backup server. In this paper, we propose a new de-duplication mechanism for improving a storage system. We focus on efficient algorithm for supporting general purpose de-duplication server including backup server, P2P server, and FTP server. The key idea is to adapt stride scheme on traditional fixed block duplication checking mechanism. Experimental result shows that the proposed mechanism can minimize computation time for detecting duplicated region of blocks and efficiently manage storage systems.