• Journal of the Korea Convergence Society
• /
• v.9 no.12
• /
• pp.53-60
• /
• 2018

With the development of information and communication technology, we have been able to access and manage documents containing corporate information anytime and anywhere using smart devices. As the work environment changes to smart work, the scope of information distribution is expanded, and more efforts are needed to manage security. This paper proposes a file sharing system that enables users who have smart devices to manage and share files through mutual cooperation. Proposed file sharing system, the user can add a partner to share files with each other when uploading files kept by spliting the part of the file and the other uses an algorithm to store on the server. After converting the file to be uploaded to base64, it splits it into encrypted files among users, and then transmits it to the server when it wants to share. It is easy to manage and control files using dedicated application to view files and has high security. Using the system developed with proposed algorithm, it is possible to build a system with high efficiency even for SMEs(small and medium-sized enterprises) that can not pay much money for security.

• The Journal of the Korea Contents Association
• /
• v.19 no.5
• /
• pp.417-425
• /
• 2019

Storage snapshot technology allows to preserve data at a specific point in time, and recover and access data at a desired point in time. It is an essential technology for storage protection application. Existing snapshot methods have some problems in that they dependent on storage hardware vendor, file system or virtual block device. In this paper, we propose a new snapshot method for solving the problems and creating snapshots on-line. The proposed snapshot method uses a method of extracting the log records of update operations at the virtual file system layer to enable the snapshot method to operate independently on file systems, virtual block devices, and storage hardwares. In addition, the proposed snapshot mehod creates and manages snapshots for directories and files without interruption to the storage service. Finally, through experiments we measure the snapshot creation time and the performance degradation caused by the snapshot.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.9
• /
• pp.615-625
• /
• 2006

Nonvolatile memory technology is evolving continuously and commercial products such as FeRAM and PRAM are now challenging their markets. As NVRAM has properties of both memory and storage, it can store persistent data objects while allowing fast and random access. To utilize NVRAM for general purpose storing of frequently updated data across power disruptions, some essential features of the file system including naming, recovery, and space management are required while exploiting memory-like properties of NVRAM. Conventional file systems, including even recently developed NVRAM file systems, show very low space efficiency wasting more than 50% of the total space in some cases. To efficiently utilize the relatively expensive NVRAM, we design and implement a new extent-based space-thrifty file system, which we call NEBFS (NVRAM Extent-Based File System). We analyze and compare the space utilization of conventional file systems with NEBFS and validate the results with experimental results observed from running the file system implementations on a system with actual NVRAM installed as well as on systems emulating NVRAM. We show that NEBFS has high space efficiency compared to conventional file systems.

• Journal of Korea Society of Industrial Information Systems
• /
• v.18 no.4
• /
• pp.9-18
• /
• 2013

Flash memory is mostly used on smart devices and embedded systems because of its nonvolatile memory, low power, quick I/O, resistant shock, and other benefits. Generally the typical file systems base on the NAND flash memory are YAFFS2, JFFS2, UBIFS, and etc. In this paper, we had variously made an experiment regarding I/O performance using our schemes and the UBIFS of the latest Linux Kernel. The proposed I/O performance analyses were classified as a sequential access and a random access. Our experiment consists of 6 cases using kmalloc(), vmalloc(), and kmem_cache(). As a result of our experiment analyses, the sequential reading and the sequential rewriting increased by 12%, 11% when the Case 2 has applied vmalloc() and kmalloc() to the UBI subsystem and the UBIFS. Also, the performance improved more by 7.82%, 6.90% than the Case 1 at the random read and the random write.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.5
• /
• pp.1035-1041
• /
• 2004

Currently users are tend to use multimedia data types in their applications. Main features of multimedia data types are large amount of data compared to conventional data types. In this reason, it's hard to load data into main memory and to search. That is the cause of occur disk input and output frequently, and decrease the system performance. In this paper, we describe to have fast and efficient access to multimedia data using index technique. Index method presented by paper consists of two parts : one is index file part for keywords and the other is posting file part for the list of file names. Of course, we use keyword. But user is not charge of memory for the keywords. Users just use natural language to insert, delete and search data what he or she wants. Internally, System makes keywords from natural language to get access to multimedia data. It provides convenience to users. Using this study to develop one's application for multimedia, one may have a chance for advanced performance of a system and getting a result speedily.

