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 19, Issue 6 - Dec 2009
Volume 19, Issue 5 - Oct 2009
Volume 19, Issue 4 - Aug 2009
Volume 19, Issue 3 - Jun 2009
Volume 19, Issue 2 - Apr 2009
Volume 19, Issue 1 - Feb 2009
Selecting the target year
Study on the Use of Short Group Signature (BBS04) in Real Applications
Kang, Jeon-Il ; Nyang, Dae-Hun ; Lee, Sok-Joon ; Lee, Kyung-Hee ;
Journal of the Korea Institute of Information Security and Cryptology, volume 19, issue 5, 2009, Pages 3~15
The short group signature introduced by Boneh et al. is one of famous anonymous signature schemes. However, for applying it to the real applications, several restrictions should be considered. The perfect anonymity of users, which is given by group signatures, prevents service providers to provide certain services or resources. For this reason, the local linkability which reduces the anonymity of users has to be provided to the service providers. In addition, the group signature keys, which are one-sidedly assigned from a group manager, cannot support the strong exculpability of users. Hence, the short group signature has to be modified for supporting the strong exculpability. In this paper, we perform a study on the use of the short group signature by proposing a few methods for supporting those two properties.
Study of the Improved Fast Correlation Attack on Stream Ciphers
Jeong, Ki-Tae ; Lee, Yu-Seop ; Sung, Jae-Chul ; Hong, Seok-Hie ;
Journal of the Korea Institute of Information Security and Cryptology, volume 19, issue 5, 2009, Pages 17~24
Zhang et al. proposed a improved fast correlation attack on stream ciphers at SAC'08. This attack is based on the fast correlation attack proposed at Crypto'00 and combined with FWT(fast Walsh transform). Given various attack environments, they presented complexities and success probabilities of the proposed attack algorithm. However, we found that our simulation results of the proposed attack algorithm are different from them presented in . In this paper, we correct results of the proposed attack algorithm by analyzing it theoretically. And we propose a threshold of valid bias.
Improved ID-based Authenticated Group Key Agreement Secure Against Impersonation Attack by Insider
Park, Hye-Won ; Asano, Tomoyuki ; Kim, Kwang-Jo ;
Journal of the Korea Institute of Information Security and Cryptology, volume 19, issue 5, 2009, Pages 25~34
Many conference systems over the Internet require authenticated group key agreement (AGKA) for secure and reliable communication. After Shamir  proposed the ID-based cryptosystem in 1984, ID-based AGKA protocols have been actively studied because of the simple public key management. In 2006, Zhou et al.  proposed two-round ID-based AGKA protocol which is very efficient in communication and computation complexity. However, their protocol does not provide user identification and suffers from the impersonation attack by malicious participants. In this paper, we propose improved ID-based AGKA protocol to prevent impersonation attack from Zhou et al.'s protocol. In our protocol, the malicious insider cannot impersonate another participants even if he knows the ephemeral group secret value. Moreover, our protocol reduces the computation cost from Zhou et al.'s protocol.
Privacy Preserving Keyword Search with Access Control based on DTLS
Noh, Geon-Tae ; Chun, Ji-Young ; Jeong, Ik-Rae ; Lee, Dong-Hoon ;
Journal of the Korea Institute of Information Security and Cryptology, volume 19, issue 5, 2009, Pages 35~44
To protect sensitive personal information, data will be stored in encrypted form. However in order to retrieve these encrypted data without decryption, there need efficient search methods to enable the retrieval of the encrypted data. Until now, a number of searchable encryption schemes have been proposed but these schemes are not suitable when dynamic users who have the permission to access the data share the encrypted data. Since, in previous searchable encryption schemes, only specific user who is the data owner in symmetric key settings or has the secret key corresponding to the public key for the encrypted data in asymmetric key settings can access to the encrypted data. To solve this problem, Stephen S. Yau et al. firstly proposed the controlled privacy preserving keyword search scheme which can control the search capabilities of users according to access policies of the data provider. However, this scheme has the problem that the privacy of the data retrievers can be breached. In this paper, we firstly analyze the weakness of Stephen S. Yau et al.'s scheme and propose privacy preserving keyword search with access control. Our proposed scheme preserves the privacy of data retrievers.
Implementation and Evaluation of Secure VoIP Conference System
Kang, Seong-Ku ; Kim, Kyou-Young ; Kim, Joong-Man ; Won, Yoo-Jae ; Ryou, Jae-Cheol ;
Journal of the Korea Institute of Information Security and Cryptology, volume 19, issue 5, 2009, Pages 45~57
In this paper, we implemented the conference system based on DTLS for saving securely the VoIP, which is served sprightly in the latest, securely and tested (and also analyzed) the system. As VoIP technology development, demand of conference system is increased and the related technologies are growed. But Security protocol to protect conference service is getting late than conference technology. In this paper, we studied based on DTLS protocol that can provide function of signaling, channel security, media channel security and application of group key and apply to VoIP conference system based UDP unchanged. In this paper, we searched suggested security protocols based on DTLS can apply to conference system and implement and apply the protocol to conference system. And we tested (and also alayzed) overhead of encryption and key management mechanism.
RFID Tag Search Protocol Preserving Privacy of Reader Holders
Chun, Ji-Young ; Hwang, Jung-Yeon ; Lee, Dong-Hoon ;
Journal of the Korea Institute of Information Security and Cryptology, volume 19, issue 5, 2009, Pages 59~69
RFID tag search system which is used to find a specific tag has an application such as asset management, supply chain, and this search scheme has been given much attention so far. In RFID tag search system, especially, mobility of the reader is important in order to search tags. Therefore, even though the handheld reader cannot connect with the central database because of unreliable wireless connection or remote location, handheld reader should search the specific tag without help of the central database. In addition, in RFID tag search system, users hold not the tag but the reader, the privacy of users should be considered. Since the signal strength of the reader is stronger than that of the tag, the privacy of the reader holder is very important. Recently, in order to solve these problems, a number of RFID tag search schemes have been proposed. However, since these schemes did not consider the privacy of reader holders, there are serious privacy breaches of reader holders. In this paper, we propose efficient RFID tag search protocol for passive tags. Our proposed scheme preserves the privacy of reader holders.
An Efficient Detection and Management Technique of Misbehavior nodes in Ad-hoc Networks
Lee, Yun-Ho ; Lee, Soo-Jin ;
Journal of the Korea Institute of Information Security and Cryptology, volume 19, issue 5, 2009, Pages 71~80
Ad-hoc network consists f mobile nodes, which they are together in the communication. However, if some misbehaving nodes are in network, it is faced to many threats. Therefore, detection and management of misbehaving node are necessary to make confident in Ad-hoc networks. To solve this problem, we use Node Weight Management Server(NWMS), which it manage each node's weight in local area. When NWMS detect misbehaving node, it adds the node's weight and if the node's weight exceeds threshold then NWMS broadcasts the node's information to isolate in network. These mechanisms show that they are highly effective and can reliably detect a multitude of misbehaving node.
An Enhanced Ultralightweight RFID Authentication Protocol Providing Strong Authentication and Privacy
Jeon, Dong-Ho ; Kim, Young-Jae ; Kwon, Hye-Jin ; Jeong, Seon-Yeong ; Kim, Soon-Ja ;
Journal of the Korea Institute of Information Security and Cryptology, volume 19, issue 5, 2009, Pages 81~91
Recently, Chein et al proposed the ultralightweight strong authentication and strong integrity (SASI)protocol, where the tag requrires only simple bitwise operations. Since the tag does not support random number generator to generate a challenge nonce, an attacker can replay old messages and impersonate reader. However, all of the previous ultralightweight authentication schemes are vlunerable to various attacks: de-synk, eavesdropping, impersonating, tracking, DoS, disclosure etc. we analyze the problems of previous proposed ultrlightweight protocols, to overcome these security problems by using PRNG on the tag. Therefore, in this paper we propose a new lightweight RFID mutual authentication protocol that provides random number generator and bitwise operations, a security and an efficiency of the proposed schme analyze.
Self Updatable Pseudonym System for VANET
Kim, Sang-Jin ; Lee, Byeong-Woo ; Oh, Hee-Kuck ;
Journal of the Korea Institute of Information Security and Cryptology, volume 19, issue 5, 2009, Pages 93~103
Since message forgery or alteration in VANET may cause severe consequences, authentication of critical messages must be provided. However, using normal digital signature may infringe privacy of drivers. Therefore, VANET requires authentication systems that provide conditional anonymity. In this paper, we propose a new authentication system for VANET. In our proposed system, each vehicle can update its pseudonym using re-encryption technique and digitally sign messages using representation problem on the pseudonym. By limiting the usage period, revocation of individual pseudonym is not required. Moreover, we also provide a way to revoke the vehicle itself. Secureness of our system partially rely on the usage of tamper-resistance hardware.
Main/Sub Device Authentication and Authorization Protocol in Ubiquitous Office Network
Moon, Jong-Sik ; Lee, Im-Yeong ;
Journal of the Korea Institute of Information Security and Cryptology, volume 19, issue 5, 2009, Pages 105~118
In modern society, as the rapid development of IT technology combined with the computer-based high-speed communication networks makes it possible to provide a wide spectrum of services and devices, we have been confronting a new cultural transformation era, referred to as the information society. However, the requirements to be considered in security aspect have became more complicated and diversified, and there remains the same security weaknesses as in the existing media or protocol. Particularly, the office network device with roaming is susceptible to the different kinds of attacks such as terminal hacking, virus attacks, and information leakage because the computing capacity is relatively low and the loading of already developed security functions is difficult. Although developed as one solution to this problems, PKI security authentication technology isn't suitable for multi-domain environments providing uonments proffice network service, and so the development of a novel authentication system is needed. Therefore, in this paper researched the roaming and device authentication/auth for multitechnology using an ID-based public key, authorization ticket, and Sub-device ticket with a purpose to contribute to the development of the secured and efficient technology.
Adaptation Policy of ISO 27001 ISMS (Information Security Management System) for e-Government
Han, Keun-Hee ;
Journal of the Korea Institute of Information Security and Cryptology, volume 19, issue 5, 2009, Pages 119~130
Korea ranked 2nd in the UN Global e-Participation Index and ranked number one as the leader in e-Government for the third consecutive year. However, Korea ranked 51 in the level of information security published by WEF(World Economic Forum), relatively a low level comparing with its great number of users and excellent environments for the Internet service. A series of critical hacking accidents such as the information leak at Auction and GS Caltex emerged consecutively in 2008 year, resulting in the leak of personal & critical information. This led to a strong interest in the necessity and importance of information security and personal information so that demand for IT security is growing fast. In this paper, we survey to benchmark information security in the perspective of service level, system, investment and policy about major foreign countries. Then we research on an effective way to make the most of the benchmark result to Korea e-Government. In addition, the purpose of this paper is to improve national information security index by developing a policy for ISO 27001 ISMS, an international standard for Information Security Management System, and elevate safety and security of the e-Government serviced by central administrative organizations and local authorities.
A Study on the Quality Model and Metrics for Evaluating the Quality of Information Security Products
Yun, Yeo-Wung ; Lee, Sang-Ho ;
Journal of the Korea Institute of Information Security and Cryptology, volume 19, issue 5, 2009, Pages 131~142
While users of information security products require high-quality products that are secure and have high performance, there are neither examples for evaluating the quality of information security products nor studies on the quality model and metrics for the quality evaluation. In this paper, information security products are categorized into three different types and the security and performance of various information security products are analyzed. Through this process and after consideration of information security products' security and performance, a new quality model that possesses 7 characteristics and 24 sub-characteristics has been defined. In addition, metrics consisting of 62 common and 45 extended metrics that can be used to evaluate the quality of information security products are introduced, and a proposition for a method of generating the quality evaluation metrics for specific information security products is included. The method of generating metrics proposed in this paper can be extended in order to be applied to a variety of information security products, and by generating and verifying the quality evaluation metrics for firewall, intrusion detection systems and fingerprint systems it is shown that it applicable on a variety of information security products.
Preimage Attacks on Step-Reduced ARIRANG
Hong, Deuk-Jo ; Kim, Woo-Hwan ; Koo, Bon-Wook ;
Journal of the Korea Institute of Information Security and Cryptology, volume 19, issue 5, 2009, Pages 143~149
The hash function ARIRANG is one of the 1st round SHA-3 candidates. In this paper, we present preimage attacks on ARIRANG with step-reduced compression functions. Our attack finds a preimage of the 33-step OFF(Original FeedForward1) variants of ARIRANG, and a preimage of the 31-step MFF(Middle FeedForward1) variants of ARIRANG. Its time complexity is about
for ARIRANG-256 and
for ARIRANG-512, respectively.
An Effective Control Method for Improving Integrity of Mobile Phone Forensics
Kim, Dong-Guk ; Jang, Seong-Yong ; Lee, Won-Young ; Kim, Yong-Ho ; Park, Chang-Hyun ;
Journal of the Korea Institute of Information Security and Cryptology, volume 19, issue 5, 2009, Pages 151~166
To prove the integrity of digital evidence on the investigation procedure, the data which is using the MD 5(Message Digest 5) hash-function algorithm has to be discarded, if the integrity was damaged on the investigation. Even though a proof restoration of the deleted area is essential for securing the proof regarding a main phase of a case, it was difficult to secure the decisive evidence because of the damaged evidence data due to the difference between the overall hash value and the first value. From this viewpoint, this paper proposes the novel model for the mobile forensic procedure, named as "E-Finder(Evidence Finder)", to ,solve the existing problem. The E-Finder has 5 main phases and 15 procedures. We compared E-Finder with NIST(National Institute of Standards and Technology) and Tata Elxsi Security Group. This paper thus achieved the development and standardization of the investigation methodology for the mobile forensics.
Differential Fault Analysis on AES by Recovering of Intermediate Ciphertext
Baek, Yi-Roo ; Gil, Kwang-Eun ; Park, Jea-Hoon ; Moon, Sang-Jae ; Ha, Jae-Cheol ;
Journal of the Korea Institute of Information Security and Cryptology, volume 19, issue 5, 2009, Pages 167~174
Recently, Li et al. proposed a new differential fault analysis(DFA) attack on the block cipher ARIA using about 45 ciphertexts. In this paper, we apply their DFA skill on AES and improve attack method and its analysis. The basic idea of our DFA method is that we recover intermediate ciphertexts in last round using final faulty ciphertexts and find out last round secret key. In addition, we present detail DFA procedure on AES and analysis of complexity. Furthermore computer simulation result shows that we can recover its 128-bit secret key by introducing a correct ciphertext and 2 faulty ciphertexts.
Password Authentication Scheme based on Operation of Alpha-numeric Characters on Matrix
Kang, Jeon-Il ; Maeng, Young-Jae ; Nyang, Dae-Hun ; Lee, Kyung-Hee ; Jeun, In-Kyung ;
Journal of the Korea Institute of Information Security and Cryptology, volume 19, issue 5, 2009, Pages 175~188
Besides the passwords have low complexity, they can easily be revealed by the shoulder-surfing attack when they are inputted through the input devices such like keyboard. To overcome these problems, many new authentication schemes, which change the user secret different form or let users input their secrets through the more complex manners, have been suggested, but it is still hard to find the balanced point between usability and security. In this paper, we introduce a new authentication scheme that use the traditional alpha-numeric password as user secret based on operation of them on matrix. We show the security strength of our proposal through the analyses in the various aspects and confirm the difficulty that users feel from our proposal through the user study.
Buffer Overflow Malicious Code Detection by Tracing Executable Area of Memory
Choi, Sung-Woon ; Cho, Jae-Ik ; Moon, Jong-Sub ;
Journal of the Korea Institute of Information Security and Cryptology, volume 19, issue 5, 2009, Pages 189~194
Most of anti-virus programs detect and compare the signature of the malicious code to detect buffer overflow malicious code. Therefore most of anti-virus programs can't detect new or unknown malicious code. This paper introduces a new way to detect malicious code traces memory executable of essentials APIs by malicious code. To prove the usefulness of the technology, 7 sample codes were chosen for compared with other methods of 8 anti-virus programs. Through the simulation, It turns out that other anti-virus programs could detect only a limited portion of the code, because they were implemented just for detecting not heap areas but stack areas. But in other hand, I was able to confirm that the proposed technology is capable to detect the malicious code.
An Experimental Fault Injection Attack on RSA Cryptosystem using Abnormal Source Voltage
Park, Jea-Hoon ; Moon, Sang-Jae ; Ha, Jae-Cheol ;
Journal of the Korea Institute of Information Security and Cryptology, volume 19, issue 5, 2009, Pages 195~200
CRT-based RSA algorithm, which was implemented on smartcard, microcontroller and so on, leakages secret primes p and q by fault attacks using laser injection, EM radiation, ion beam injection, voltage glitch injection and so on. Among the many fault injection methods, voltage glitch can be injected to target device without any modification, so more practical. In this paper, we made an experiment on the fault injection attack using abnormal source voltage. As a result, CRT-RSA's secret prime p and q are disclosed by fault attack with voltage glitch injection which was introduced by several previous papers, and also succeed the fault attack with source voltage blocking for proper period.