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
An Implementation and Evaluation of Junk Mail Filtering System to use the FQDN Check and personalized Quarantine Process
Kim, Sung-Chan ; Jun, Moon-Seog ; Choun, Jun-Ho ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 6, 2006, Pages 3~13
Internet mail has become a common communication method to send and receive an amount of data due to the tremendous high speed Internet service increment. But in other respect, the risk and damage of Junk mail is growing rapidly and nowadays Junk mail delivery problem is becoming more serious, because this is used for an attack or propagation scheme of malicious code. It's a most dangerous dominant cause for computer system accident. This paper shows the Junk mail characteristic which is based on the analysis of mail log in reality and then shows the implementation of the FQDN (Fully Qualified Domain Name) check and Personalized classification system and evaluates its performance.
Area Efficient Implementation of 32-bit Architecture of ARIA Block Cipher Using Light Weight Diffusion Layer
Ryu, Gwon-Ho ; Koo, Bon-Seok ; Yang, Sang-Woon ; Chang, Tae-Joo ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 6, 2006, Pages 15~24
Recently, the importance of the area efficient implementation of cryptographic algorithm for the portable device is increasing. Previous ARIA(Academy, Research Institute, Agency) implementation styles that usually concentrate upon speed, we not suitable for mobile devices in area and power aspects. Thus in this paper, we present an area efficient AR processor which use 32-bit architecture. Using new implementation technique of diffusion layer, the proposed processor has 11301 gates chip area. For 128-bit master key, the ARIA processor needs 87 clock cycles to generate initial round keys, n8 clock cycles to encrypt, and 256 clock cycles to decrypt a 128-bit block of data. Also the processor supports 192-bit and 256-bit master keys. These performances are 7% in area and 13% in speed improved results from previous cases.
Efficient RFID Authentication protocol for Distribution Database Environment
Choi, Eun-Young ; Lee, Su-Mi ; Lim, Jong-In ; Lee, Dong-Hoon ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 6, 2006, Pages 25~35
Radio Frequency identification (RFID) will become an important technology in remotely object identification systems. However, the use of RFID tags may create new threats to the sniな and Privacy of individuals holding RFID tags. These threats bring several problems which are information leakage of a tag, location trace of individuals and impersonation of a tag. Low-cost RFID systems have much restrictions such as the limited computing power, passive power mechanism and low storage space. Therefore, the cost of tag's computation should be considered as an important factor in low-cost RFID systems. We propose an authentication protocol, OHLCAP which requires only one one-way hash function operation and hence is very efficient. Furthermore, our protocol is suitable to distribution database environment. Hence our scheme can be applied to ubiquitous computing environment.
Revisiting Permutation Transformation Scheme for Cancelable Face Recognition
Kim, Koon-Soon ; Kang, Jeon-Il ; Lee, Kyung-Hee ; Nyang, Dae-Hun ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 6, 2006, Pages 37~46
It is known to be hard to apply cryptographic one-way functions to the recognition system using bio-information directly. As one of the solutions about that problem there is a permutation transformation scheme. However, they did not show my algorithmic behavior or any performance analysis of the transformation by experiment. In this paper, by showing the recognition ratio of the transformed scheme by experiment, we prove that that scheme is sound. Also, we adopt their transformation to LDA(Linear Discriminant Analysis) to show the experimental results. In the negative side, we introduce a new type of attack against the permutation transformation schemes. finally, we briefly mention a generalization of the permutation transformation for countermeasure of the attack at the end of this paper.
A Policy-based Privacy Authorization System in the Internet Environment
Choi, Hyang-Chang ; Park, Hee-Man ; Lee, Seung-Yong ; Noh, Bong-Nam ; Lee, Hyung-Hyo ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 6, 2006, Pages 47~61
Protecting Fingerprint Data for Remote Applications
Moon, Dae-Sung ; Jung, Seung-Hwan ; Kim, Tae-Hae ; Lee, Han-Sung ; Yang, Jong-Won ; Choi, Eun-Wha ; Seo, Chang-Ho ; Chung, Yong-Wha ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 6, 2006, Pages 63~71
In this paper, we propose a secure solution for user authentication by using fingerprint verification on the sensor-client-server model, even with the client that is not necessarily trusted by the sensor holder or the server. To protect possible attacks launched at the untrusted client, our solution makes the fingerprint sensor validate the result computed by the client for the feature extraction. However, the validation should be simple so that the resource-constrained fingerprint sensor can validate it in real-time. To solve this problem, we separate the feature extraction into binarization and minutiae extraction, and assign the time-consuming binarization to the client. After receiving the result of binarization from the client, the sensor conducts a simple validation to check the result, performs the minutiae extraction with the received binary image from the client, and then sends the extracted minutiae to the server. Based on the experimental results, the proposed solution for fingerprint verification can be performed on the sensor-client-server model securely and in real-time with the aid of an untrusted client.
Three-Party Authenticated Key Exchange Protocol using Smartcards
Jeon, Il-Soo ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 6, 2006, Pages 73~80
Recently, Sun et el. proposed a three-party authenticated key exchange protocol using the public key of the server and the derived verifier from the Password of a user. This paper proposes a password-based three-party authenticated key exchange protocol using smartcards. Since the proposed protocol has very low computation cost by using XOR and hash function operation instead of the public key operation, and reduces the count of message transmission to 20% compared with the protocol of Sun et el., it can execute an effective authenticated key exchange. Furthermore, the proposed protocol is safe from password guessing attack by not saving passwords in the server, and it is also safe from server compromise attack because the server cannot know the shared session key between the two users.
A Study of Detecting Malicious Files using Similarity between Machine Code in Deleted File Slices
Lee, Dong-Ju ; Lee, Suk-Bong ; Kim, Min-Soo ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 6, 2006, Pages 81~93
A file system is an evidence resource of cyber crime in computer forensics. Therefore the methods of recovering the file system and searching important information have been offered. However, the methods for finding a malicious fie in free blocks or slack spaces have not been suggested. In this paper, we propose an investigation method to find a maliciously executable fragmented file. After estimating if a file is executable with a machine code rate, we conclude it could be malicious by comparing a similarity of instruction sequences. To examine instruction sequences, we also propose a method of profiling malicious files using file and a method of comparing the continued scores. As the results, we could exactly pick out the malicious execution files, such as buffer overflow attack program, at fitting threshold level.
A Flexible Approach for Efficient Elliptic Curve Multi-Scalar Multiplication on Resource-constrained Devices
Seo, Seog-Chung ; Kim, Hyung-Chan ; Ramakrishna, R.S. ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 6, 2006, Pages 95~109
Elliptic Curve Cryptosystem (ECC) is suitable for resource-constrained devices such as smartcards, and sensor motes because of its short key size. This paper presents an efficient multi-scalar multiplication algorithm which is the main component of the verification procedure in Elliptic Curve Digital Signature Algorithm (ECDSA). The proposed algorithm can make use of a precomputed table of variable size and provides an optimal efficiency for that precomputed table. Furthermore, the given scalar is receded on-the-fly so that it can be merged with the main multiplication procedure. This can achieve more savings on memory than other receding algorithms. Through experiments, we have found that the optimal sizes of precomputed tables are 7 and 15 when uP+vQ is computed for u, v of 163 bits and 233 bits integers. This is shown by comparing the computation time taken by the proposed algorithm and other existing algorithms.
Negative Selection Algorithm based Multi-Level Anomaly Intrusion Detection for False-Positive Reduction
Kim, Mi-Sun ; Park, Kyung-Woo ; Seo, Jae-Hyun ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 6, 2006, Pages 111~121
As Internet lastly grows, network attack techniques are transformed and new attack types are appearing. The existing network-based intrusion detection systems detect well known attack, but the false-positive or false-negative against unknown attack is appearing high. In addition, The existing network-based intrusion detection systems is difficult to real time detection against a large network pack data in the network and to response and recognition against new attack type. Therefore, it requires method to heighten the detection rate about a various large dataset and to reduce the false-positive. In this paper, we propose method to reduce the false-positive using multi-level detection algorithm, that is combine the multidimensional Apriori algorithm and the modified Negative Selection algorithm. And we apply this algorithm in intrusion detection and, to be sure, it has a good performance.
Authenticated Quantum Secret Sharing using GHZ state swapping
Lee, Duk-Jin ; Lee, Hwa-Yean ; Hong, Chang-Ho ; Lim, Jong-In ; Yang, Hyoung-Jin ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 6, 2006, Pages 123~134
We propose a quantum secret sharing protocol which can authenticate more than half of members using GHZ state swapping. The Trusted Third Party, Trent can authenticate all members using previously shared ID among Trent distributing his message and the members wanting to reconstruct the message. Authenticated members can reconstruct a secret message through GHZ swapping. Moreover, this protocol is efficient to expand the number of members to arbitrary number n, so it is a close quantum secret sharing protocol to classical secret sharing protocol.
The Study on the Effective Prevention Mechanism of Masquerade Attacks on Wireless Ad hoc Network
Hong, Soon-Jwa ; Park, Hyun-Dong ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 6, 2006, Pages 135~149
Securing wireless Ad hoc network including the secure mechanism design and implementation is generally more difficult for vulnerability of channels and nodes, the absence of infrastructure, topology that change dynamically, and etc, than ire network. The efforts of early researches are based on the adaptation of securing methods for the wire network to wireless ad hoc network. However, wireless ad hoc network could not get effective study finding because network has essential problems. This paper proposes that some new problems are being came to light over the survivability and availability of the network itself, that are caused by the massive packet attack of more than one or two nodes, and proves the consequence of this phenomenon. Also, we propose an effective prevention mechanism of masquerade attacks for survivability reinforcement that escape standard of the early way by survivability of wireless Ad hoc network and approaches for performance elevation and reflect special quality of wireless Ad hoc network.
Weakness and Improvements of Yong-Lee's Anonymous Fingerprinting Protocol
Sohn, Ki-Wook ; Lee, Yun-Ho ; Won, Dong-Ho ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 6, 2006, Pages 151~155
In 2005, Yong and Lee proposed a buyer-seller fingerprinting protocol using symmetric and commutative encryptions. They claimed that their protocol was practical and anonymous since they used symmetric and commutative encryptions. However, an attacker can get the content embedded with one or more honest buyers' fingerprints using man-in-the-middle attack. In this letter, we point out the weakness and propose methods for improving to their protocol.
Secure GSM User Authentication Protocol For User Privacy
Park, Mi-Og ; Kim, Chang-Min ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 6, 2006, Pages 157~161
GSM(Global System for Mobile communications) that is the most popular standard for mobile phones, has more than 70% users in the world and the number of users increase continuously. However GSM system has the problem that cannot normally authenticate a user by the exposure of IMSI that is able to uniquely authenticate MS? during the user authentication procedure. In this paper? we provide security enhancement and user privacy by adopting a temporary id and an encryption scheme. Moreover we provide fast user authentication via architecture modification of the conventional GSM user authentication protocol.
New Constructions of Multi-level
with Immediate Authentication
Lim, Chae-Hoon ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 6, 2006, Pages 163~167
is an efficient extension to
to provide an extended lifetime for long-lived sensor networks. This paper presents new constructions of multi-level
with immediate authentication of key chain commitments. The proposed constructions are shown to be more efficient and robust than the previous multi-level