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
Password-based Authenticated Key Agreement Protocol Secure Against Advanced Modification Attack
Kwak, Jin ; Oh, Soo-Hyun ; Yang, Hyung-Kyu ; Won, Dong-Ho ;
The KIPS Transactions:PartC, volume 11C, issue 3, 2004, Pages 277~286
DOI : 10.3745/KIPSTC.2004.11C.3.277
Password-based mechanism is widely used methods for user authentication. Password-based mechanisms are using memorable passwords(weak ferrets), therefore Password-based mechanism are vulnerable to the password guessing attack. To overcome this problem, man password-based authenticated key exchange protocols have been proposed to resist password guessing attacks. Recently, Seo-Sweeny proposed password-based Simple Authenticated Key Agreement(SAKA) protocol. In this paper, first, we will examine the SAKA and authenticated key agreement protocols, and then we will show that the proposed simple authenticated key agreement protocols are still insecure against Advanced Modification Attack. And we propose a password-based Simple Authenticated Key Agreement Protocol secure against Advanced Modification Attack.
A Refundable Elliptic Curve Electronic Cash in Mobile Environments
Kwon, Eun-Kyeong ; Cho, Yong-Gu ; Chae, Ki-Joon ;
The KIPS Transactions:PartC, volume 11C, issue 3, 2004, Pages 287~292
DOI : 10.3745/KIPSTC.2004.11C.3.287
BOCC(Brand`s Offline Cash with a Counter) is useful in mobile environments, but it has the possibility of attacking amount data in a smart card. To insert the upper & lower limitation of amount into a token data decreases the level of risk. If upper and lower values are same, it means a fixed amount token. Since refund can more often happen in on-line commerce, refundability is added. BOCC is based on Discrete Logarithm Problem, needs exponential computations. But mobile terminals like cell phones have low computational power. As a result, ECC is used to Improve the performance supporting same security level.
A ZRP-based Reliable Route Discovery Scheme in Ad-Hoc Networks
Kim, Kyoung-Ja ; Chang, Tae-Mu ;
The KIPS Transactions:PartC, volume 11C, issue 3, 2004, Pages 293~300
DOI : 10.3745/KIPSTC.2004.11C.3.293
Ad hoc networks are groups of mobile hosts without any fixed infrastructure. Frequent changes in network topology owing to node mobility make these networks very difficult to manage. Therefore, enhancing the reliability of routing paths in ad hoc networks gets more important. In this paper, we propose a ZRP(Zone Routing Protocol)-based route discovery scheme that can not only reduce the total hops of routing path, but Improve security through authentications between two nodes. And to solve the problem in maintenance of routing paths owing to frequent changes of the network topology, we adopt a query control mechanism. The effectiveness of our scheme is shown by simulation methods.
A Hybrid Model of Network Intrusion Detection System : Applying Packet based Machine Learning Algorithm to Misuse IDS for Better Performance
Weon, Ill-Young ; Song, Doo-Heon ; Lee, Chang-Hoon ;
The KIPS Transactions:PartC, volume 11C, issue 3, 2004, Pages 301~308
DOI : 10.3745/KIPSTC.2004.11C.3.301
Misuse IDS is known to have an acceptable accuracy but suffers from high rates of false alarms. We show a behavior based alarm reduction with a memory-based machine learning technique. Our extended form of IBL, (XIBL) examines SNORT alarm signals if that signal is worthy sending signals to security manager. An experiment shows that there exists an apparent difference between true alarms and false alarms with respect to XIBL behavior This gives clear evidence that although an attack in the network consists of a sequence of packets, decisions over Individual packet can be used in conjunction with misuse IDS for better performance.
A Performance Evaluation of EAP-TLS Authentication Model in the AAAv6
Jeong, Yun-Su ; Kim, Hyung-Do ; Lee, Hae-Dong ; Kim, Hyun-Gon ; Lee, Sang-Ho ;
The KIPS Transactions:PartC, volume 11C, issue 3, 2004, Pages 309~318
DOI : 10.3745/KIPSTC.2004.11C.3.309
AAAv6-based Diameter method is using in the user authentication to satisfy the users` increasing user authentication demand and to supply a safe communication between mobile node and server in the Mobile IP. therefore, In this paper, We design a model of server capacity based on EAP-TLS that in one of AAAv6 models with mobility among domains to get the optimized capacity index of the server for user authentication accomplishment. We elicitat the authentication capacity index for each server of which is accomplishing in user authentication using DSA/RSA algorithm and purpose the optimized condition for the AAAv6 capacity by the index.
Experiments on An Network Processor-based Intrusion Detection
Kim, Hyeong-Ju ; Kim, Ik-Kyun ; Park, Dae-Chul ;
The KIPS Transactions:PartC, volume 11C, issue 3, 2004, Pages 319~326
DOI : 10.3745/KIPSTC.2004.11C.3.319
To help network intrusion detection systems(NIDSs) keep up with the demands of today`s networks, that we the increasing network throughput and amount of attacks, a radical new approach in hardware and software system architecture is required. In this paper, we propose a Network Processor(NP) based In-Line mode NIDS that supports the packet payload inspection detecting the malicious behaviors, as well as the packet filtering and the traffic metering. In particular, we separate the filtering and metering functions from the deep packet inspection function using two-level searching scheme, thus the complicated and time-consuming operation of the deep packet inspection function does not hinder or flop the basic operations of the In-line mode system. From a proto-type NP-based NIDS implemented at a PC platform with an x86 processor running Linux, two Gigabit Ethernet ports, and 2.5Gbps Agere PayloadPlus(APP) NP solution, the experiment results show that our proposed scheme can reliably filter and meter the full traffic of two gigabit ports at the first level even though it can inspect the packet payload up to 320 Mbps in real-time at the second level, which can be compared to the performance of general-purpose processor based Inspection. However, the simulation results show that the deep packet searching is also possible up to 2Gbps in wire speed when we adopt 10Gbps APP solution.
A Design and Implementation of System to Provide Secure Digital Contents Distribution on Mobile Environment
Lee, Kwon-Il ; Kim, Bong-Seon ; Shin, Young-Chan ; Ryou, Jae-Cheol ; Lee, Jun-Seok ;
The KIPS Transactions:PartC, volume 11C, issue 3, 2004, Pages 327~336
DOI : 10.3745/KIPSTC.2004.11C.3.327
There is a need for content providers and operators to control the usage of downloaded digital contents. Digital Rights Management(DRM) is the means to control the usage of the digital contents once it has been downloaded. Therefore, appropriate security mechanism is required. The mobile DRM system Is same as the general DRM system. We use encryption technology to package digital contents. In case of Mobile DRM system, secure distribution and secure keeping of packaging encryption key is important. In this paper, we design and implement DRM system on the Mobile Environments following on OMA(Open Mobile Alliance) DRM Model. We considered being a secure DRM system to contain appropriate security solution.
Multi-thread Scheduling for the Network Processor
Yim, Kang-Bin ; Park, Jun-Ku ; Jung, Gi-Hyun ; Choi, Kyung-Hee ;
The KIPS Transactions:PartC, volume 11C, issue 3, 2004, Pages 337~344
DOI : 10.3745/KIPSTC.2004.11C.3.337
In this paper, we propose a thread scheduling algorithm for faster packet processing on the network processors with multithreaded multiprocessor architecture. To implement the proposed algorithm. we derived several basic parameters related to the thread scheduling and included a new parameter representing the packet contents and the multithreaded architecture. Through the empirical study using a simulator, we proved the proposed scheduling algorithm provides better throughput and load balancing compared to the general thread scheduling algorithm.
A Replica Placement Algorithm reducing Time Complexity
Kim, Seon-Ho ; Yoon, Mi-Youn ; Shin, Yong-Tae ;
The KIPS Transactions:PartC, volume 11C, issue 3, 2004, Pages 345~352
DOI : 10.3745/KIPSTC.2004.11C.3.345
Recently, contents distribution technologies have been used to cope with the explosive demand for Web services. In this paper, we addressed the issue of the optimal placement of replicas in the environment where Web contents are replicated. We placed replicas so that clients can have access to replicas with the proper delay and bandwidth. We attempted to solve the problem via dynamic programming considering cost of delay and traffic We have come up with time complexity that is less than
. We defined the threshold and proved that our algorithm guarantees the reliable services.
Variable Iteration Decoding Control Method of Iteration Codes using CRC-code
Baek, Seung-Jae ; Park, Jin-Soo ;
The KIPS Transactions:PartC, volume 11C, issue 3, 2004, Pages 353~360
DOI : 10.3745/KIPSTC.2004.11C.3.353
In this Paper, We propose an efficient iteration decoding control method with variable iteration decoding of iteration codes decoding using Cyclic Redundancy Check. As the number of iterations increases, the bit error rate and frame error rate of the decoder decrease and the incremental improvement gradually diminishes. However, when the iteration decoding number is increased, it require much delay and amount of processing time for decoding. Also, It can be observed the error nor that the performance cannot be improved even though increasing of the number of iterations and SNR. So, Suitable number of iterations for stopping criterion is required. we propose variable iteration control method to adapt variation of channel using Frame Error-Check indicator. Therefore, the amount of computation and the number of iterations required for iteration decoding with CRC method can be reduced without sacrificing performance.
Discovery of Active Nodes and Reliable Transmission of Active Packets in IP Networks
Kim, Bang-Eun ; Chae, Ki-Joon ; Kim, Dong-Young ; Na, Jung-Chan ;
The KIPS Transactions:PartC, volume 11C, issue 3, 2004, Pages 361~370
DOI : 10.3745/KIPSTC.2004.11C.3.361
All active nudes which have no physically direct connection with each other in If network must be able to compose and manage network topology Informations. Besides one active program can be performed by the active nodes when every active packet for this program is transmitted without any loss of packets. Also the active packets should be transmitted effectively to minimize the transmission delay and securely from threatens. In this thesis, the discovery scheme of active nodes is adapted for active nodes in IP networks to compose and manage the topology information. The scheme for the efficient, reliable and secure transmission of active packets is also proposed. The sequence number is assigned to every active packet. If a receiver detects the loss of active packet checking the sequence number, the receiver requests the retransmission of the lost packet to the previous active node. kiter receiving an active packet and adapting security and reliability schemes, intermediate active nodes not only copy and send the Packet Instantly but also apply some suity mechanisms to it. And the active packet transmission engine is proposed to provide these transmission schemes The simulation of the adapted active node discovery scheme and the proposed active packet transmission engine is performed. The simulation results show that the adapted active node discovery scheme is efficient and the proposed active engine has the low latency and the high performance.
A Study on the Implementation of SIP based new Integrated Instant Messenger
Jo, Hyun-Gyu ; Lee, Ky-Soo ; Jang, Choon-Seo ;
The KIPS Transactions:PartC, volume 11C, issue 3, 2004, Pages 371~378
DOI : 10.3745/KIPSTC.2004.11C.3.371
SIP(Session Initiation Protocol) is a text based call signaling protocol that has characteristics such as flexibilities and extensibility for various application services over Internet. In this paper, we have implemented SIP based integrated Instant Messenger system which includes Presence Watcher Information service that can notify various current users status. In this system, voice and video communications are also possible as well as text based instant messages. For voice and video communication, we have newly proposed a method in which direct connection is possible between users without creation of SW INVITE dialog by extending PRESENCE TUPLE of presence information. In this case, PRESENCE TUPLE stores some informations necessary for the session.
Construction of a WAP Proxy and its Improvement for Wireless Communication Efficiency
Park, Kee-Hyun ; Synn, Yang-Mo ; Ju, Hong-Taek ;
The KIPS Transactions:PartC, volume 11C, issue 3, 2004, Pages 379~386
DOI : 10.3745/KIPSTC.2004.11C.3.379
The WAP 2.0 system is a newly proposed wireless communication system by the WAP Forum for interoperability across Internet environment and the system takes charge of communication between WAP terminals and existing origin Web servers. The purpose of this paper is 1) to construct a WAP 2.0 proxy proposed by the WAP Forum and 2) to improve the WAP Proxy in order to increase communication efficiency between wired and wireless communication objects. The Improved WAP proxy constructed in this study provides links between wired and wireless communication environments using the split-TCP concept. However, unlike the split-TCP connection, The improved WAP proxy maintains TCP`s end-to-end semantics and reduces overhead by avoiding operations as much as possible on the upper protocol layer. In addition, The improved WAP proxy supports SACK(Selective Acknowledgement ) option and Timestamp option for speedy re-transmission which leads to reduction of performance degradation. After constructing the improved WAP proxy under Linux environment, experiments have been taken. The experimental results show that, compared with the experiments when a WAP proxy proposed by the WAP Forum is used, both data transmission delay time and data transmission size decrease to show that communication efficiency is increased. In particular, as packet missing ratio Increases, data transmission size decreases, which demonstrates that the improved WAP proxy is very effective for performance improvement in wireless communication environment.
A Pointer Forwarding Scheme for Fault-tolerant Location Management in Mobile Networks
Lee, Kyung-Sook ; Ha, Sook-Jeong ; Chun, Sung-Kwang ; Bae, Ihn-Han ;
The KIPS Transactions:PartC, volume 11C, issue 3, 2004, Pages 387~394
DOI : 10.3745/KIPSTC.2004.11C.3.387
One of the main challenges in personal communication services(PCS ) Is to locate many mobile terminals that nay move from place to place frequently. This kind of system operation is called location management. This task entails sophisticated signaling traffic and database queries. Several strategies have been proposed to improve the efficiency of location management. These strategies use location register databases to store the current locations of mobile terminals, and are vulnerable to failure of the location register databases. In this paper, we propose a fault-tolerant pointer forwarding scheme with distributed home location register in order to tolerate the failure of location registers. The performance of the proposed scheme is evaluated analytically by simulation, and Is compared with Biaz`s bypass forwarding strategy and two-path forwarding strategy.
A Study on TDMG Pulse Performance and Structure for Performance Improvement of UWB system
Ko, Young-Eun ; Bang, Sung-Il ;
The KIPS Transactions:PartC, volume 11C, issue 3, 2004, Pages 395~400
DOI : 10.3745/KIPSTC.2004.11C.3.395
Being aware of growing needs for wireless communication led to the development of UWB systems, this study proposed an impulse for single band UWB systems which does not count a carrier; analyzed the characteristics and the problems of pulses suggested by the existing poise of the Un system; finally, proposed TDMG(Time Delay Multiple Gaussian) pulse that generates signals of UWB without attenuation of pulse width. The hardware structure of the TDMC pulse for the single band UWB system was modelled after describing the pulse in a mathematical method in an attempt to compare with performances of the existing pulses through computer simulation. The outcome of the test unveiled the fact that each center frequency of the TDMG pulse rose approximately 1GHz, and also each l0dB fractional bandwidth of the TDMG pulse was widened over 1GHz. In the case of derivative, center frequencies of the TDMG pulse rose over 1GHz each. As a consequence, the TDMG pulse appeared to have better quality frequency, satisfying the characteristics of spectrum and the band of frequency recommended by the FCC and decreasing interference with other wireless communication systems.
A Tree Scatternet Formation Algorithm for Reducing Average Hop Count Between Bluetooth Devices
Kang, Seung-Ho ; Kang, Dae-Wook ; Lim, Hyeong-Seok ;
The KIPS Transactions:PartC, volume 11C, issue 3, 2004, Pages 401~408
DOI : 10.3745/KIPSTC.2004.11C.3.401
The Bluetooth Scatternet based on tree structure has several merits such as small numb of links and simple routing method. This paper proposes an algorithm which satisfies the constraints of Bluetooth Specification and forms the topology of scatternet as close as the tree structure that has the shortest average inter-node distance among trees. Also we show that the proposed method reduces the average hop count between any two devices compared to early works without higher formation delay by a simulation.