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 17C, Issue 6 - Dec 2010
Volume 17C, Issue 5 - Oct 2010
Volume 17C, Issue 4 - Aug 2010
Volume 17C, Issue 3 - Jun 2010
Volume 17C, Issue 2 - Apr 2010
Volume 17C, Issue 1 - Feb 2010
Selecting the target year
A Light-Weight RFID Distance Bounding Protocol
Ahn, Hae-Soon ; Bu, Ki-Dong ; Yoon, Eun-Jun ; Nam, In-Gil ;
The KIPS Transactions:PartC, volume 17C, issue 4, 2010, Pages 307~314
DOI : 10.3745/KIPSTC.2010.17C.4.307
Recently, it is proved that contactless smart-card based RFID tags, which is used for proximity authentication, are vulnerable to relay attacks with various location-based attacks such as distance fraud, mafia fraud and terrorist fraud attacks. Moreover, distance bounding protocols have been researched to prevent these relay attacks that can measure the message transmitted round-trip time between the reader and the tag. In 2005, Hancke and Kuhn first proposed an RFID distance bounding protocol based on secure hash function. However, the Hancke-Kuhn protocol cannot completely prevent the relay attacks because an adversary has (3/4)
attack success probability. Thus, this paper proposes a new distance-bounding protocol for light-weight RFID systems that can reduce to (5/8)
for the adversary's attack success probability. As a result, the proposed protocol not only can provide high-space efficient based on a secure hash function and XOR operation, but also can provide strong security against the relay attacks because the adversary's attack success probability is optimized to (5/8)
The Attitude of the Internet Users to Real-Name System and Suggestions for Measures to Handle Adverse Effects of Anonymity - Focused on Comparison between a Group of Experts and a Group of Non-Experts -
Baek, Shin-Jung ;
The KIPS Transactions:PartC, volume 17C, issue 4, 2010, Pages 315~326
DOI : 10.3745/KIPSTC.2010.17C.4.315
Today's society is being caught in a whirlpool of change that is not behind the Industrial Revolution, the Reformation and so on. Technological determinism is the most general perspective that explains information society. It is the belief that information technology will bring about a particular form of information society. It is the opinion that the sequence of change of technology is inevitable and asks for a particular social change(Kim, 2006). When technology asks for it, however, not only the degree of technological development but also the credibility of the degree of technological development plays an important role in changing a society. This study was implemented based on the opinion that social change and individual change can vary depending on the degree of trust of people in the Internet technology. This study analyzes preferences of real-name system depending on the credibility of anonymity on the Internet and its influences on the behaviors of users, focused on the survey on the difference between ordinary users and users related to the Internet business. It also suggests not only the potential and the appropriateness of anonymity on the Internet, but also measures to alleviate adverse effects of it. Lastly, the objective of this study is to offer a dispute of real-name system and the standard of the anonymity policy on web sites.
The Analyst of Inavi Navigation user Information by Digital Forensic
Choi, Yong-Seok ; Seo, Ki-Min ; Lim, Kyung-Soo ; Lee, Sang-Jin ;
The KIPS Transactions:PartC, volume 17C, issue 4, 2010, Pages 327~334
DOI : 10.3745/KIPSTC.2010.17C.4.327
The operated type of navigation is composed of hardware or software. The navigation based on software is stored and ran in the external storage(e.g. SD card). For the convenience of users, Many car navigation systems store user information such as frequently visited place, route, and so on. Those can be used to proving the alibi of users as well as their relationship between the actual owner of the vehicle through data and time information analysis. Therefore, if it is analyzed datas of navigation, we can get a lot of information such as user's movement, route of car. There are important implications in the digital forensics because it's available for investigating the various crimes. This paper demonstrates the necessary information in the digital investigation through the analysis of stored data in the navigation.
The Acquisition Methodology Study of User Trace Data in Mac OS X
Choi, Joon-Ho ; Lee, Sang-Jin ;
The KIPS Transactions:PartC, volume 17C, issue 4, 2010, Pages 335~346
DOI : 10.3745/KIPSTC.2010.17C.4.335
Mac OS X is the Computer Operating System that develop in Apple Inc. Mac OS X is the successor to Mac OS 9 Version which had been Apple's primary operating system since 1984. Recently, Mac OS X 10.6 (Snow Leopard) has been manufactured and is distributed to user. Apple's Mac OS X Operating System is occupying about 10% in the world Operating System market share. But, Forensic tools that is utilized on digital forensic investigation can not forensic analysis about Mac OS X properly. To do forensic investigation about Mac OS X, information connected with user's action and trace can become important digital evidence in Operating System. This paper presents way about user trace data acquisition methodology in Mac OS X.
A Study on Appropriate Device Authentication Scheme Based PKI for Exchangeable CAS (XCAS)
Hwang, Yu-Na ; Jeong, Han-Jae ; Won, Dong-Ho ; Kim, Seung-Joo ;
The KIPS Transactions:PartC, volume 17C, issue 4, 2010, Pages 347~360
DOI : 10.3745/KIPSTC.2010.17C.4.347
A condition access system (CAS) refers to a hardware-based system that allows only authenticated users to have access to contents. The CAS has many disadvantages found in that in the replacement of multiple service operator (MSO) a set-top box should be also changed and the smart-card often causes malfunction. To deal with the problems, exchangeable CAS (XCAS) was developed in 2009. However, in the XCAS, no method to authenticate a proper set-top box has been put forward. In this paper, we propose a novel program for set-top authentication in the XCAS. Additionally, we offer a format of certificate of authentication, and procedures of issuing the certificate for broadcasting services suitable for the XCAS. The technical method of authentication a set-top box that will be discussed is of high efficiency since in the MSO it requires only two subjects to communicate during the authentication in the MSO.
Vulnerabilities Analysis of the OTP Implemented on a PC
Hong, Woo-Chan ; Lee, Kwang-Woo ; Kim, Seung-Joo ; Won, Dong-Ho ;
The KIPS Transactions:PartC, volume 17C, issue 4, 2010, Pages 361~370
DOI : 10.3745/KIPSTC.2010.17C.4.361
OTP(One Time Password) is a user authentication using secure mechanism to authenticate each other in a way to generate a password, an attacker could intercept the password to masquerade as legitimate users is a way to prevent attacks. The OTP can be implemented as H/W or S/W. Token and card type OTP, implemented as H/W, is difficult to popularize because of having problem with deployment and usability. As a way to replace it implemented as S/W on Mobile or PC is introduced. However, S/W products can be target of malicious attacks if S/W products have vulnerability of implementation. In fact, FSA said the OTP implemented on a mobile have vulnerability of implementation. However, the OTP implemented on a PC have no case about analysis of vulnerability. So, in this paper derive security review and vulnerabilities analysis of implemented on a PC.
Design and Implementation of Flooding based Energy-Efficiency Routing Protocol for Wireless Sensor Network
Lee, Myung-Sub ; Park, Chang-Hyeon ;
The KIPS Transactions:PartC, volume 17C, issue 4, 2010, Pages 371~378
DOI : 10.3745/KIPSTC.2010.17C.4.371
In this paper, we propose a new energy-efficient routing algorithm for sensor networks that selects a least energy consuming path among the paths formed by node with highest remaining energy and provides long network lifetime and uniform energy consumption by nodes. The pair distribution of the energy consumption over all the possible routes to the base station is one of the design objectives. Also, an alternate route search mechanism is proposed to cope with the situation in which no routing information is available due to lack of remaining energy of the neighboring nodes. Simulation results show that our algorithm extends the network lifetime and enhances the network reliability by maintaining relatively uniform remaining energy distribution among sensor nodes.
A Traffic-Aware Cluster Based Routing Protocol for Non-uniformly Distributed Mobile Ad Hoc Networks
Hamm, Yong-Gil ; Kim, Yong-Seok ;
The KIPS Transactions:PartC, volume 17C, issue 4, 2010, Pages 379~384
DOI : 10.3745/KIPSTC.2010.17C.4.379
Mobile nodes in high mobility ad hoc networks might come together in specific areas. In non-uniformly distributed networks, traffic load can be concentrated to intermediate nodes between dense clusters, and networks performance can be degraded. In this paper, we proposed a cluster based routing protocol that heavy traffic nodes adaptively react according to traffic load. The simulation result shows that the proposed protocol reduce packet loss and end-to-end delay.
Performance Evaluation of Coalition and Bargaining Games for Efficient and Fair Bandwidth Allocation
Park, Jae-Sung ;
The KIPS Transactions:PartC, volume 17C, issue 4, 2010, Pages 385~390
DOI : 10.3745/KIPSTC.2010.17C.4.385
Fair and efficient bandwidth allocation methods using the coalition game theory and the bargaining game theory following the axiomatic approach have been proposed when sending nodes with different traffic input rate try to share the bandwidth. These methods satisfy the axiomatic fairness provided by the mathematical ground of the game theories. However, since the axioms of the two game models are different from one another, the allocated bandwidths to each sending nodes become different even in the same communication environments. Thus, in this paper, we model the bandwidth allocation problem with these game theories, and quantitatively compare and analyze the allocated bandwidth and loss rate of each sending nodes in various communication environments. The results show that the bargaining game allocates relatively less bandwidth to a node with a higher sending rate than that with a lower sending rate while coalition game allocates bandwidth according to the sending rate of each node.