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 18C, Issue 6 - Dec 2011
Volume 18C, Issue 5 - Oct 2011
Volume 18C, Issue 4 - Aug 2011
Volume 18C, Issue 3 - Jun 2011
Volume 18C, Issue 2 - Apr 2011
Volume 18C, Issue 1 - Feb 2011
Selecting the target year
A Study on a Variable P box Generation Using a DES Key Expansion
Lee, Jun ;
The KIPS Transactions:PartC, volume 18C, issue 5, 2011, Pages 287~292
DOI : 10.3745/KIPSTC.2011.18C.5.287
Using an expanded DES key, we suggest a block cipher algorithm to generate and to use a variable P box. We also present an efficient way for the implementation of variable P box at each round. Using counter examples on Differential Cryptanalysis(DC) and Linear Cryptanalysis(LC), we show that the suggested algorithm is strong enough to overcome those attacks. Compared with the real key bits of triple DES(3DES), the new algorithm is much safer in the points of the exhaustive attack. The results of computer simulations show that the new algorithm is almost 3 times faster than 3DES regarding the cipher process time.
A Study on Providing Secure Storage and User Authentication Using MTM on Mobile Platform
Lee, Sun-Ho ; Lee, Im-Yeong ;
The KIPS Transactions:PartC, volume 18C, issue 5, 2011, Pages 293~302
DOI : 10.3745/KIPSTC.2011.18C.5.293
The various information services can be delivered by smartphone through advanced high-speed mobile communication. A smartphone is a mobile device that offers more powerful computing capacity than feature phone. Therefore this device can provide such as web surfing, editing documents, playing video, and playing games. A lot of personal information stored on smartphone. Because it has High usability. Personal information Leaks if the smart phone is lost or stolen may become a big problem. In this paper we have analyzed existing method for providing secure storage and user authentication on mobile platform and derived security requirement. Therefore we propose the following scheme that satisfy security requirement. Proposed scheme providing secure storage with preventing authentication bypass, and availability from damaged data to access secure area.
Monitoring-Based Secure Data Aggregation Protocol against a Compromised Aggregator in Wireless Sensor Networks
Anuparp, Boonsongsrikul ; Lhee, Kyung-Suk ; Park, Seung-Kyu ;
The KIPS Transactions:PartC, volume 18C, issue 5, 2011, Pages 303~316
DOI : 10.3745/KIPSTC.2011.18C.5.303
Data aggregation is important in wireless sensor networks. However, it also introduces many security problems, one of which is that a compromised node may inject false data or drop a message during data aggregation. Most existing solutions rely on encryption, which however requires high computation and communication cost. But they can only detect the occurrence of an attack without finding the attacking node. This makes sensor nodes waste their energy in sending false data if attacks occur repeatedly. Even an existing work can identify the location of a false data injection attack but it has a limitation that at most 50% of total sensor nodes can participate in data transmission. Therefore, a novel approach is required such that it can identify an attacker and also increase the number of nodes which participate in data transmission. In this paper, we propose a monitoring-based secure data aggregation protocol to prevent against a compromised aggregator which injects false data or drops a message. The proposed protocol consists of aggregation tree construction and secure data aggregation. In secure data aggregation, we use integration of abnormal data detection with monitoring and a minimal cryptographic technique. The simulation results show the proposed protocol increases the number of participating nodes in data transmission to 95% of the total nodes. The proposed protocol also can identify the location of a compromised node which injects false data or drops a message. A communication overhead for tracing back a location of a compromised node is O(n) where n is the total number of nodes and the cost is the same or better than other existing solutions.
Implementation of Security Policies of ONSU-MF(One Network Security Unit-Multi Function) and OSD-MD(One Security Device-Multi Defense)
Seo, Woo-Seok ; Lee, Gyn-An ; Jun, Moon-Seog ;
The KIPS Transactions:PartC, volume 18C, issue 5, 2011, Pages 317~326
DOI : 10.3745/KIPSTC.2011.18C.5.317
This study is meaningful in that it standardizes various security and defense policies and devices, newly defines characteristics of defense policies and defense techniques, and specify and report various kinds of security polities and devices in order for administrators or users to add and apply the policies when introducing new security policies including the implementation of existing network infra and applying additionally. Therefore, this study aims to divide the policies into ONSU-MF(One Network Security Unit-Multi Function) that classifies one network security device-based policies and OSD-MD(One Security Device-Multi Defense), which implements various security methods by using one security device, and suggest network security infra improvement mechanism through the standardization implementation technique integrating the two methods.
A Location based Two-Factor L-OTP Protocol
Seo, Hwa-Jeong ; Kim, Ho-Won ;
The KIPS Transactions:PartC, volume 18C, issue 5, 2011, Pages 327~330
DOI : 10.3745/KIPSTC.2011.18C.5.327
After releasing the smart phone equipping the strong computational capability compared to traditional mobil phone, a field of services, which is available on the personal computers, is expanded to smart phone. The development of technology reduces the limited service utilization on time and space but it has a venerability exposing an information to malicious user. Especially we need to more attention when using the financial services which communicate the user's private information. To solve the security problem, OTP(One Time Pad), which uses a private key for a session, is recommended. OTP techniques in smart phone having focused on traditional environments have been proposed and implemented. However, security over mobile environments is more vulnerable to attack and has restriction on resources than traditional system. For this reason, definition of proper conceptual OTP on smart phone is required. In the paper, we present the L-OTP(Location-OTP) protocol, using T-OTP(Time One Time Pad) technique with location information. Proposal generates the OTP using unique location information which is obtained in smart phone.
Improvement of a Verified Secure Key Distribution Protocol Between RFID and Readers
Bae, Woo-Sik ; Lee, Jong-Yun ;
The KIPS Transactions:PartC, volume 18C, issue 5, 2011, Pages 331~338
DOI : 10.3745/KIPSTC.2011.18C.5.331
The RFID system includes a section of wireless communication between the readers and the tags. Because of its vulnerability in terms of security, this part is always targeted by attackers and causes various security problems including the leakage of secret and the invasion of privacy. In response to these problems, various protocols have been proposed, but because many of them have been hardly implementable they have been limited to theoretical description and theorem proving without the accurate verification of their safety. Thus, this study tested whether the protocol proposed by Kenji et al. satisfies security requirements, and identified its vulnerabilities such as the exposure of IDs and messages. In addition, we proposed an improved RFID security protocol that reduced the number of public keys and random numbers. As one of its main characteristics, the proposed protocol was designed to avoid unnecessary calculations and to remove vulnerabilities in terms of security. In order to develop and verify a safe protocol, we tested the protocol using Casper and FDR(Failure Divergence Refinements) and confirmed that the proposed protocol is safe in terms of security. Furthermore, the academic contributions of this study are summarized as follows. First, this study tested the safety of a security protocol through model checking, going beyond theorem proving. Second, this study suggested a more effective method for protocol development through verification using FDR.
Network-based Mobility Control in Mobile LISP Networks
Choi, Sang-Il ; Kim, Ji-In ; Koh, Seok-Joo ;
The KIPS Transactions:PartC, volume 18C, issue 5, 2011, Pages 339~342
DOI : 10.3745/KIPSTC.2011.18C.5.339
This paper proposes a network-based mobility control scheme in wireless/mobile networks, which is based on the Locator-Identifier Separation Protocol (LISP). Compared to the existing LISP mobility scheme, the proposed scheme is featured by the following two points: 1) each LISP Tunnel Router (TR) is implemented at the first-hop access router that mobile nodes are attached to, and 2) for handover support, the LISP Routing Locator (RLOC) update operation is performed between Ingress TR and Egress TR. By numerical analysis, it is shown that the proposed scheme can reduce the handover latency much more than the other candidate schemes.
IPv6 Migration, OSPFv3 Routing based on IPv6, and IPv4/IPv6 Dual-Stack Networks and IPv6 Network: Modeling, and Simulation
Kim, Jeong-Su ;
The KIPS Transactions:PartC, volume 18C, issue 5, 2011, Pages 343~360
DOI : 10.3745/KIPSTC.2011.18C.5.343
The objective of this paper is to analyze and characterize to simulate routing observations on end-to-end routing circuits and a ping experiment of a virtual network after modeling, such as IPv6 migration, an OSPFv3 routing experiment based on an IPv6 environment, and a ping experiment for IPv4/IPv6 dual-stack networks and IPv6 network for OSPFv3 routing using IPv6 planning and operations in an OPNET Modeler. IPv6 deployment based largely on the integrated wired and wireless network was one of the research tasks at hand. The previous studies' researchers recommended that future research work be done on the explicit features of both OSPFv3 and EIGRP protocols in the IPv4/IPv6 environment, and more research should be done to explore how to improve the end-to-end IPv6 performance. Also, most related work was performed with an IPv4 environment but lacked studies related to the OSPFv3 virtual network based on an end-to-end IPv6 environment. Hence, this research continues work in previous studies in analyzing IPv6 migration, an OSPFv3 routing experiment based on IPv6, and a ping experiment for IPv4/IPv6 dual-stack networks and IPv6 network for OSPFv3 routing. In the not too distant future, before enabling the default IPv6, it would help to understand network design and deployment based on an IPv6 environment through IPv6 planning and operations for the end-user perspective such as success or failure of connection on IPv6 migration, exploration of an OSPFv3 routing circuit based on an end-to-end IPv6 environment, and a ping experiment for IPv4/IPv6 dual-stack networks and IPv6 network for OSPFv3 routing. We were able to observe an optimal route for modeling of an end-to-end virtual network through simulation results as well as find what appeared to be a fast ping response time VC server to ensure Internet quality of service better than an HTTP server.
Star-Based Node Aggregation for Hierarchical QoS Routing
Kwon, So-Ra ; Jeon, Chang-Ho ;
The KIPS Transactions:PartC, volume 18C, issue 5, 2011, Pages 361~368
DOI : 10.3745/KIPSTC.2011.18C.5.361
In this study, we present a method for efficiently aggregating networks state information required to determine feasible paths in transport networks that uses the source routing algorithm for hierarchical QoS routing. It is proposed to transform the full mesh topology whose Service Boundary Line serves as its logical link into the star topology. This is an aggregation method that can be used when there are two or more QoS parameters for the link to be aggregated in an asymmetric network, and it improves the information accuracy of the star topology. For this purpose, the Service Boundary Line's 3 attributes, splitting, joining and integrating, are defined in this study, and they are used to present a topology transformation method. The proposed method is similar to space complexity and time complexity of other known techniques. But simulation results showed that aggregated information accuracy and query response accuracy is more highly than that of other known method.