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
Design of Anonymity-Preserving User Authentication and Key Agreement Protocol in Ubiquitous Computing Environments
Kang Myung-Hee ; Ryou Hwang-Bin ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 2, 2006, Pages 3~12
The spread of mobile devices, PDAs and sensors has enabled the construction of ubiquitous computing environments, transforming regular physical spaces into 'smart space' augmented with intelligence and enhanced with services. However, unless privacy concerns are taken into account early in the design process of various ubiquitous devices(e.g. mobile devices, PDAs, sensors, etc.). we will end up crating ubiquitous surveillance infrastructure. Also, it may inappropriate to use public key techniques for computational constrained devices in ubiquitous computing environment. In this paper, we propose efficient user authentication and ky agreement protocol not only to preserve anonymity for protecting personal privacy but also to be suitable for computational constrained devices in ubiquitous computing environments.
A Practical Privacy-Preserving Multi-Party Computation Protocol for Solving Linear Systems
Yi Ok-Yeon ; Hong Do-Won ; Kang Ju-Sung ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 2, 2006, Pages 13~24
We consider a privacy-preserving cooperative computation protocol evaluating a beneficial function of all participants' secret inputs, such that each party finally holds a share of the function output. We propose a practical privacy-preserving cooperative computation protocol for solving the linear system of equations problem md the linear least-squares problem. Solutions to these problems are widely used in many areas such as banking, manufacturing, and telecommunications. Our multi-party protocol is an efficiently extended version of the previous two-party model.
Improved Fast Correlation Attack on the Shrinking and Self-Shrinking generators
Jeong Ki-Tae ; Sung Jae-Chul ; Lee Sang-Jin ; Kim Jae-Heon ; Park Sang-Woo ; Hong Seok-Hie ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 2, 2006, Pages 25~32
In this paper, we propose a fast correlation attack on the shrinking and self-shrinking generator. This attack is an improved algorithm or the fast correlation attack by Zhang et al. at CT-RSA 2005. For the shrinking generator, we recover the initial state of generating LFSR whose length is 61 with
keystream bits, the computational complexity of
and success probability 99.9%. We also recover the initial state of generating LFSR whose length is
of the self-shrinking generator with
keystream bits, the computational complexity of
and success probability 99.9%.
Design of a Policy based Privacy Protection System using Encryption Techniques
Mun Hyung-Jin ; Li Yong-Zhen ; Lee Dong-Heui ; Lee Sang-Ho ; Lee Keon-Myung ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 2, 2006, Pages 33~43
In order to provide the efficient personalized services, the organizations and the companies collect and manage the personal information. However, there have been increasing privacy concerns since the personal information might be misused and spread over in public by the database administrators or the information users. Even in the systems in which organizations or companies control access to personal information according to their access policy in order to protect personal information, it is not easy to fully reflect the information subjects' intention on the access control to their own Personal information. This paper proposes a policy-based access control mechanism for the personal information which prevents unauthorized information users from illegally accessing the personal information and enables the information subjects to control access over their own information. In the proposed mechanism, the individuals' personal information which is encrypted with different keys is stored into the directory repository. For the access control, information subjects set up their own access control policy for their personal information and the policies are used to provide legal information users with the access keys.
Implementation of Digital Document Management DRM System with OMA Structure
Shin Young-Chan ; Choi Hyo-Sik ; Kim Yong-Goo ; Choi Seoko-Jin ; Ryou Jae-Cheol ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 2, 2006, Pages 45~54
As widespread of using digital documents in various fields, control the usage of digital document is needed. So, Digital Rights Management(DRM) will become a key component of digital document system, but absence of proper digital document DRM system, there is a real risk to lose important information when a hacker achieved intrusion in important system. This paper designs and implements digital document DRM system based on OMA(Open Mobile Alliance) DRM model and OpenOffice. We considered being a digital document DRM system to contain appropriate solution of security and document compatibility.
An Access Control Security Architecture for Secure Operating System supporting Flexible Access Control
Kim Jung-Sun ; Kim Min-Soo ; No Bong-Nam ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 2, 2006, Pages 55~70
In this paper, we propose a new access control security architecture for supporting flexibility in Secure Operating Systems. By adding virtual access control system layer to the proposed security architecture, various access control models such as MAC, DAC, and RBAC can be applied to Secure Operating Systems easily. The proposed security architecture is designed to overcome the problem of Linux system's base access control system. A policy manager can compose various security models flexibly and apply them to Operating Systems dynamically. Also, the proposed architecture is composed of 3 modules such as access control enforcement, access control decision, and security control. And access control models are abstracted to hierarchy structure by virtual access control system. And, we present the notation of policy conflict and its resolution method by applying various access control model.
A Key Management Scheme for Commodity Sensor Networks
Kim Young-Ho ; Lee Hwa-Seong ; Lee Dong-Hoon ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 2, 2006, Pages 71~80
To guarantee secure communication in wireless sensor networks, secret keys should be securely established between sensor nodes. Recently, a simple key distribution scheme has been proposed for pair-wise key establishment in sensor networks by Anderson, Chan, and Perrig. They defined a practical attack model for non-critical commodity sensor networks. Unfortunately, the scheme is vulnerable under their attack model. In this paper, we describe the vulnerability in their scheme and propose a modified one. Our scheme is secure under their attack model and the security of our scheme is proved. Furthermore, our scheme does not require additional communication overhead nor additional infrastructure to load potential keys into sensor nodes.
A Study on Authentication and Management Scheme of RFID Tag for Ubiquitous Environment
Seo Dae-Hee ; Lee Im-Yeong ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 2, 2006, Pages 81~94
This study, in particular, aims to regulate the core techniques of ubiquitous computing, such as the use of an ad hoc network and the smart-tag technique, and to look more closely into RFID Tag's smart-tag-related security service. The study aims to do so because several important technical factors and structures must be taken into account for RFID Tag to be applied in the ubiquitous-computing-related infrastructure, and the security of the tag is considered one of the core technologies. To realize secure ubiquitous computing in the case of the Passive-tag-Performing RF communication, a less costly security service, the technical items needed to carry this out, a security service to be applied to passive tags, and network management techniques are required. Therefore, the passive-tag-based networks as the authentication level is established based on the secure authentication of each tag and the service that the tag delivers in the passive-tag-based networks and as the same service and authentication levels are applied, and the active-tag-based network system proposed herein is not merely a security service against illegal RFID tags by performing a current-location and service registration process after the secure authentication process of the active RFID tag, but is also a secure protocol for single and group services, is proposed in this study.
The Modified IPv6 NDP Mechanism for Preventing IP Spoofing
Kim Ji-Hong ; Nah Jae-Hoon ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 2, 2006, Pages 95~103
IPv6 is a new version of the Internet protocol, designed as the successor to IPv4. Among the changes from IPv4 to IPv6, we focused on the stateless address auto-configuration mechanism. The address auto-configuration mechanism is used by nodes in an IPv6 network to learn the local topology. The current specifications suggest that IPsec AH may be used to secure the mechanism, but there is no security association during address auto-configuration process because it has no initial IP address. As there are so many suity threats, SEND protocol was designed to counter these threats. In this paper we analyzed the security problems in NDP and SEND protocol. So we proposed the Modified NDP mechanism using PKC and AC in order to solve these problems.
Modified SMPO for Type-II Optimal Normal Basis
Yang Dong-Jin ; Chang Nam-Su ; Ji Sung-Yeon ; Kim Chang-Han ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 2, 2006, Pages 105~111
Cryptographic application and coding theory require operations in finite field
. In such a field, the area and time complexity of implementation estimate by memory and time delay. Therefore, the effort for constructing an efficient multiplier in finite field have been proceeded. Massey-Omura proposed a multiplier that uses normal bases to represent elements
 and Agnew at al. suggested a sequential multiplier that is a modification of Massey-Omura's structure for reducing the path delay. Recently, Rayhani-Masoleh and Hasan and S.Kwon at al. suggested a area efficient multipliers for modifying Agnew's structure respectively[2,3]. In  Rayhani-Masoleh and Hasan proposed a modified multiplier that has slightly increased a critical path delay from Agnew at al's structure. But, In  S.Kwon at al. proposed a modified multiplier that has no loss of a time efficiency from Agnew's structure. In this paper we will propose a multiplier by modifying Rayhani-Masoleh and Hassan's structure and the area-time complexity of the proposed multiplier is exactly same as that of S.Kwon at al's structure for type-II optimal normal basis.