• Journal of the Korean Society for Library and Information Science
• /
• v.49 no.1
• /
• pp.379-403
• /
• 2015

Name Authority Control is useful not only to manage author information but also to gather other names of authors in order to provide access points in libraries and other institutes. The purpose of this study is to find problems through comparing and analyzing Literature Translation Institute of Korea Author Database, Korean name authority records of national libraries in the U. S., Japan and Korea. The results of the study are as follows. First, Literature Translation Institute of Korea Author Database missed some useful information about Korean writers in translated books in other countries. Second, the name authority file of Library of Congress and National Diet Library did not include the variant names, dates of authors' birth and death date, and filled out incorrect variant names with some birth and death dates. Third, English and Chinese character variants of Korean authors were not found in the National Library of Korea. To solve these problems, revisions of Korean author database, open access to National Library of Korea name authority file, and a strong participation of VIAF were suggested.

• Journal of Communications and Networks
• /
• v.12 no.1
• /
• pp.52-66
• /
• 2010

Since large objects consume substantial resources, web proxy caching incurs a fundamental trade-off between performance (i.e., hit-ratio and latency) and overhead (i.e., resource usage), in terms of caching and relaying large objects to users. This paper investigates how and to what extent the current dedicated-server based web proxy caching scheme is affected by large file transfers in a high bandwidth campus network environment. We use a series of trace-based performance analyses and profiling of various resource components in our experimental squid proxy cache server. Large file transfers often overwhelm our cache server. This causes a bottleneck in a web network, by saturating the network bandwidth of the cache server. Due to the requests for large objects, response times required for delivery of concurrently requested small objects increase, by a factor as high as a few million, in the worst cases. We argue that this cache bandwidth bottleneck problem is due to the fundamental limitations of the current centralized web proxy caching model that scales poorly when there are a limited amount of dedicated resources. This is a serious threat to the viability of the current web proxy caching model, particularly in a high bandwidth access network, since it leads to sporadic disconnections of the downstream access network from the global web network. We propose a peer-to-peer cooperative web caching scheme to address the cache bandwidth bottleneck problem. We show that it performs the task of caching and delivery of large objects in an efficient and cost-effective manner, without generating significant overheads for participating peers.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.3
• /
• pp.645-653
• /
• 2016

Ransomware was first created in 1999, but its existence become widely known in Korean by 2015. As information and communication technology have developed, the storage capacity of computer has enlarged, it accordingly is getting more important to effectively manage these information, rather than the information itself. In such situation, the ransomware break into other people's computer and encrypt an files without a user's permission. So, it adversely affect the user. In this paper, we monitor an access of a specific process to the file. And on the basis of this monitoring information, we detect whether the abnormal approach happened. Through the detection result, we block the permission about access to the file for a specific process. Using this method, we propose a blocking technique for the ransomeware's abnormal approach and encryption to the files.

• Journal of information and communication convergence engineering
• /
• v.5 no.2
• /
• pp.144-149
• /
• 2007

Grid technologies make it possible for IT resources to be shared across organizational and security domains. The traditional identity-based access control mechanisms are unscalable and difficult to manage. Thus, we propose the FAS (Federation Agent Server) model which is composed of three modules: Certificate Conversion Module (CCM), Role Decision Module (RDM), and Authorization Decision Module (ADM). The proposed FAS model is an extended Role-Based Access Control (RBAC) model which provides resource access capabilities based on roles assigned to the users. FAS can solve the problem of assigning multiple identities to a shared local name in grid-map file and mapping the remote entity's identity to a local name manually.

• Journal of Korea Society of Industrial Information Systems
• /
• v.20 no.5
• /
• pp.13-23
• /
• 2015

This thesis proposes a method for effectively detecting memory errors with low occurrence frequency that may occur depending on runtime situation by analyzing assembly codes obtained by disassembling an executable file. When applying the proposed method to various programs having no compilation error, a total of about 750 potential errors taken about 90 seconds are detected among 1 million lines of assembly codes corresponding to a total of about 10 thousand functions.