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
An Implementation of Database Security Using Steganography in the Web
Moon, Bong-Keun ; Ryoo, Du-Gyu ; Ko, Myung-Sun ; Eom, Ki-Won ; Jun, Moon-Seog ;
Journal of the Korea Institute of Information Security and Cryptology, volume 15, issue 2, 2005, Pages 3~11
As the usage of Internet grows, we share many informations among the others and use more database systems for a various type of data. However, secure database system, which prevents the unauthorized users from modification, deletion, and access, is urgently required for sharing data in Internet. Conventional technologies of a data security are passive methods which depend on several steps with an access control, and these methods are vulnerable against the illegal attack because attacker can see the plain text that is private message. To prevent private data item for the special security from the malicious attack in web database, this paper is devoted to implement database system using steganography method, so we can protect the data item completely because attacker cannot know the secure message although he get the content of database.
Host Anomaly Detection of Neural Networks and Neural-fuzzy Techniques with Soundex Algorithm
Cha, Byung-Rae ; Kim, Hyung-Jong ; Park, Bong-Gu ; Cho, Hyug-Hyun ;
Journal of the Korea Institute of Information Security and Cryptology, volume 15, issue 2, 2005, Pages 13~22
To improve the anomaly IDS using system calls, this study focuses on Neural Networks Learning using the Soundex algorithm which is designed to change feature selection and variable length data into a fixed length learning pattern. That is, by changing variable length sequential system call data into a fixed length behavior pattern using the Soundex algorithm, this study conducted neural networks learning by using a backpropagation algorithm with fuzzy membership function. The back-propagation neural networks and Neuro-Fuzzy technique are applied for anomaly intrusion detection of system calls using Sendmail Data of UNM to demonstrate its aspect of he complexity of time, space and MDL performance.
A New Efficient Private Key Reissuing Model for Identity-based Encryption Schemes Including Dynamic Information
Kim, Dong-Hyun ; Kim, Sang-Jin ; Koo, Bon-Seok ; Ryu, Kwon-Ho ; Oh, Hee-Kuck ;
Journal of the Korea Institute of Information Security and Cryptology, volume 15, issue 2, 2005, Pages 23~36
The main obstacle hindering the wide deployment of identity-based cryptosystem is that the entity responsible for creating the private key has too much power. As a result, private keys are no longer private. One obvious solution to this problem is to apply the threshold technique. However, this increases the authentication computation, and communication cost during the key issuing phase. In this paper, we propose a new effi ient model for issuing multiple private keys in identity-based encryption schemes based on the Weil pairing that also alleviates the key escrow problem. In our system, the private key of a user is divided into two components, KGK (Key Description Key) and KUD(Key Usage Desscriptor), which are issued separately by different parties. The KGK is issued in a threshold manner by KIC (Key Issuing Center), whereas the KW is issued by a single authority called KUM (Key Usage Manager). Changing KW results in a different private key. As a result, a user can efficiently obtain a new private key by interacting with KUM. We can also adapt Gentry's time-slot based private key revocation approach to our scheme more efficiently than others. We also show the security of the system and its efficiency by analyzing the existing systems.
Context Conflicts of Role-Based Access Control in Ubiquitous Computing Environment
Nam Seung-Jwa ; Park Seog ;
Journal of the Korea Institute of Information Security and Cryptology, volume 15, issue 2, 2005, Pages 37~52
Traditional access control models like role-based access control model are insufficient in security needs in ubiquitous computing environment because they take no thought of access control based on user's context or environment condition. In these days, although researches on context-aware access control using user's context or environment conditions based on role-based access control are emerged, they are on the primary stage. We present context definitions md an access control model to provide more flexible and dynamic context-aware access control based on role-based access control. Specially, we describe the conflict problems occurred in the middle of making an access decision. After classifying the conflict problems, we show some resolutions to solve them. In conclusion, we will lay the foundations of the development of security policy and model assuring right user of right object(or resource) and application service through pre-defined context and context classification in ubiquitous computing environments. Beyond the simplicity of access to objects by authorized users, we assure that user can access to the object, resource, or service anywhere and anytime according to right context.
A Secure Routing Scheme for Wireless Sensor Network with a Mobile Sink
Kim Taekvun ; Kim Sangjin ; Lee Ik-Seob ; Yoo Dongyoung ; Oh Heekuck ;
Journal of the Korea Institute of Information Security and Cryptology, volume 15, issue 2, 2005, Pages 53~64
Previous secure routing protocols for wireless sensor networks assume that a sink is static. In many cases, however, a sink operated by man or vehicle is moving. A mobile sink creates a lot of technical problems such as reconfiguration of routing path exposure of sink location. and selection of secure access point node, which are not considered by many previous researches. In this paper, we propose a new secure routing scheme for solving such problems using hi-directional hash chain and delegation nodes of grid structure. This scheme provides a secure routing path and prevents attacker from recognizing the location of a mobile sink in sensor networks. This new method reduces the resource requirements compared to the cashed routing schemes. Simulation results also show that the system is secure and efficient enough.
Security analysis o( proxy signature schemes based on RSA and integer factorization problems
Park Je Hong ; Kang Bo Gyeong ; Han Jae Woo ;
Journal of the Korea Institute of Information Security and Cryptology, volume 15, issue 2, 2005, Pages 65~72
Quite recently, Zhou, Lu and Cao proposed a proxy-protected signature scheme based on the RSA assumption and two proxy-protectcd schemes based on the hardness of integer factorization. Dey also provided a security proof for each signature scheme in the random oracle model. In this paper, we show that their schemes do not satisfy a security requirement necessary for proxy signature schemes. This results in generating proxy signature without fay Permission from an original signer.
Quantum Authentication and Key Distribution protocol based on one-time ID
Lee Hwa-Yean ; Hong Chang-Ho ; Lim Jong-in ; Yang Hyung-Jin ;
Journal of the Korea Institute of Information Security and Cryptology, volume 15, issue 2, 2005, Pages 73~80
We propose a Quantum Authentication and Key distribution protocol based on one-time n using one-way Hash function. The designated users can authenticate each other and the arbitrator using their one-time ID and distribute a quantum secret key using remained GHZ states after authentication procedure. Though the help of the arbitrator is needed in the process of authentication and key distribution, our protocol prevents the arbitrator from finding out the shared secret key even if the arbitrator becomes an active attacker. Unconditional security can be proved in our protocol as the other QKD protocols.
Authenticated Handoff with Low Latency and Traffic Management in WLAN
Choi Jae-woo ; Nyang Dae-hun ; Kang Jeon-il ;
Journal of the Korea Institute of Information Security and Cryptology, volume 15, issue 2, 2005, Pages 81~94
Recently, wireless LAN circumstance is being widely deployed in Public spots. Many People use Portable equipments such as PDA and laptop computer for multimedia applications, and also demand of mobility support is increasing. However, handoff latency is inevitably occurred between both APs when clients move from one AP to another. To reduce handoff latency. in this paper, we suggest WFH(Weighted Frequent Handoff) using effective data structure. WFH improves cache hit ratio using a new cache replacement algorithm considering the movement pattern of users. It also reduces unessential duplicate traffics. Our algorithm uses FHR(Frequent Handoff Region) that can change pre-authentication lesion according to QoS based user level, movement Pattern and Neighbor Graph that dynamically captures network movement topology.
Guess-then-Reduce Methods for Convolution Modular Lattices
Han Daewan ; Hong Jin ; Yeom Yongjin ;
Journal of the Korea Institute of Information Security and Cryptology, volume 15, issue 2, 2005, Pages 95~103
Convolution modular lattices appeared in the analysis of NTRU public key cryptosystem. We present three guess-then-reduce methods on convolution modular lattices, and apply them to practical parameters of NTRU. For the present our methods don't affect significantly the security of them. However, Hey have room for improvement and can be used to estimate mole closely the security of systems related to convolution modular lattices.
The Analysis of State-Transition of SACA over GF(2p)
Cho Sung-Jin ; Hwang Yoon-Hee ; Kim Han-Doo ; Pyo Yong-Soo ; Choi Un-Sook ;
Journal of the Korea Institute of Information Security and Cryptology, volume 15, issue 2, 2005, Pages 105~111
Though GF(2) CA can only handle data with bit units GF(2p) CA can handle data with units more than bit units. In this paper we analyze the state-transition of nongroup cellular automata(CA) with a single attractor over GF(2p). And we propose the constructing method the state-transition diagram of a linear SACA over GF(2p) by using the concept of basic path. Also we propose the state-transition diagram of the nonlinear complemented SACA by using the state-transition diagram of a linear SACA.
Multi-Watermarking for Image Authentication Based on DWT Coefficients
Lee Hye-Ran ; Rhee Kyung-Hyune ;
Journal of the Korea Institute of Information Security and Cryptology, volume 15, issue 2, 2005, Pages 113~122
In this paper, we propose a multi-watermarking algorithm to satisfy two purposes: fragility against malicious attacks and robustness against non-malicious attacks. The algorithm can be used for image authentication using coefficients of Discrete Wavelet Transform(DWT). In the proposed method, watermarks are generated by combining binary image with some features extracted from the subband LL3, and then they are embedded into both the spatial and frequency domain. That is, on the spatial domain they are embedded into the Least Significant Bit(LSB) of all pixels of image blocks, and on the frequency domain the coefficients of the subband LH2 and HL2 are adjusted according to the watermarks. Thus the algorithm not only resists malicious attack but also permits non-malicious attacks such as blurring, sharpening, and JPEG compression.