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 12, Issue 6 - Dec 2002
Volume 12, Issue 5 - Oct 2002
Volume 12, Issue 4 - Aug 2002
Volume 12, Issue 3 - Jun 2002
Volume 12, Issue 2 - Apr 2002
Volume 12, Issue 1 - Feb 2002
Selecting the target year
An efficient sealed-bid auction protocol
Journal of the Korea Institute of Information Security and Cryptology, volume 12, issue 6, 2002, Pages 3~15
In this paper, we propose an efficient and secure sealed-bid auction protocol with two servers, a seller S and a third party A . The proposed scheme uses the idea of the conditional oblivious transfer protocol proposed by Crescenzo-Ostrovskey-Rajagopalan. A server A is not a trusted third party, but is assumed not to collude with a server S. In the proposed auction protocol, barring collusion between A and S, neither party gains any information about the bids, and moreover, the outcome of the auction will be correct. And the computational complexity of our auction protocol is considerably efficient and the communication overhead is similar to that of Naor-Pinkas-Sumner's scheme.
The Most Efficient Extension Field For XTR
Journal of the Korea Institute of Information Security and Cryptology, volume 12, issue 6, 2002, Pages 17~28
XTR is a new method to represent elements of a subgroup of a multiplicative group of a finite field GF(
) and it can be generalized to the field GF(
This paper progress optimal extention fields for XTR among Galois fields GF (
) which can be aplied to XTR. In order to select such fields, we introduce a new notion of Generalized Opitimal Extention Fields(GOEFs) and suggest a condition of prime p, a defining polynomial of GF(
) and a fast method of multiplication in GF(
) to achieve fast finite field arithmetic in GF(
). From our implementation results, GF(
) is the most efficient extension fields for XTR and computing Tr(
) given Tr(g) in GF(
) is on average more than twice faster than that of the XTR system on Pentium III/700MHz which has 32-bit architecture.
SPKI/SDSI HTTP Secure Server to support Role-based Access Control & Confidential Communication
Journal of the Korea Institute of Information Security and Cryptology, volume 12, issue 6, 2002, Pages 29~46
We generally use SSL/TLS protocol utilizing X.509 v3 certificates so as to provide a secure means in establishment an confidential communication and the support of the authentication service. SPKI/SDSI was motivated by the perception that X.509 is too complex and incomplete. This thesis focuses on designing a secure server and an implementation of the prototype which has two main modules, one is to support secure communication and RBAC, not being remained in the SPKI/SDSI server which was developed by the existing Geronimo project and the other is to wholly issue name-certificate and authorization-cerificate. And the demonstration embodied for our sewer is outlined hereafter.
A Multi-Level Access Control Scheme on Dynamic Multicast Services
Journal of the Korea Institute of Information Security and Cryptology, volume 12, issue 6, 2002, Pages 47~58
The access control techniques, which can control unauthorized members to access to multicast service, have not been studied very often while there are a lot of on-going study on secure multicast architecture, multicast key distribution and sender authentication scheme have been studied. Multi level access control scheme in multicast can be used in a remote secure conference or to provide graduated multimedia services to each customers. In fact, multicast network has its own virtual networks according to different security levels. However, Early schemes are not effective when it protects unauthorized access in multi-access network environment. Furthermore this scheme does not provide us with hierarchical access control mechanism. This paper, therefore, proposes hierarchical access control scheme to provide the effectiveness in network layer by security level comparison. And we also suggests hierarchical key distribution scheme for multi level access control in application layer and effective hierarchical key renewal scheme in dynamic multicast environment which is easy to join and leaving the multicast group.
Multiple Linear Cryptanalysis-Revisited
Journal of the Korea Institute of Information Security and Cryptology, volume 12, issue 6, 2002, Pages 59~69
Many Linear attacks have introduced after M. Matsui suggested Linear Cryptanalysis in 1993. The one of them is the method suggested by B. Kaliski and M. Robshaw. It was a new method using multiple linear approximations to attack for block ciphers. It requires less known plaintexts than that of Linear Cryptanalysis(LC) by Matsui, but it has a problem. In this paper, we will introduce the new method using multiple linear approximation that can solve the problem. Using the new method, the requirements of the known plaintexts is 5(1.25) times as small as the requirements in LC on 8(16) round DES with a success rate of 95%(86%) respectively. We can also adopt A Chosen Plaintext Linear Attack suggested by L. R. Knudsen and J. E. Mathiassen and then our attack requires about
chosen plaintexts to recover 15 key bits with 86% success rate. We believe that the results in this paper contain the fastest attack on the DES full round reported so far in the open literature.
Hybrid Cryptosystem providing Implicit Authentication for sender
Journal of the Korea Institute of Information Security and Cryptology, volume 12, issue 6, 2002, Pages 71~80
To provide the confidentiality of messages transmitted over the network, the use of cryptographic system is increasing gradually and the hybrid cryptosystem, which combines the advantages of the symmetric cryptosystem and the public key cryptosystem is widely used. In this paper, we proposes a new hybrid cryptosystem capable of providing implicit authentication for the sender of the ciphertext by means of the 1-pass key distribution protocol that offers implicit key authentication, hash function and symmetric cryptosystem. Also, we describe some examples such as the Diffie-Hellman based system and the Nyberg-Ruppel based system. The proposed hybrid cryptosystem is an efficient more than general public key cryptosystems in the aspect of computation work and provides implicit authentication for the sender without additional increase of the communication overhead.
Digital Signature Schemes with Restriction on Signing Capability
Journal of the Korea Institute of Information Security and Cryptology, volume 12, issue 6, 2002, Pages 81~92
In some practical circumstances, the ability of a signer should be restricted. In group signature schemes, a group member of a group may be allowed to generate signatures up to a certain number of times according to his/her position in the group. In proxy signature schemes, an original signer may want to allow a proxy signer to generate a certain number of signatures on behalf of the original signer. In the paper, we present signature schemes, called c-times signature schemes, that restrict the signing ability of a signer up to c times for pre-defined value c at set-up. The notion of c-times signature schemes are formally defined, and generic transformation from a signature scheme to a c-times signature scheme is suggested. The proposed scheme has a self-enforcement property such that if a signer generates c+1 or more signatures, his/her signature is forged. As a specific example, we present a secure c-times signature scheme
DSA based on the DSA (Digital Signature Algorithm) by using a threshold scheme. Our transformation can be applied to other ElGamal-like signature schemes as well.
ELKH, Efficient Group Key Management Protocol Using One-Way Function and XOR
Journal of the Korea Institute of Information Security and Cryptology, volume 12, issue 6, 2002, Pages 93~112
Since the multicast group which is composed of various members is dynamic, members of the group frequently join or leave. So, for a new session, group keys are efficiently updated and distributed. In this paper, we describe very simple and new efficient logical key hierarchy(ELKH) protocol which is based on an one-way function. In the previous schemes, when the group controller distributes new created keys or updated keys to the members the information is usally encryted and then transmited over a multicast channel. But ELKH secretes the multicast message by using the one-way function and XOR operator instead of encrypting it. Hence our main construction improves the computational efficiency required from the group controller and group memebers while doesn't increase size of re-keying message when compared to
. Assuming the security of an underlying one-way function, we prove that our scheme satisfies forward secrecy and backward secrecy.
Efficiency in the Password-based Authenticated Key Exchange
Journal of the Korea Institute of Information Security and Cryptology, volume 12, issue 6, 2002, Pages 113~124
Proposals for a password-based authenticated key exchange protocol that have been published so far almost concentrated on the provable security. But in a real environment such as mobile one, efficiency is a critical issue as security. In this paper we discuss the efficiency of PAK which is secure in the random oracle model ［l］. Among 4 hash functions in PAK the instantiation for
, which outputs a verifier of the password, has most important effect on the computational efficiency. We analyze two different methods for
suggested in ［1］ and we show that
has merits in transforming to EC or XTR variants as well as in the efficiency. As an efficient variant. we propose PAK2-EC and PAK2-XTR which do not require any additional step converting a hash output into a point of elliptic curve or XTR subgroup when compared to the previous work on the PAK［2］. Finally we compare PAK2 with the password-based authenticated key exchange protocols such as SPEKE, SRP, and AMP
An Efficient Method Defeating Blackmailing Using Blind XTR-DSA Scheme
Journal of the Korea Institute of Information Security and Cryptology, volume 12, issue 6, 2002, Pages 125~135
The electronic payment system based on blind signature is susceptible to the blackmailing attack as opposed to keep the lifestyle of users private. In this paper. we suggest an efficient electronic cash system using a blind XTR-DSA scheme, which improves the method of defeating blackmailing in online electronic cash systems of ［6,9］. In case of blackmailing, to issue the marked coins we use the blind XTR-DSA scheme at withdrawal. In ［6,9］, to cheat the blackmailer who takes the marked coins the decryption key of a user had to be transferred to the Bank. But in our proposed method the delivery of the decryption key is not required. Also, in the most serious attack of blackmailing. kidnapping, we can defeat blackmailing with a relatively high probability of 13/18 compared with 1/2 in ［9］ and 2/3 in ［6］. If an optimal extension field of XTR suggested in ［7］ is used, then we can implement our system more efficiently.