Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
The KIPS Transactions:PartC
Journal Basic Information
Journal DOI :
Korea Information Processing Society
Editor in Chief :
Volume & Issues
Volume 11C, Issue 7 - Dec 2004
Volume 11C, Issue 6 - Dec 2004
Volume 11C, Issue 5 - Oct 2004
Volume 11, Issue 5 - Oct 2004
Volume 11C, Issue 4 - Aug 2004
Volume 11C, Issue 3 - Jun 2004
Volume 11C, Issue 2 - Apr 2004
Volume 11C, Issue 1 - Feb 2004
Volume 11, Issue 2 - 00 2004
Volume 11, Issue 1 - 00 2004
Selecting the target year
-Span Secret Sharing Schem with Exposing Forged Shadows
The KIPS Transactions:PartC, volume 11, issue 5, 2004, Pages 563~568
In the secret sharing scheme, the reconstruction secret must to exposed to participants. In order to enforce the same secret sharing schemes, a new secret have to regenerate and redistribute for participants. Such a regeneration process is inefficient because of the overhead in the regeneration. In this paper, we proposed efficient secret regeneration scheme by eigenvalue. it can be also redistribution without revealing with other participants.
Validation Tool of Elliptic Curves Cryptography Algorithm for the Mobile Internet
The KIPS Transactions:PartC, volume 11, issue 5, 2004, Pages 569~576
Conventional researches of standard tool validating public key cryptographic algorithm have been studied for the internet environment, not for the mobile internet. It is important to develop the validation tool for establishment of interoperability and convenience of users in mobile internet. Therefore, this paper presents the validation tool of Elliptic Curie Cryptography algorithm that can test if following X9.62 technology standard specification. The validation tool can be applied all information securities using ECDSA, ECKCDSA, ECDH, etc. Moreover, we can en-hace the precision of validation through several experiments and perform the validation tool in the online environment.
A Study on E-trade Securities and Strategic Solutions
The KIPS Transactions:PartC, volume 11, issue 5, 2004, Pages 577~584
Recently many company has been cracked by crackers information security and everyday new computer virus come out. so e-trade partners should prevent the disasters. A few studies researched e-trade securities broadly but the new trend in information security division especially focused on electronic payment, EDI, Transportation, Contracts, Insurances and that of subjects have been researched through interdisciplinary evolution. Our research e-trade security on three part, First system attack, second is data attack and third is business attack. the attacks have theirs own solution, so e-trade company use this solution timely and powerfully. It is the most important thing to prepare the cracking with securities system. also manager should catch recent hacking technologies. The research results propose that e-trade firms should use information security policies and securities systems that including H/W and S/W. therefore manager''''s security mind is very important and also using electronic commerce securities device and should be considered exploiting solutions by each special usage according to e-trade company′ environments.
The Key Management System using the Secret Sharing Scheme Applicable to Smart Card
The KIPS Transactions:PartC, volume 11, issue 5, 2004, Pages 585~594
When several service providers want to work together with only one master key, they need to properly distribute the key to participants who come in for the co-work business and then securely manage the distributed keys. This paper describes the system that can efficiently and securely manage the master key on the basis of the secret sharing scheme that can reconstruct original secret information as the necessity of reconstructing original secret arises. The proposed system can distribute secret information to several groups and also redistribute the secret to subgroup in proportion to the participant''''s security level using smart card-based (t, t)-(k, n)-threshold secret scheme for securely keeping secret information and authentication of participant''''s identification.
Anomaly Intrusion Detection using Fuzzy Membership Function and Neural Networks
The KIPS Transactions:PartC, volume 11, issue 5, 2004, Pages 595~604
By the help of expansion of computer network and rapid growth of Internet, the information infrastructure is now able to provide a wide range of services. Especially open architecture - the inherent nature of Internet - has not only got in the way of offering QoS service, managing networks, but also made the users vulnerable to both the threat of backing and the issue of information leak. Thus, people recognized the importance of both taking active, prompt and real-time action against intrusion threat, and at the same time, analyzing the similar patterns of in-trusion already known. There are now many researches underway on Intrusion Detection System(IDS). The paper carries research on the in-trusion detection system which hired supervised learning algorithm and Fuzzy membership function especially with Neuro-Fuzzy model in order to improve its performance. It modifies tansigmoid transfer function of Neural Networks into fuzzy membership function, so that it can reduce the uncertainty of anomaly intrusion detection. Finally, the fuzzy logic suggested here has been applied to a network-based anomaly intrusion detection system, tested against intrusion data offered by DARPA 2000 Intrusion Data Sets, and proven that it overcomes the shortcomings that Anomaly Intrusion Detection usually has.
An Improved Protocol for the Secure Mobile IPv6 Binding Updates
Il-Sun, You ; Hyungsan, Cho ;
The KIPS Transactions:PartC, volume 11, issue 5, 2004, Pages 605~612
In MIPv6, unauthenticated binding updates expose the involved MN and CN to various security attacks. Thus, protecting the binding update process becomes of paramount importance in the MIPv6, and several secure binding update protocols have been proposed. In this paper, we pro-pose a novel protocol for the secure binding updates in MIPv6, which can resolve the drawbacks of the Deng-Zhou-Bao′s protocol ［2］, by adopt-ing Aura′s CGA scheme with two hashes ［9］. Aura′s scheme enables our protocol to achieve stronger security than other CGA-based protocols without a trusted CA, resulting in less cost of verifying the HA''''s public key than the Deng-Zhou-Bao''''s protocol. Through the comparison of our protocol with other protocols such as the Deng-Zhou-Bao''''s protocol, CAM-DH and SUCV, we show that our protocol can provide better performance and manageability in addition to stronger security than other approaches.
An Implementation of the Mobile Communication Simulator using a Object-Oriented Simulation Platform
The KIPS Transactions:PartC, volume 11, issue 5, 2004, Pages 613~620
Traditionally, simulation method was used to test and evaluate the performance of communication protocol or functional elements for mobile communication service. In this Paper, PCSsim(Personal Communication System Simulator) was realized that can evaluate and review the call process of mobile communication service or to predict its performance by using the object-oriented simulation platform. PCSsim can simulate the base station and mobile host by considering the user''''s mobility, call generation rate and call duration time. In this paper, based on the simulation, presented the simulation results of hand-off generation ratio according to call generation, user''''s moving speed and call duration time both in residence area and commercial area, and it was confirmed that the hand-off rates in simulation and actual service environment have similar features. PCSsim can be used in adjusting the characteristics of base station fellowing the dynamic hand-off buffering or the characteristics of user′s call in the design stage, and also can be used in building new mobile communication network by reflecting the characteristics of region where the base station is located and the mobility of the user.
Fast Self-Similar Network Traffic Generation Based on FGN and Daubechies Wavelets
HaeDuck, Jeong ; Jongsuk, Lee ;
The KIPS Transactions:PartC, volume 11, issue 5, 2004, Pages 621~632
Recent measurement studies of real teletraffic data in modern telecommunication networks have shown that self-similar (or fractal) processes may provide better models of teletraffic in modern telecommunication networks than Poisson processes. If this is not taken into account, it can lead to inaccurate conclusions about performance of telecommunication networks. Thus, an important requirement for conducting simulation studies of telecommunication networks is the ability to generate long synthetic stochastic self-similar sequences. A new generator of pseu-do-random self-similar sequences, based on the fractional Gaussian nois and a wavelet transform, is proposed and analysed in this paper. Specifically, this generator uses Daubechies wavelets. The motivation behind this selection of wavelets is that Daubechies wavelets lead to more accurate results by better matching the self-similar structure of long range dependent processes, than other types of wavelets. The statistical accuracy and time required to produce sequences of a given (long) length are experimentally studied. This generator shows a high level of accuracy of the output data (in the sense of the Hurst parameter) and is fast. Its theoretical algorithmic complexity is 0(n).
A Study on Evaluation and Analysis for IP VPN Model in IPv6 Transition Environment
The KIPS Transactions:PartC, volume 11, issue 5, 2004, Pages 633~644
For a smooth transition from IPv4 to IPv6 network, the research of transition mechanisms have been processing according to the various network situations. Therefore, we calculate the cost based on the VPN applicable model. Also, we present that conformance between the end point of VPN, the If encapsulation tunneling, applying position of translation mechanism and VPN applicable model are the factors which affect Costs.
Improved Star Topology Aggregation using Line Segment
The KIPS Transactions:PartC, volume 11, issue 5, 2004, Pages 645~652
In this paper, we aggregate multi-links information between boundary nodes using the line segment scheme that aggregates topology in-formation within PG referring bandwidth and delay parameter. The proposed scheme can search multi-links efficiently using the depth priority method based on hop count instead of searching all links. To do this, we propose a modified line segment algorithm using two line segment method that represents two points which consist of delay-bandwidth pair to reduce topology information and provide a flexibility to the multi pie-links aggregation. And we apply it to current star topology aggregation. To evaluate performance of the proposed scheme, we compare/analyze the current method with the proposed scheme with respect to call success rate, access time and crankback rate. Through the simulation result analysis, the proposed star topology aggregation scheme presents the better performance than existing scheme.
Protection and Restoration Scheme Based on Eulerian Tours in Survivable Optical Mesh Networks
The KIPS Transactions:PartC, volume 11, issue 5, 2004, Pages 653~658
Failures in optical networks that have huge transmission capability provoke service discontinuitH and thus large economical damage. Even though many algorithms are proposed for protection and restoration on a single failure, there are few algorithms for multiple failures. Eulerian tour is known to be effective to protect and restore a single failure in the literature. This paper proposes an algorithm that can perform efficient protection and restoration for multiple failures based on combined Eulerian tours. The proposed one is very effective on protection and restoration in general cases with two failures, and the comprehensive computer simulation shows that the restoration rate increases up to about 90%.
Performance Analysis of Improved ZMHB Algorithms for Wireless Networks
The KIPS Transactions:PartC, volume 11, issue 5, 2004, Pages 659~670
Handoff is one of the most important features for the user''''s mobility in a wireless cellular communication system. It is related to resource reservation at nearby cells. Resource reservation to the new connection point should occur prior to handoff to enable the user to receive the data or services at the new location, at the same level of service as at the previous location. For the efficient resource reservation, mobility prediction has been reported as an effective means to decrease the call dropping probability and to shorten the handoff latency in a wireless cellular environment. A recently proposed algorithm, ZMHB, makes use of the history of the user′s positions within the current cell to predict the next cell. But, the prediction of the ZMHB algorithm is found to be 80∼85% accurate for regular and random movements. In this paper, we propose a new improved ZMHB mobility prediction algorithm, which is called Detailed-ZMHB that uses detailed-zone-based tracking of mo-bile users to predict user movements. The effectiveness of the proposed algorithm is then demonstrated through a simulation.
Proposal Ultra-fast Multimedia Optical Subscriber Access Network to Guarantee the same Performance Regardless of Data Rates using Optical Frequency Domain CDMA Method
The KIPS Transactions:PartC, volume 11, issue 5, 2004, Pages 671~676
In this paper, we propose ultra-fast multimedia optical subscriber access network using optical frequency domain CDMA method in order to access the multimedia with multiple data rates. We numerically analyze the effects of spectral power distortion in the light source for the optical CDMA system modified PN codes and FBG(Fiber Bragg Grating)s. In the proposed multiple-rate multimedia access optical networks, the performances such as BER(Bit Error Rate) are the same for all data regardless of data rates in the case of the same number of simultaneous ONU. In the proposed ultra-fast multimedia optical subscriber access network, the performances for all data are much more improved than those in the conventional system.
Routing and Wavelength Assignment in Optical WDM Networks with Maximum Quantity of Edge Disjoint Paths
The KIPS Transactions:PartC, volume 11, issue 5, 2004, Pages 677~682
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is considered. Previous techniques based on the combination of integer linear programming and graph coloring are complex and require extensive use of heuristics. Such methods are mostly slow and sometimes impossible to get results due to infeasibility. An alternative approach applied to RWA employs on the greedy algorithm for obtaining the maximum edge disjoint paths. Even though this approach is fast, it produces a solution for any connection request, which is very far from the optimal utilization of wavelengths. We propose a novel algorithm, which is based on the maximum flow technique to obtain the maximum quantity of edge, disjoint paths. Here we compare the offered method with previous maximum edge disjoint paths algorithms ap plied to the RWA.
Performance Evaluation of RSIP Gateway in Intranet Environment
The KIPS Transactions:PartC, volume 11, issue 5, 2004, Pages 683~688
NAT is a very useful IP address translation technique that allows two connected networks using different and incompatible IP address schemes. But it is impractical to use NAT for an application which uses the encrypted IP packet, embedding IP addresses inside of data payloads, to guarantee End-to-End Security such as IPSec. In addition to rewriting the source/destination IP addresses in the packet, NAT must modify IP checksum every time, which could lead to considerable performance decrease of the overall system in the process of the address translation. RSIP is an alternative to solve these disadvantages of NAT and the address shortage problems. Both NAT and RSIP divide networks into inside and outside addressing realms. NAT translates addresses between internal network and external network, but RSIP uses a borrowed external address for outside communications. RSIP server assigns a routable public address to a RSIP client temporarily to communicate with public net-work outside of the private network. In this paper, RSIP gateway for intranet environment is designed and its performance is evaluated. From the results of performance evaluation, we knew that RSIP is operated less sensitive to the data traffic. Also, the experiment shows that RSIP performs better than NAT when the transmission data grows larger.
A Research on an Email Method based on Sender Mailbox
The KIPS Transactions:PartC, volume 11, issue 5, 2004, Pages 689~696
The conventional email method based on a recipient mailbox has a structural weakness, which may cause the spam message problem and the extreme waste of recipient mailbox space, and also require an explicit recipient notification scheme. This paper proposes a new email method based on a sender mailbox and evaluates its performance. Under the new email method, a message is stored at sender mailbox instead of recipient one until an intended recipient reads the message, so that the burden of mailbox management such as removing spam message is now shifted to sender side. And also a sender can confirm whether an intended recipient has read his or her message by simply rummaging his or her sender mailbox. The results of Performance evaluation show that 75% of mailbox space and 90% of message traffic are reduced in conditions that the portions of spam message and multicasting message are 90% and 80%, respectively.
A Web-based Right Management System Considering Execution time and Security
The KIPS Transactions:PartC, volume 11, issue 5, 2004, Pages 697~702
As for the digital content, a reproduction is easy and manuscript is identical with original copy. Because of these characteristics, there are difficulties on prevention of an illegal reproduction and an illegal currency. In recent days various digital content service systems based on a web are commercialized. An appropriate copyright protection technology is required so that these systems develop as a profit model. Generally we use encrypted digital content transmission method for the copyright protection on a web base system. At the time of this, it is increased sire of encrypted digital content. As for this, it be increased time required on an execution process. Therefore, a design of the system that considered a execution time and a security is required. In this study, we designed the digital content transmission system that considered execution time and a security through a partial encryption based on a digital content copyright management technique. Also we evaluated performance of a proposed system through analysis.
Development of a .NET-based Explorer Supporting WebDAV
The KIPS Transactions:PartC, volume 11, issue 5, 2004, Pages 703~710
WebDAV is a protocol to support collaboration among one or more groups in geographically distant locations through the internet. WebDAV extends the web communication protocol HTTP/1.1 to provide a standard infrastructure for .supporting asynchronous collaboration for various contents across the internet. A WebDAV client uses HTTP requests to perform a renewal and update action to the resources in WebDAY servers. So, it is desirable that the client supports the ability of authoring and version management with a good concurrency control and property management. In this paper, to enhance usability, we developed a .NET-based WebDAV client with a user interface similar to the Windows Explorer. The developed WebDAV client supports easy launching of the authoring application and appropriate lock control for the server resources. In addition, through the functionality of process monitoring, it supports automatic update of the server resources when the modification of the resources are completed by the user. The WebDAY client is a .NET-based application written in the C＃ language, running on any platform supporting a .NET framework.