Steganographic Method on Spatial Domain Using Modular Characteristic
Park Young-Ran ; Shin Sang-Uk ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 2, 2006, Pages 113~119
Image steganography is a secret communication method used to transmit secret messages that have been embedded into an image. To accommodate a secret message in a digital image, the original cover image is modified by the embedding algorithm. As a result, a stego image is obtained. The sender hides the secret message in a cover image that has no meaning, and then transmits the stego image to the receiver. In this paper, we propose a steganographic method based on spatial domain to embed a secret message using a difference value of two consecutive pixels and a secret quantization range. Especially, we use the modular operation for increasing of insertion information. Through experiments, we have shown that the proposed method has much mon payload capacity, average 60 percent, than some existing methods by using modular operation.
Improved Password Change Protocol Using One-way Function
Jeon Il-Soo ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 2, 2006, Pages 121~127
Recently, Chang et at.
proposed a new password-based key agreement protocol and a password change protocol to improve the efficiency in the password-based authenticated key agreement protocol proposed by Yeh et at.
. However, Wang et al.
showed that their protected password change protocol is not secure under the denial of service attack and the dictionary attack This paper proposes an improved password change protocol to solve this problems in the Chang et al's protocol. In the proposed protocol, the format of communication messages is modified not to have any clue for the guessing of the password and verifying of the guessed password. The proposed protocol supports the advantages in the previous password-based protocols and solves the problems in them effectively.
A Secure ARIA implementation resistant to Differential Power Attack using Random Masking Method
Yoo Hyung-So ; Kim Chang-Kyun ; Park Il-Hwan ; Moon Sang-Jae ; Ha Jae-Cheol ;
Journal of the Korea Institute of Information Security and Cryptology, volume 16, issue 2, 2006, Pages 129~139
ARIA is a 128-bit block cipher, which became a Korean Standard in 2004. According to recent research this cipher is attacked by first order DPA attack In this paper, we explain a masking technique that is a countermeasure against first order DPA attack and apply it to the ARIA. And we implemented a masked ARIA for the 8 bit microprocessor based on AVR in software. By using this countermeasure, we verified that it is secure against first order DPA attack