Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of the Korea Institute of Information Security and Cryptology
Journal Basic Information
Journal DOI :
Korea Institutes of Information Security and Cryptology
Editor in Chief :
Volume & Issues
Volume 16, Issue 6 - Dec 2006
Volume 16, Issue 5 - Oct 2006
Volume 16, Issue 4 - Aug 2006
Volume 16, Issue 3 - Jun 2006
Volume 16, Issue 2 - Apr 2006
Volume 16, Issue 1 - Feb 2006
Selecting the target year
Secure Direct Communication protocol Using Entanglement Swapping
Hong Chang-ho ; Lee Hwa-yean ; Kim Ji-in ; Lim Jong-in ; Yang Hyung-jin ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 1, 2006, Pages 3~12
We propose a direct communication protocol using entanglement swapping. The safety of this protocol is guaranteed by the basic properties of entanglement swapping. This protocol is efficient to transmit two classical bits of information per one session. This efficiency is better than that of ping-pong protocol suggested by Bostrom and Felbinger. Even if an eavesdropper intervenes in midway, the eavesdropper will be detected with the probability of
in the verification process of one bit. Therefore the perfect security is guaranteed if we use enough amount of bits for the verification process.
Two Factor Face Authentication Scheme with Cancelable Feature
Kang, Jeon-Il ; Lee, Kyung-Hee ; Nyang, Dae-Hun ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 1, 2006, Pages 13~21
Though authentication using biometric techniques has conveniences for people, security problems like the leakage of personal bio-information would be serious. Even if cancelable biometric is a good solution for the problems, only a few biometric authentication scheme with cancelable feature has been published. In this paper, we suggest a face authentication scheme with two security factors: password and face image. Using matching algorithm in the permuted domain, our scheme is designed to be cancelable in the sense that templates that is composed of permutation and weight vector can be changed freely.
ID-based Authenticated Key Agreement for Unbalanced Computing Environment
Choi Kyu-young ; Hwang Jung-yeon ; Hong Do-won ; Lee Dong-hoon ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 1, 2006, Pages 23~33
Key Agreement protocols are among the most basic and widely used cryptographic protocols. In this paper we present an efficient O-based authenticated key agreement (AKA) protocol by using bilinear maps, especially well suited to unbalanced computing environments : an ID-based AKA protocol for Server and Client. Particularly, considering low-power clients' devices, we remove expensive operations such as bilinear maps from a client side. Our protocol uses signcryption and provide security in random oracle model.
A Reputation Compensation Protocol For Mobile Ad Hoc Networks
Lei, Zhu ; Kang, Jeon-Il ; Nyang, Dae-Hun ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 1, 2006, Pages 35~44
The area of ad hoc networking has been receiving increasing attention among researchers in recent years and a variety of routing protocols targeted specifically at the ad hoc networking environment have been proposed. Selfish nodes are those which do not perform certain operations that the protocol specifies that they should, through a wish to conserve power. We propose a scheme as a mean to mitigate the detrimental effect of selfish nodes. We also propose a new area that might affect nodes' behavior - the environment's influence. In order to let nodes fairly be able to communicate in the networks we proposed solution to this problem. And our scheme can be applied to other reputation methods. We also contain the simulation results in our paper, and through the result, we can conclude that we can solve the problem by adding a little overhead.
A Study on Optimizing Quantization Steps for QIM Watermarking Schemes
Lee, Yun-Ho ; Lee, Kwang-Woo ; Kim, Seung-Joo ; Yang, Hyung-Kyu ; Won, Dong-Ho ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 1, 2006, Pages 45~53
In this paper, we propose a method for enlarging quantization steps of a QIM watermarking scheme which determines the perceptual quality and robustness of the watermarked images. In general, increasing the quantization steps leads to good robustness but poor perceptual quality of watermarked images and vice versa. However, if we choose the quantization steps considering the expected quantization results as well as the original images, we can increase both robustness and perceptual quality of the watermarked images.
Design and Theoretical Analysis of a Stepwise Intrusion Prevention Scheme
Ko Kwangsun ; Kang Yong-hyeog ; Eom Young Ik ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 1, 2006, Pages 55~63
Recently, there is much abnormal traffic driven by several worms, such as Nimda, Code Red, SQL Stammer, and so on, making badly severe damage to networks. Meanwhile, diverse prevention schemes for defeating abnormal traffic have been studied in the academic and commercial worlds. In this paper, we present the structure of a stepwise intrusion prevention system that is designed with the feature of putting limitation on the network bandwidth of each network traffic and dropping abnormal traffic, and then compare the proposed scheme with a pre-existing scheme, which is a True/False based an anomaly prevention scheme for several worm-patterns. There are two criteria for comparison of the schemes, which are Normal Traffic Rate (NTR) and False Positive Rate (FPR). Assuming that the abnormal traffic rate of a specific network is
during a predefined time window, it is known that the average NTR of our stepwise intrusion prevention scheme increases by the factor of (1+
)/2 than that of True/False based anomaly prevention scheme and the average FPR of our scheme decrease by the factor of (1+
Finding New Algebraic Relations on Some Combiners with Memory And Its Applications
Kim, Jaeheon ; Han, Jae-Woo ; Moon, Dukjae ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 1, 2006, Pages 65~70
It is hewn that we can apply algebraic attacks on combiners with memory such as summation generators. [1,8] To apply algebraic attacks on combiners with memory, we need to construct algebraic relations between the keystream bits and the initial bits of the LFSRs. Until now, all known methods produce algebraic relations involving several consecutive bits of keystream. [l.4.8] In this paper, we show that algebraic relations involving only one keystream bit can be constructed for summation generators. We also show that there is an algebraic relation involving only one keystream bit for ISG (9) proposed by Lee and Moon. Using this fact, we analyze the keystream generators which generate the keystreams by combining summation generators.
Network Attack Detection based on Multiple Entropies
Kim Min-Taek ; Kwon Ki Hoon ; Kim Sehun ; Choi Young-Woo ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 1, 2006, Pages 71~77
Several network attacks, such as distributed denial of service (DDoS) attack, present a very serious threat to the stability of the internet. The threat posed by network attacks on large networks, such as the internet, demands effective detection method. Therefore, a simple intrusion detection system on large-scale backbone network is needed for the sake of real-time detection, preemption and detection efficiency. In this paper, in order to discriminate attack traffic from legitimate traffic on backbone links, we suggest a relatively simple statistical measure, entropy, which can track value frequency. Den is conspicuous distinction of entropy values between attack traffic and legitimate traffic. Therefore, we can identify what kind of attack it is as well as detecting the attack traffic using entropy value.
Padding Oracle Attacks on Multiple Modes of Operation
Lee, Tae-Keon ; Kim, Jong-Sung ; Lee, Chang-Hoon ; Lee, Sangjin ; Sung, Jae-Chul ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 1, 2006, Pages 79~85
This attack requires an oracle which on receipt of a ciphertext, decrypts it and replies to the sender whether the padding is VALID or INVALID. In this paper we extend these attacks to other kinds of modes of operation for block ciphers. Specifically, we apply the padding oracle attacks to multiple modes of operation with various padding schemes. As a results of this paper, 12 out of total 36 double modes and 22 out of total 216 triple modes are vulnerable to the padding oracle attacks. It means that the 12 double modes and the 22 triple modes exposed to these types of attacks do not offer the better security than single modes.
A Study of Memory Information Collection and Analysis in a view of Digital Forensic in Window System
Lee Seok-Hee ; Kim Hyun-Sang ; Lim JongIn ; Lee SangJin ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 1, 2006, Pages 87~96
In this paper, we examine general digital evidence collection process which is according to RFC3227 document[l], and establish specific steps for memory information collection. Besides, we include memory dump process to existing digital evidence collection process, and examine privacy information through dumping real user's memory and collecting pagefile which is part of virtual memory system. Especially, we discovered sensitive data which is like password and userID that exist in the half of pagefiles. Moreover, we suggest each analysis technique and computer forensic process for memory information and virtual memory.
Key Management Scheme for Providing the Confidentiality in Mobile Multicast
Roh Jong-Hyuk ; Jin Seung-Hun ; Lee Kyoon-Ha ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 1, 2006, Pages 97~104
For successfully deploying many multicast service in the mobile environment, security infrastructures must be developed that manage the keys needed to provide access control to content. In this paper, we propose two methods for designing the key management scheme for the mobile multicast environment. The proposed schemes match the key management tree to the mobile multicast environment for localizing the delivery of he rekeying messages, reducing the communication costs, and solving the handoff problem in wireless region.
Study on the OMAC-SNEP for Unattended Security System Using Wireless Sensor Networks
Lee Seong-Jae ; Kim Hak-Beom ; Youm Heung-Youl ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 1, 2006, Pages 105~114
Ubiquitous Sensor Network consists of a number of sensor nodes with a limited computation power and limited communication capabilities, and a sensor node is able to communicate with each other at anytime and in any place. Due to the rapid research and development in sensor networks, it will rapidly grow into environments where hmm beings can interact in an intuitive way with sensing objects which can be PDAs, sensors, or even clothes in the future. We are aiming at realizing an Unattended Secure Security System to apply it to Ubiquitous Sensor Network. In this paper, the vulnerabilities in the Unattended security system are identified, and a new protocol called OMAC-SNEP is proposed for the Unattended Secure Security System. Because the CBC-MAC in SNEP is not secure unless the message length is fixed, the CBC-MAC in SNEP was replaced with OMAC in SNEP. We have shown that the proposed protocol is secure for my bit length of messages and is almost as efficient as the CBC-MAC with only one key. OMAC-SNEP can be used not only in Unattended Security System, but also any other Sensor Networks.
Sequence based Intrusion Detection using Similarity Matching of the Multiple Sequence Alignments
Kim Yong-Min ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 1, 2006, Pages 115~122
The most methods for intrusion detection are based on the misuse detection which accumulates hewn intrusion information and makes a decision of an attack against any behavior data. However it is very difficult to detect a new or modified aoack with only the collected patterns of attack behaviors. Therefore, if considering that the method of anomaly behavior detection actually has a high false detection rate, a new approach is required for very huge intrusion patterns based on sequence. The approach can improve a possibility for intrusion detection of known attacks as well as modified and unknown attacks in addition to the similarity measurement of intrusion patterns. This paper proposes a method which applies the multiple sequence alignments technique to the similarity matching of the sequence based intrusion patterns. It enables the statistical analysis of sequence patterns and can be implemented easily. Also, the method reduces the number of detection alerts and false detection for attacks according to the changes of a sequence size.