Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
The KIPS Transactions:PartC
Journal Basic Information
Journal DOI :
Korea Information Processing Society
Editor in Chief :
Volume & Issues
Volume 15C, Issue 6 - Dec 2008
Volume 15C, Issue 5 - Oct 2008
Volume 15C, Issue 4 - Aug 2008
Volume 15C, Issue 3 - Jun 2008
Volume 15C, Issue 2 - Apr 2008
Volume 15C, Issue 1 - Feb 2008
Selecting the target year
Analysis of Windows Vista Security System for Forensic Examination
Hwang, Seong-Ho ; Nam, Hyun-Woo ; Park, Neung-Soo ; Jo, Su-Hyung ; Hong, Do-Won ;
The KIPS Transactions:PartC, volume 15C, issue 3, 2008, Pages 141~148
DOI : 10.3745/KIPSTC.2008.15-C.3.141
Windows Vista published by Microsoft provides more powerful security mechanisms than previous Windows operating systems. In the forensics point of view, new security mechanisms make it more difficult to get data related to the criminals in a storage device. In this paper, we analyze BitLocker introduced as an new security mechanism in Windows Vista. Also, compared to the previous Windows operating systems, the changes and security issues of UAC and EFS in Windows Vista are discussed in the forensics point of view. Futhermore, we discuss other characteristics of Windows Vista useful for forensic examinations.
Secure JPEG2000 Steganography by the Minimization of Code-block Noise Variance Changes
Yoon, Sang-Moon ; Lee, Hae-Yeoun ; Joo, Jeong-Chun ; Bui, Cong-Nguyen ; Lee, Heung-Kyu ;
The KIPS Transactions:PartC, volume 15C, issue 3, 2008, Pages 149~156
DOI : 10.3745/KIPSTC.2008.15-C.3.149
JPEG2000 is the upcoming image coding standard that provides better compression rate and image quality compared with JPEG. Lazy-mode steganography guarantees the safe communication under the two information loss stages in JPEG2000. However, it causes the severe changes of the code-block noise variance sequence after embedding and that is detectable under the steganalysis using the Hilbert-Huang transform (HHT) based sequential analysis. In this paper, a JPEG2000 lazy-mode steganography method is presented. The code blocks which produce the sudden variation of the noise variance after embedding are estimated by calculating low precision code-block variance (LPV) and low precision code-block noise variance (LPNV). By avoiding those code-blocks from embedding, our algorithm preserves the sequence and makes stego images secure under the HHT-based steganalytic detection. In addition, it prevents a severe degradation of image quality by using JPEG2000 quality layer information. On various 2048 images, experiments are performed to show the effective reduction of the noise variation after message embedding and the stable performance against HHT-based steganalysis.
Secure Jini Service Architecture Providing Ubiquitous Services Having Persistent States
Kim, Sung-Ki ; Jung, Jin-Chul ; Park, Kyung-No ; Min, Byoung-Joon ;
The KIPS Transactions:PartC, volume 15C, issue 3, 2008, Pages 157~166
DOI : 10.3745/KIPSTC.2008.15-C.3.157
The ubiquitous service environment is poor in reliability of connection and also has a high probability that the intrusion against a system and the failure of the services may happen. Therefore, It is very important to guarantee that the legitimate users make use of trustable services from the viewpoint of security without discontinuance or obstacle of the services. In this paper, we point out the problems in the standard Jini service environment and analyze the Jgroup/ARM framework that has been developed in order to help fault tolerance of Jini services. In addition, we propose a secure Jini service architecture to satisfy the security, availability and quality of services on the basis of the analysis. The secure Jini service architecture we propose in this paper is able to protect a Jini system not only from faults such as network partition or server crash, but also from attacks exploiting flaws. It provides security mechanism for dynamic trust establishment among the service entities. Moreover, our secure Jini service architecture does not incur high computation costs to merge the user service states because of allocation of the replica based on each session of a user. Through the experiment on a test-bed, we have confirmed that proposed secure Jini service architecture is able to guarantee the persistence of the user service states at the level that the degradation of services quality is ignorable.
Fingerprinting Scheme for Contents Protection in Mobile Environment
Yong, Seung-Lim ; Lee, Sang-Ho ;
The KIPS Transactions:PartC, volume 15C, issue 3, 2008, Pages 167~172
DOI : 10.3745/KIPSTC.2008.15-C.3.167
Fingerprinting scheme supports the copyright protection to track redistributors of digital content using cryptographic techniques. Fingerprinting schemes should guarantee buyer`s anonymity and asymmetry for their privacy. Most of known fingerprinting schemes adopt public-key cryptosystems to achieve asymmetry and discrete logarithm problem or graph isomorphism problem to achieve anonymity. However, these schemes are not suited in mobile environment because of the drawbacks of requiring high computational complexity. In this paper, we propose an efficient fingerprinting scheme for mobile environment to provide not only asymmetry of the protocol but also transaction anonymity of the buyer. By employing symmetric encryption to encrypt the digital content and adopting agent to perform the protocols, the efficiency of the proposed scheme is improved.
A Study on Development of Information Security Evaluation Model
Hur, Soon-Haeng ; Lee, Kwang-Woo ; Jo, Hea-Suk ; Jeong, Han-Jae ; Jeon, Woong-Ryul ; Won, Dong-Ho ; Kim, Seung-Joo ;
The KIPS Transactions:PartC, volume 15C, issue 3, 2008, Pages 173~190
DOI : 10.3745/KIPSTC.2008.15-C.3.173
The purposes of this study is development of information security evaluation model for governments to analyze domestic and foreign existing models. Recent domestic information security certification systems have several problems, because shortage of organic connectivity each other. Therefore we analysis on domestic and foreign existing models, specify security requirements, evaluation basis and other facts of models, optimize these facts for governments, and develop new model for domestic governments.
Economic Damage Model on Industries due to Internet Attack and A Case Study
Jang, Jong-Ho ; Chung, Ki-Hyun ; Choi, Kyung-Hee ;
The KIPS Transactions:PartC, volume 15C, issue 3, 2008, Pages 191~198
DOI : 10.3745/KIPSTC.2008.15-C.3.191
Because of the internet development, most of people can acquire the information freely. But it have the disadvantages. A remarkable thing among the disadvantages is the internet attack. Internet attacks were given damages to several fields. Specially, the damage is terrible to the economic side. Specially, company is susceptive to economic damage side. But it didn`t execute a research about model that estimates damage to the economic side due to internet attacks. This paper presents a model that estimates the damage to economic side due to internet attacks.
A Study on CAN Based System Reliability Test
Kim, Jong-Hyun ; Chung, Ki-Hyun ; Choi, Kyung-Hee ;
The KIPS Transactions:PartC, volume 15C, issue 3, 2008, Pages 199~204
DOI : 10.3745/KIPSTC.2008.15-C.3.199
Controller Area Network was developed originally for in-vehicle communication network. But it is now widely used for factory automation because of its properties such as strong noise resistance and high reliabilities. With changing communication environments from peer to peer topology to bus topology, we should check each devices about not only mechanical operations but also electronic or software operations. In this paper, we suggest reliability test environment for CAN based system, which is divided two parts, data correctness and timely delivery.
Designing a Path Management Method in Large-scale Multiple Sensor Networks
Lim, Yu-Jin ; Park, Jae-Sung ; Ahn, Sang-Hyun ;
The KIPS Transactions:PartC, volume 15C, issue 3, 2008, Pages 205~212
DOI : 10.3745/KIPSTC.2008.15-C.3.205
In the environment with multiple heterogeneous wireless sensor networks with a single point of sensed data collection or a gateway (GW), relay points (RPs) may be required for the energy efficient delivery of sensed data from static or mobile sinks to the GW. The optimal placement of RPs becomes an even more difficult problem if static sinks are dynamically added or the trajectory of mobile sinks can not be known in advance. In order to resolve this problem, we propose a mechanism to deploy RPs in a grid pattern and to use the tree-based relaying network for reducing the cost of the RP and for reducing the control overhead incurred by the route setup from sinks to the GW. For the performance evaluation of our proposed mechanism, we have carried out a numerical analysis on a single route setup from a sink to the GW and, for more general performance evaluations, ns-2 based simulations have been carried out. According to the performance evaluation results, our tree-based relaying network mechanism outperforms that based on AODV in terms of the data delivery time, the network service time and the control overhead.
Design and Evaluation of Neighbor-aware AODV Routing Protocol in Mobile Ad-hoc Network
Kim, Cheol-Joong ; Park, Seok-Cheon ;
The KIPS Transactions:PartC, volume 15C, issue 3, 2008, Pages 213~220
DOI : 10.3745/KIPSTC.2008.15-C.3.213
A MANET is an autonomous, infrastructureless system that consists of mobile nodes. In MANET, on-demand routing protocols are usually used because network topology changes frequently. The current approach in case of broken routes is to flag an error and re-initiate route discovery either at the source or at the intermediate node. Repairing these broken links is a costly affair in terms of routing overhead and delay involved. Therefore, this paper propose a NAODV(Neighbor-aware AODV) protocol that stands on the basis of an AODV. It sets up the route rapidly if it operates for setting the route directly by using sequence number of neighbor nodes without re-search the route when the route to destination node is broken. Also, it reduces loss of packets. We use NS-2 for the computer simulation and validate that the proposed scheme is better than general AODV in terms of packet delivery ratio and average end-to-end delay. Also, when the proposed protocol is applied to the large ad-hoc network with multiple nodes, the performance is more efficient.