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 17, Issue 6 - Dec 2007
Volume 17, Issue 5 - Oct 2007
Volume 17, Issue 4 - Aug 2007
Volume 17, Issue 3 - Jun 2007
Volume 17, Issue 2 - Apr 2007
Volume 17, Issue 1 - Feb 2007
Selecting the target year
Modification of Finite Field Based S-box and Its Transform Domain Analysis
Jin, Seok-Yong ; Baek, Jong-Min ; Song, Hong-Yeop ;
Journal of the Korea Institute of Information Security and Cryptology, volume 17, issue 3, 2007, Pages 3~15
In this paper, we propose a simple scheme which produces a new S-box from a given S-box. We use well-known conversion technique between the polynomial functions over a finite field
and the boolean functions from
. We have applied this scheme to Rijndael S-box and obtained 29 new S-boxes, whose linear complexities are improved. We investigate their cryptographic properties via transform domain analysis.
Improvement in efficiency on ID-based Delegation Network
Youn, Taek-Young ; Jeong, Sang-Tae ; Park, Young-Ho ;
Journal of the Korea Institute of Information Security and Cryptology, volume 17, issue 3, 2007, Pages 17~25
Delegation of signing capability is a common practice in various applications. Mambo et al. proposed a proxy signatures as a solutions for delegation of signing capability. Proxy signatures allow a designated proxy signer to sign on behalf of an original signer. After the concept of proxy signature scheme is proposed, many variants are proposed to support more general delegation setting. To capture all possible delegation structures, the concept of delegation network was proposed by Aura. ID-based cryptography, which is suited for flexible environment, is desirable to construct a delegation network. Chow et al proposed an ID-based delegation network. In the computational point of view, their solution requires E pairing operations and N elliptic curve scalar multiplications where E and N are the number of edges and nodes in a delegation structure, respectively. In this paper, we proposed an efficient ID-based delegation network which requires only E pairing operations. Moreover, we can design a modified delegation network that requires only N pairing operations.
Analysis for the difficulty of the vector decomposition problem
Kwon, Sae-Ran ; Lee, Hyang-Sook ;
Journal of the Korea Institute of Information Security and Cryptology, volume 17, issue 3, 2007, Pages 27~33
Recently, a new hard problem on a two dimensional vector space called vector decomposition problem (VDP) was proposed by M. Yoshida et al. and proved that it is at least as hard as the computational Diffe-Hellman problem (CDHP) on a one dimensional subspace under certain conditions. However, in this paper we present the VDP relative to a specific basis can be solved in polynomial time although the conditions proposed by M. Yoshida on the vector space are satisfied. We also suggest strong instances based on a certain type basis which make the VDP difficult for any random vector relative to the basis. Therefore, we need to choose the basis carefully so that the VDP can serve as the underlying intractable problem in the cryptographic protocols.
On the Optimal Key Size of the Even-Mansour Cipher in the Random Function Oracle Model
Sung, Jae-Chul ;
Journal of the Korea Institute of Information Security and Cryptology, volume 17, issue 3, 2007, Pages 35~42
We describe the problem of reducing the key material in the Even-Mansour cipher without security degradation. Even and Mansour proposed a block cipher based on XORing secret key material just prior to and after applying random oracle permutation P such that
. Recently, Gentry and Ramzan showed that this scheme in the random permutation oracle can be replaced by the four-round Feistel network construction in the random function oracle and also proved that their scheme is super-pseudorandom. In this paper we reduce the key size from 2n to n, which is the optimal key size of Even-Mansour cipher in the random function oracle model and also give almost the same level of security.
A Hybrid Modeling Method for RCS Worm Simulation
Kim, Jung-Sik ; Park, Jin-Ho ; Cho, Jae-Ik ; Choi, Kyoung-Ho ; Im, Eul-Gyu ;
Journal of the Korea Institute of Information Security and Cryptology, volume 17, issue 3, 2007, Pages 43~53
Internet becomes more and more popular, and most companies and institutes use web services for e-business and many other purposes. With the explosion of Internet, the occurrence of cyber terrorism has grown very rapidly. Simulation is one of the most widely used method to study internet worms. But, it is quite challenging to simulate very large-scale worm attacks because of various reasons. In this paper, we propose a hybrid modeling method for RCS(Random Constant Spreading) worm simulation. The proposed hybrid model simulates worm attacks by synchronizing modeling network and packet network. So, this model will be both detailed enough to generate realistic packet traffic, and efficient enough to model a worm spreading through the Internet. Moreover, our model have the capability of dynamic updates of the modeling parameters. Finally, we simulate the hybrid model with the CodeRed worm to show validity of our proposed model for RCS worm simulation.
Certificate Issuing using Proxy Signature and Threshold Signature in Self-initialized Ad Hoc Network
Kang, Jeon-Il ; Choi, Young-Geun ; Kim, Koon-Soon ; Nyang, Dae-Hun ;
Journal of the Korea Institute of Information Security and Cryptology, volume 17, issue 3, 2007, Pages 55~67
In ad hoc network, especially in the environment which the system authority only exists at the beginning of the network, it is very important problem how to issue the certificates in self-initialized public key scheme that a node generates its certificate with public and private key pair and is signed that by the system authority. In order to solve this problem, early works present some suggestions; remove the system authority itself and use certificate chain, or make nodes as system authorities for other nodes' certificates. In this paper, we suggest another solution, which can solve many problem still in those suggestions, using proxy signature and threshold signature, and prove its performance using simulation and analyse its security strength in many aspects.
An Effective Anonymization Management under Delete Operation of Secure Database
Byun, Chang-Woo ; Kim, Jae-Whan ; Lee, Hyang-Jin ; Kang, Yeon-Jung ; Park, Seog ;
Journal of the Korea Institute of Information Security and Cryptology, volume 17, issue 3, 2007, Pages 69~80
To protect personal information when releasing data, a general privacy-protecting technique is the removal of all the explicit identifiers, such as names and social security numbers. De-identifying data, however, provides no guarantee of anonymity because released information can be linked to publicly available information to identify them and to infer information that was not intended for release. In recent years, two emerging concepts in personal information protection are k-anonymity and
-diversity, which guarantees privacy against homogeneity and background knowledge attacks. While these solutions are signigicant in static data environment, they are insufficient in dynamic environments because of vulnerability to inference. Specially, the problem appeared in record deletion is to deconstruct the k-anonymity and
-diversity. In this paper, we present an approach to securely anonymizing a continuously changeable dataset in an efficient manner while assuring high data quality.
A UMTS Key Agreement Protocol Providing Privacy and Perfect Forward Secrecy
Kim, Dae-Young ; Cui, Yong-Gang ; Kim, Sana-Jin ; Oh, Hee-Kuck ;
Journal of the Korea Institute of Information Security and Cryptology, volume 17, issue 3, 2007, Pages 81~90
In the UMTS (Universal Mobile Telecommunication System), which is one of 3G mobile communication standards, the protocol called UMTS AKA (Authentication and Key Agreement) is used to authenticate mobile stations. However, the UMTS AKA protocol has some weakness, including network bandwidth consumption between a SN (Serving Network) and a HN (Home Network) and SQN (SeQuence Number) synchronization. In this paper, we propose a new improved protocol for UMTS that overcomes UMTS AKA weakness. Our protocol solves the privacy problem caused by IMSI (International Mobile Subscriber Identity)'s disclosure and provides perfect forward secrecy using ECDH (Elliptic Curve Diffie Hellman).
Authentication Mechanism for Secure Fast Handover in HMIPv6
Kim, Min-Kyoung ; Kang, Hyun-Sun ; Park, Chang-Seop ;
Journal of the Korea Institute of Information Security and Cryptology, volume 17, issue 3, 2007, Pages 91~100
In this paper, We design and propose a protocol for supporting secure and efficient mobility in integrating fast handover and HMIPv6. In the proposed protocol which is AAA-based HMIPv6, if the MN enters the MAP domain for the first time, then it performs an Initial Local Binding Update for authentication. We propose a secure Fast Handover method using the ticket provided by MAP, which includes the secret key for authentication. Also, we analyze and compare security properties of our proposed scheme with those of other scheme using various attack scenario.
Efficient Non-Cryptographic Protocols for Public key Authentication in Wireless Sensor Network
Mohaisen, Abedelaziz ; Maeng, Young-Jae ; Nyang, Dae-Hun ;
Journal of the Korea Institute of Information Security and Cryptology, volume 17, issue 3, 2007, Pages 101~108
We follow the promising recent results of deploying the public key cryptography in sensor networks. Recent results have shown that the public key algorithms are computationally feasible on the typical sensor nodes. However, once the public key cryptography is brought to the sensor network, security services such like key authentication will be critically required. In this paper we investigate the public key authentication problem in the sensor network and provide several authentication protocols. Our protocols are mainly based on the non-solvable overhearing in the wireless environment and a distributed voting mechanism. To show the value of our protocols, we provide an extensive analysis of the used resources and the resulting security level. As well, we compare our work with other existing works. For further benefit of our protocols, we list several additional applications in the sensor network where our protocols provide a sufficient authentication under the constrained resources.
Guess-and-Determine Attack on the Variant of Self Shrinking Generator
Lee, Dong-Hoon ; Han, Jae-Woo ; Park, Sang-Woo ; Park, Je-Hong ;
Journal of the Korea Institute of Information Security and Cryptology, volume 17, issue 3, 2007, Pages 109~116
In this paper, we analyse the security of the variant of Self-Shrinking generator proposed by Chang et al. against a guess-and-determine attack. This variant, which we call SSG-XOR is claimed to have better cryptographic properties than the Self-Shrinking generator in a practical setting. But we show that SSG-XOR is weaker than the Self-Shrinking generator from the viewpoint of guess-and-determine attack.
A Blinding-Based Scalar Multiplication Algorithm Secure against Power Analysis Attacks
Kim, Chang-Kyun ; Ha, Jae-Cheol ; Moon, Sang-Jae ;
Journal of the Korea Institute of Information Security and Cryptology, volume 17, issue 3, 2007, Pages 117~121
Most existing countermeasures against classical DPA are vulnerable to new DPA, e.g., refined power analysis attack (RPA), zero-value point attack (ZPA), and doubling attack. More recently, Mamiya et al proposed a new countermeasure (so-called BRIP) against RPA, ZPA, classical DPA and SPA. This countermeasure, however, also has a vulnerability of scalar multiplication computations by exploiting specially chosen input message. Therefore, to prevent various power analysis attacks like DPA and new SPA, we propose an enhanced countermeasure by developing a new random blinding technique.