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 15, Issue 6 - Dec 2005
Volume 15, Issue 5 - Oct 2005
Volume 15, Issue 4 - Aug 2005
Volume 15, Issue 3 - Jun 2005
Volume 15, Issue 2 - Apr 2005
Volume 15, Issue 1 - Feb 2005
Selecting the target year
Algorithm for The Relative Phase Shifts between PN Sequences Generated by 90/150 Cellular Automata
Cho, Sung-Jin ; Choi, Un-Sook ; Kim, Han-Doo ;
Journal of the Korea Institute of Information Security and Cryptology, volume 15, issue 4, 2005, Pages 3~10
Every cell position of a maximum-length 90/150 cellular automata(CA) generates the same pseudo-noise(PN) sequence corresponding to the characteristic polynomial of the CA with a phase shift. Unlike LFSRs, the phase shift is generally different between stages of a CA. In this paper, we propose an algorithm to compute relative phase shifts between stage of a CA. Our algorithm does not need Shank's algorithm to compute relative phase shifts and does not need any previous phase shifts to compute a phase shift. Moreover it is done in time
Authenticated Identity-based Key Agreement Protocols in a Multiple Independent PKG Environment
Lee Hoonjung ; Kim Hyunsook ; Kim Sangjin ; Oh Heekuck ;
Journal of the Korea Institute of Information Security and Cryptology, volume 15, issue 4, 2005, Pages 11~27
To date, most identity-based key agreement protocols are based on a single PKG (Private Key Generator) environment. In 2002, Chen and Kudla proposed an identity-based key agreement protocol for a multiple PKG environment, where each PKG shares identical system parameters but possesses distinct master key. However, it is more realistic to assume that each PKG uses different system parameters including the PKG's master key. In this paper, we propose a new two party key agreement protocol between users belonging to different PKGs that do not share system parameters. We also extend this protocol to two types of tripartite key agreement protocols. We show that our two party protocol requires minimal amount of pairing computation for a multiple PKG environment and our tripartite protocol is more efficient than existing protocols. We also show that the proposed key agreement protocols satisfy every security requirements of key agreement protocol.
Lightweight Packet Authentication for Access Control in IEEE 802.11
Lee, Keun-Soon ; Kim, Hyo-Jin ; Song, Joo-Seok ;
Journal of the Korea Institute of Information Security and Cryptology, volume 15, issue 4, 2005, Pages 29~38
Because IEEE 802.11 has several security vulnerabilities, IEEE 802.11i was proposed and accepted. But IEEE 802.11i has much overhead for most of users for the web surfing. Besides not only node the authentication but also the packet authentication is needed to communicate. Although IEEE 802.11i uses TKIP(Temporal Key integrity Protocol) and CCMP(CTR with CBC-MAC Protocol), they have a lot of overheads. In this paper, Lightweight Packet Authentication(LIPA) is proposed. LIPA has less overhead and short delay so that it can be affordable for simple web-surfing which does not need stronger security. After comparing performances of LIPA with those of TKIP and CCMP, LIPA is more efficient than other schemes for transmitting packets.
Design and Implementation of the Semi-automated Evaluation Workflow Management System(Sa-EWMS)
Kang Yeon-hee ; Kim Jung-dae ; Lee Gang-soo ;
Journal of the Korea Institute of Information Security and Cryptology, volume 15, issue 4, 2005, Pages 39~50
An evaluation demand and a market growth regarding evaluation and certification are increasing because the importance of information Security is gradually rising to solve the information disfunction. Therefore, it is necessary the cost-effect evaluation management of the Information Security System(ISS). In this paper, we propose the Semi-automated Evaluation Workflow Management System(Sa-EWMS) based on the Common Criteria(CC) which performs and manages evaluation work through the procedure when evaluator evaluates the Information Security System(ISS). The Sa-EWMS is solving a problem of consumption of time and effort and performing efficient evaluation, it is playing a significant role that traces workflow process of each work of the Engines and controls performance. It will be able to use useful the private evaluation enterprise which confront in an evaluation demand and a market growth.
Monitoring System of File Outflow through Storage Devices and Printers
Choi Joo-ho ; Rhew Sung-yul ;
Journal of the Korea Institute of Information Security and Cryptology, volume 15, issue 4, 2005, Pages 51~60
The riles or intellectual property on computer systems have increasingly been exposed to such threats that they can be flowed out by internal users or outer attacks through the network. The File Outflow Monitoring System monitors file outflows at server by making the toe when users copy files on client computers into storage devices or print them, The monitoring system filters I/O Request packet by I/O Manager in kernel level if files are flowed out by copying, while it uses Win32 API hooking if printed. As a result, it has exactly made the log and monitored file outflows, which is proved through testing in Windows 2000 and XP.
Design and Implementation of a Peer-to-Peer Data Sharing Scheme for Closed User Group with Security and Flexibility
Lee Goo-Yeon ; Lee Yong ; Kim Hwa-Jong ; Jeong Choong-Kyo ; Lee Dong-Eun ;
Journal of the Korea Institute of Information Security and Cryptology, volume 15, issue 4, 2005, Pages 61~70
We propose and implement a flexible secure peer-to-peer(P2P) file sharing scheme which can be used for data sharing among closed user group (CUG) members. When a member wants to share data, notification messages are sent to the members with whom the member wants to share data. Each notification message includes one-time password encrypted with the receiver's public key. A member who received the notification message can download the data by using the one-time password. The proposed scheme provides selective sharing, download confirmation and efficient storage management. In terms of security, the proposed scheme supports authentication, entity privacy, replay attack protection and disguise prevention. We also implement the proposed system and find that the system is very useful among P2P service of closed user groups.
RFID Authentication Protocol with Strong Resistance against Traceability and Denial of Service attack
Kang, Jeon-Il ; Nyang, Dae-Hun ;
Journal of the Korea Institute of Information Security and Cryptology, volume 15, issue 4, 2005, Pages 71~82
Though there are many authentication protocols for RFID system, only a few protocols support location privacy. Because of tag's hardware limitation, these protocols suffer from many security threats, especially from DoS (Denial of Service) attack. In this paper, we explain location privacy problem and show vulnerabilities of RFID authentication protocols. And then, we suggest an authentication protocol that is strong against location tracing, spoofing attack and DoS attack
A Method for Detecting the Exposure of an OCSP Responder's Session Private Key in D-OCSP-KIS
Lee, Young-Gyo ; Nam, Jung-Hyun ; Kim, Jee-Yeon ; Kim, Seung-Joo ; Won, Dong-Ho ;
Journal of the Korea Institute of Information Security and Cryptology, volume 15, issue 4, 2005, Pages 83~92
D-OCSP-KIS proposed by Koga and Sakurai not only reduces the number or OCSP Responder's certificate but also criers the certificate status validation about OCSP Responder to the client. Therefore, D-OCSP-KIS is an effective method that can reduce the communication cost, computational time and storage consumption in client, but it has some problems. In case an attacker accidentally acquires an OCSP Responder's session private key in a time period (e.g., one day), she can disguise as the OCSP Responder in the time period unless the OCSP Responder recognizes. She can offer the wrong response to the client using the hash value intercepted. And the server and user on I-commerce can have a serious confusion and damage. And the computation and releasing of hash chain can be a load to CA. Thus, we propose a method detecting immediately the exposure of an OCSP Responder's session private key and the abuse of hash value in D-OCSP-KIS.
An Watermarking Algorithm for Multimodal Biometric Systems
Moon, Dae-Sung ; Jung, Seung-Hwan ; Kim, Tae-Hae ; Chung, Yong-Wha ; Moon, Ki-Young ;
Journal of the Korea Institute of Information Security and Cryptology, volume 15, issue 4, 2005, Pages 93~100
In this paper, we describe biometric watermarking techniques for secure user verification on the remote, multimodal biometric system employing both fingerprint and face information, and compare their effects on verification accuracy quantitatively. To hide biometric data with watermarking techniques, we first consider possible two scenarios. In the scenario 1, we use a fingerprint image as a cover work and hide facial features into it. On the contrary, we hide fingerprint features into a facial image in the Scenario 2. Based on the experimental results, we confirm that the Scenario 2 is superior to the Scenario 1 in terms of the verification accuracy of the watermarking image.
Public Key Cryptosystem Based on Jordan Form
Lee, Hee-Jung ;
Journal of the Korea Institute of Information Security and Cryptology, volume 15, issue 4, 2005, Pages 101~105
Recently a new public key cryptosystem based on a diagonal matrix has been proposed by Zheng. This system uses eigenvalues as a long-term key and random numbers as session key generators. However, there are a couple of flaws in that system. In this paper, we propose a new algorithm in which those flaws are all fixed. Our scheme is based on modular equations over a composite and uses a matrix of Jordan form. We also analyze the security of it.