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 14, Issue 6 - Dec 2004
Volume 14, Issue 5 - Oct 2004
Volume 14, Issue 4 - Aug 2004
Volume 14, Issue 3 - Jun 2004
Volume 14, Issue 2 - Feb 2004
Volume 14, Issue 1 - Feb 2004
Selecting the target year
A Conformance Testing Method and its Implementation for XML Signature Products
Journal of the Korea Institute of Information Security and Cryptology, volume 14, issue 4, 2004, Pages 3~11
The XML has been becoming a basis of the related application and industry standards with proliferation of electronic transactions on the web, and the standardization on XML Signature, which can be applied to the digital contents including XML objects from one or more sources, is in the progress through a joint effort of W3C(World Wide Web Consortium) and IETF(Internet Engineering Task Force). Along with this trend, the development of products implementing XML Signature has been growing, and the XML Signature products are required to implement the relevant standards correctly to guarantee the interoperability among different XML Signature products. In this paper, we propose a conformance testing method for testing the XML Signature products, which includes a testing procedure and test cases. The test cases were obtained through analysis of XML Signature standards. Finally we describe the design and uses of our XML Signature conformance testing tools which implements our testing method.
Design of Proxy Registration Protocols for Stock Trading System
Journal of the Korea Institute of Information Security and Cryptology, volume 14, issue 4, 2004, Pages 13~23
Proxy signature scheme based on delegation of warrant is studied in these days. Proxy signature is a signature scheme that the original signer delegates his signing warrant to the proxy signer, and the proxy signer creates a signature on behalf of the original signer. For using this scheme, the security for Protecting from the forgeability or misuse is necessary. There are several security requirements for using the proxy signature schemes. In this paper we suggest the proxy-register protocol scheme that original signer registers to the verifier about the proxy related information. In our scheme, verifier verifies the signature that original signer creates about the proxy information and sets the warrant of proxy signer, validity period for proxy signature and some limitation. Finally, we will show the advantages of our suggestion by comparing with the previous proxy signature schemes.
A Study on Timeliness Advance Increment of Certificate Verification Using an Observer
Journal of the Korea Institute of Information Security and Cryptology, volume 14, issue 4, 2004, Pages 25~37
A certificate is expected to use for its entire validity period. However, a false information record of user and compromise of private key may cause a certificate to become invalid prior to the expiration of the validity period. The CA needs to revoke the certificate. The CA periodically updates a signed data structure called a certificate revocation list(CRL) at directory server. but as CA updates a new CRL at directory server. the user can use a revoked certificate. Not only does this paper analyzes a structure of CRL and a characteristic of certificate status conviction, OCSP method but also it proposes a new certificate status verification method adding an observer information in handshake process between user and server.
A Steganalysis using Blockiness in JPEG images
Journal of the Korea Institute of Information Security and Cryptology, volume 14, issue 4, 2004, Pages 39~47
In general, the steganographic algorithm for embedding message in JPEG images, such as Jsteg
, JP Hide ＆ Seek
replaces the LSB of DCT coefficients by the message bits. Both Jsteg and n Hide ＆ seek are detected by
- test, steganalytic technique
, the rate of detection is very low, though. In this Paper, we Propose a new steganalysis method that determine not only the existence of hidden messages in JPEG images exactly, but also the steganographic algorithm used. This method is advanced from the technique Blockiness
. It has many advantages that include a computational efficiency, correctness and that can detect without bowing steganographic algorithm. Experiment results show the superiority of our approach over Blockiness
Synthesizing a Boolean Function of an S-box with Integer Linear Programming
Journal of the Korea Institute of Information Security and Cryptology, volume 14, issue 4, 2004, Pages 49~59
Boolean function synthesize problem is to find a boolean expression with in/outputs of original function. This problem can be modeled into a 0-1 integer programming. In this paper, we find a boolean expressions of S-boxes of DES for an example, whose algebraic structure has been unknown for many years. The results of this paper can be used for efficient hardware implementation of a function and cryptanalysis using algebraic structure of a block cipher.
A Empirical Validation of Risk Analysis Model in Electronic Commerce
Journal of the Korea Institute of Information Security and Cryptology, volume 14, issue 4, 2004, Pages 61~74
Risk analysis model is systematic and structural process that considers internal security problems and threat factors of the information systems to find optimal level of security control. But, the risk analysis model is just only defined conceptually and there are not so many empirical studies. This research used structural equation modeling(SEM) research methodology with rigorously validated research instrument. Based on results of this study, risk analysis methodology was proved to be practically useful in e-commerce environment. Factors like threat and control were significantly related to risk. In conclusion, the results of this study can be applied to general situation or environment of information security for analyzing and managing the risk and providing new approach to comprehend concept of risk in e-commerce environment.
Security Proof for a Leakage-Resilient Authenticated Key Establishment Protocol
Shin, Seong-Han ; Kazukuni Kobara ; Hideki Imai ;
Journal of the Korea Institute of Information Security and Cryptology, volume 14, issue 4, 2004, Pages 75~90
At Asiacrypt 2003, Shin et al., have proposed a new class for Authenticated Key Establishment (AKE) protocol named Leakage-Resilient AKE
. The authenticity of LR-AKE is based on a user's password and his/her stored secrets in both client side and server side. In their LR-AKE protocol, no TRM(Tamper Resistant Modules) is required and leakage of the stored secrets from
my side does not reveal my critical information on the password. This property is useful when the following situation is considered :(1) Stored secrets may leak out ;(2) A user communicates with a lot of servers ;(3) A user remembers only one password. The other AKE protocols, such as SSL/TLS and SSH (based or PKI), Password-Authenticated Key Exchange (PAKE) and Threshold-PAKE (T-PAKE), do not satisfy that property under the above-mentioned situation since their stored secrets (or, verification data on password) in either the client or the servers contain enough information to succeed in retrieving the relatively short password with off-line exhaustive search. As of now, the LR-AKE protocol is the currently horn solution. In this paper, we prove its security of the LR-AKE protocol in the standard model. Our security analysis shows that the LR-AKE Protocol is provably secure under the assumptions that DDH (Decisional Diffie-Hellman) problem is hard and MACs are selectively unforgeable against partially chosen message attacks (which is a weaker notion than being existentially unforgeable against chosen message attacks).
A Security Analysis of PMAC and TMAC variant
Journal of the Korea Institute of Information Security and Cryptology, volume 14, issue 4, 2004, Pages 91~96
In this paper, we introduce two forgery attacks on the PMAC. If it has no truncation then the attack requires about
2+1/ chosen texts, otherwise, the attack requires about
2+1/ chosen texts and
MAC verifications where
is the size of the MAC. We also give a forgery attack on the TMAC variant which requires about
Real-Time Visualization of Web Usage Patterns and Anomalous Sessions
Journal of the Korea Institute of Information Security and Cryptology, volume 14, issue 4, 2004, Pages 97~110
As modem web services become enormously complex, web attacks has become frequent and serious. Existing security solutions such as firewalls or signature-based intrusion detection systems are generally inadequate in securing web services, and analysis of raw web log data is simply impractical for most organizations. Visual display of "interpreted" web logs, with emphasis on anomalous web requests, is essential for an organization to efficiently track web usage patterns and detect possible web attacks. In this paper, we discuss various issues related to effective real-time visualization of web usage patterns and anomalies. We implemented a software tool named SAD (session anomaly detection) Viewer to satisfy such need and conducted an empirical study in which anomalous web traffics such as Misuse attacks, DoS attacks, Code-Red worms and Whisker scans were injected. Our study confirms that SAD Viewer is useful in assisting web security engineers to monitor web usage patterns in general and anomalous web sessions in particular.articular.
Fast Detection Scheme for Broadband Network Using Traffic Analysis
Journal of the Korea Institute of Information Security and Cryptology, volume 14, issue 4, 2004, Pages 111~121
With rapid growth of the Internet, network intrusions have greatly increased and damage of attacks has become more serious. Recently some kinds of Internet attacks cause significant damage to overall network performance. Current Intrusion Detection Systems are not capable of performing the real-time detection on the backbone network In this paper, we propose the broadband network intrusion detection system using the exponential smoothing method. We made an experiment with real backbone traffic data for 8 days. The results show that our proposed system detects big jumps of traffic volume well.
FPGA Implementation and Performance Analysis of High Speed Architecture for RC4 Stream Cipher Algorithm
Journal of the Korea Institute of Information Security and Cryptology, volume 14, issue 4, 2004, Pages 123~134
In this paper a high speed architecture of the RC4 stream cipher is proposed and its FPGA implementation is presented. Compared to the conventional RC4 designs which have long initialization operation or use double or triple S-arrays to reduce latency delay due to S-array initialization phase, the proposed architecture for RC4 stream cipher eliminates the S-array initialization operation using 256-bit valid entry scheme and supports 40/128-bit key lengths with efficient modular arithmetic hardware. The proposed RC4 stream cipher is implemented using Xilinx XCV1000E-6H240C FPGA device. The designed RC4 stream cipher has about a throughput of 106 Mbits/sec at 40 MHz clock and thus can be applicable to WEP processor and RC4 key search processor.
On the Security of ID-Based Cryptosystem against Power Analysis Attacks
Journal of the Korea Institute of Information Security and Cryptology, volume 14, issue 4, 2004, Pages 135~140
The ID-based cryptosystem and Power Analysis Attack are attracting many researchers and have been developed aggressively to date. Especially, DPA (Differential Power Analysis) attack has been considered to be the most powerful attack against low power devices, such as smart cards. However, these two leading topics are researched independently and have little hewn relations with each other. In this paper, we investigate the effect of power analysis attack against ID based cryptosystem. As a result, we insist that ID-based cryptosystem is secure against DPA and we only need to defend against SPA (Simple Power Analysis).
IPSec Accelerator Performance Analysis Model for Gbps VPN
Journal of the Korea Institute of Information Security and Cryptology, volume 14, issue 4, 2004, Pages 141~148
This paper proposes an IPSec accelerator performance analysis model based a queue model. It assumes Poison distribution as its input traffic load. The decoding delay is employed as a performance analysis measure. Simulation results based on the proposed model show around 15% differences with respect to actual measurements on field traffic for the BCM5820 accelerator device. The performance analysis model provides with reasonable hardware structure of network servers, and can be used to span design spaces statistically.
A Study on Network Forensics Information in Automated Computer Emergency Response System
Journal of the Korea Institute of Information Security and Cryptology, volume 14, issue 4, 2004, Pages 149~162
Until now the study of computer forensics has been focused only system forensics which carried on keeping, processing and collecting the remained evidence on computer. Recently the trend of forensic study is proceeding about the network forensics which analyze the collected information in entire networks instead of analyzing the evidence on a victim computer. In particular network forensics is more important in Automated Computer Emergency Response System because the system deals with the intrusion evidence of entire networks. In this paper we defined the information of network forensics that have to be collected in Automated Computer Emergency Response System and verified the defined information by comparing with the collected information in experimental environments.
Provably-Secure and Communication-Efficient Protocol for Dynamic Group Key Exchange
Junghyun Nam ; Jinwoo Lee ; Sungduk Kim ; Seungjoo Kim ; Dongho Won ;
Journal of the Korea Institute of Information Security and Cryptology, volume 14, issue 4, 2004, Pages 163~181
Group key agreement protocols are designed to solve the fundamental problem of securely establishing a session key among a group of parties communicating over a public channel. Although a number of protocols have been proposed to solve this problem over the years, they are not well suited for a high-delay wide area network; their communication overhead is significant in terms of the number of communication rounds or the number of exchanged messages, both of which are recognized as the dominant factors that slow down group key agreement over a networking environment with high communication latency. In this paper we present a communication-efficient group key agreement protocol and prove its security in the random oracle model under the factoring assumption. The proposed protocol provides perfect forward secrecy and requires only a constant number of communication rounds for my of group rekeying operations, while achieving optimal message complexity.
Design of image encryption system using multiple chaotic maps
Journal of the Korea Institute of Information Security and Cryptology, volume 14, issue 4, 2004, Pages 183~194
The proliferation of the Internet and the rapid progress of wire/wireless communication technology makes security of digital images more and more important since the exchanges of digital images occur more and more frequently. And as the tight relationship between chaos theory and cryptography, many researches for development of new encryption systems based on chaotic maps have been widely progressed recently. In this paper, we propose a digital image encryption system based on both one-dimensional PLCM(Piecewise Linear Chaotic Map) and two-dimensional baker map. This proposed system is a product cipher that contains a perturbance-based chaotic stream cipher based on ID PLCM and a chaotic block cipher based on 2D baker map and is very high secure and easily implementable cipher having both a good confusion property and a good diffusion property. And with test results, we showed this system is very secure against statistical attacks.