• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.5
• /
• pp.282-296
• /
• 2013

With the emergence of cloud computing, more and more sensitive user data are outsourced to remote storage servers. The privacy of users' access pattern to the data should be protected to prevent un-trusted storage servers from inferring users' private information or launching stealthy attacks. Meanwhile, the privacy protection schemes should be efficient as cloud users often use thin client devices to access the data. In this paper, we propose a lightweight scheme to protect the privacy of data access pattern. Comparing with existing state-of-the-art solutions, our scheme incurs less communication and computational overhead, requires significantly less storage space at the user side, while consuming similar storage space at the server. Rigorous proofs and extensive evaluations have been conducted to show that the proposed scheme can hide the data access pattern effectively in the long run after a reasonable number of accesses have been made.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2001.10a
• /
• pp.128-131
• /
• 2001

With the advent of the Internet, data centric computing applications, and e-business applications, virtually all network-stored data has become mission critical in nature. This increasing reliance on the access to enterprise data is challenging the limitations of traditional server-storage solutions. As a result, the ongoing need to add more storage, serve more users and back up more data has given rise to the concept of a SAN(Storage Area Network), “a network whose primary purpose is the transfer of data between computer systems and storage elements and among storage elements.” The purpose of this article is to help the managers and researchers make the understanding of a SAN as the possibility of new data repository in e-business era. This paper provides a thorough literature review on this new concept including its structure, its benefits and disadvantages, and its underlying issues.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1994.10a
• /
• pp.801-805
• /
• 1994

멀티미디어(화상,음성,하이퍼텍스트)의 데이터는 다른 데이터와 상이점이 많아 운용에 어려움이 있다. 대용량의 저장용량(storage)의 필요, 데이터 통신의 어려움 등이 빠르게 발전하는 멀티미디어 기술에 제약조건이 된다. 본 연구에서는 멀티미디어 데이터가 일 반적인 텍스트(Text)데이터와 같이 높은 수행도(Performance) 및 안정적인 데이터베이스 (Database)로 구축되어 효율적으로 운용 되는데 중점을 둔다. 아울러 대량의 정보를 처리하기 위하여 서버(server)와 클라이언트(Client)기법을 이용한 분산처리로 실시간 처리 및 데이터 저장의 한계를 극복하고자 한다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.4
• /
• pp.971-980
• /
• 2017

Data deduplication can be utilized to reduce storage space in cloud storage services by storing only a single copy of data rather than all duplicated copies. Users who are concerned the confidentiality of their outsourced data can use secure encryption algorithms, but it makes data deduplication ineffective. In order to reconcile data deduplication with encryption, Liu et al. proposed a new server-side cross-user deduplication scheme by exploiting password authenticated key exchange (PAKE) protocol in 2015. In this paper, we demonstrate that this scheme has side channel which causes insecurity against the confirmation-of-file (CoF), or duplicate identification attack.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.603-608
• /
• 2005

Disk I/O is a major performance bottleneck of web proxy server. Today's most web proxy sowers are design to run on top of a general purpose file system. But general purpose file system can not efficiently handle web cache workload, small files, leading to the performance degradation of entire web proxy servers. In this paper we evaluate the performance potential of raw disk to reduce disk I/O overhead of web proxy servers. To show the performance potential of raw disk, we design a storage management system called Block-structured Storage Management System (BSMS). And we also actually implement web proxy server that incorporate BSMS in Squid. Comprehensive experimental evaluations show that raw disk can be a good solution to improve disk I/O performance significantly for web proxy servers.

• Journal of Biomedical Engineering Research
• /
• v.19 no.3
• /
• pp.305-312
• /
• 1998

A small PACS based on PC is designed for CR. To receive the digital image from CR, a DICOM Interface Unit (DIU) is designed that complied with the medical image standard, DICOM V3.0. The CR images acquired through the DIU are stored in a file-server; the patient information of the images is stored in a database. To improve the performance of PC and to use it easily, multiresolution images are constructed by wavelet transform and displayed progressively. Wavelet compression method is newly adopted to store the images hierarchically to storage units. In this compression method, the image is decomposed into subclasses of image by wavelet transform, and then the subclasses of the image are vector quantized using a multiresolution codebook. The storage units for CR images were divided into the short-term storage in file-server and the harddisk in viewing station. Image processing tools supported by general PACS is implemented based on PC.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2608-2617
• /
• 1999

One of the most important functionality that commercial video storage servers should provide is to maximize the number of concurrent streams and to minimize the initial latency of new requests. In this paper, we propose a data placement scheme whose disk read unit size can be twice large than that of conventional striping methods. The proposed scheme can significantly increase the number of concurrent streams, since the ratio of rotational latency time is decreased and the disks are effectively utilized. The disk scheduling scheme we propose guarantees constant initial latency time. We also propose a procedural design method for a storage server by introducing the concept of allowed initial latency. The comparison with previous research shows that the proposed scheme provides better performance.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.12
• /
• pp.569-576
• /
• 2013

Cloud computing has been receiving increasing attention recently. Despite this attention, security is the main problem that still needs to be addressed for cloud computing. In general, a cloud computing environment protects data by using distributed servers for data storage. When the amount of data is too high, however, different pieces of a secret key (if used) may be divided among hundreds of distributed servers. Thus, the management of a distributed server may be very difficult simply in terms of its authentication, encryption, and decryption processes, which incur vast overheads. In this paper, we proposed a efficiently data storage and recovery scheme using XOR and RAID in Hadoop environment.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.221-228
• /
• 2005

Data storage was thought to be inside of or next to server cases but advances in networking technology make the storage system to be located far away from the main computer. In Internet era with explosive data increases, balanced development of storage and transmission systems is required. SAN(Storage Area Network) and NAS(Network Attached Storage) reflect these requirements. It is important to know the capacity and limit of the complex storage network system to got the optimal performance from it. The capacity data is used for performance tuning and making purchasing decision of storage. This paper suggests an analytic model of storage network system as queuing network and proves the model though simulation model.

• Journal of KIISE:Databases
• /
• v.29 no.1
• /
• pp.15-26
• /
• 2002

Most work on multimedia storage systems has assumed that client will be serviced using a round-robin strategy. The server services the clients in rounds and each client is allocated a time slice within that round. Furthermore, most such algorithms are evaluated on the basis of a tightly coupled cost function. This is the basis of well-known algorithm such as FCFS, SCAN, SCAN-EDF, etc. In this paper, we describe a scheduling module called Request Unifier(RU) that takes as input, a set of client request, and a set of constraints on the desired performance such as client waiting time or maximum disk bandwidth, and a cost function. It produces as output a Unified Read Request(URR), telling the storage server which data items to read and when these data items to be delivered to the clients. Given a cost function, a URR is optimal if there is no other URR satisfying the constraints with a lower cost. We present three algorithms in this paper that can accomplish this kind of request merging and compare their performance through an experimental evaluation.