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 19C, Issue 4 - Aug 2012
Volume 19C, Issue 3 - Jun 2012
Volume 19C, Issue 2 - Apr 2012
Volume 19C, Issue 1 - Feb 2012
Selecting the target year
Methods for Investigating of Edit History about MS PowerPoint Files That Using the OOXML Formats
Youn, Ji-Hye ; Park, Jung-Heum ; Lee, Sang-Jin ;
The KIPS Transactions:PartC, volume 19C, issue 4, 2012, Pages 215~224
DOI : 10.3745/KIPSTC.2012.19C.4.215
Today, individuals and businesses are a lot of paperwork through a computer. So many documents files are creating to digital type. And the digital type files are copied, moved by various media such as USB, E-mail and so on. A careful analysis of these digital materials can be tracked that occurred during the document editing work history. About these research are on the compound document file format, but has not been studied about the new OOXML format that how to analyze linkages between different document files, tracking an internal order, finding unsaved file for identify the process of creating the file. Future, the use of OOXML format digital documents will further increase, these document work history traceability in digital forensic investigation would be a big help. Therefore, this paper on the new OOXML format(has a forensic viewpoint) will show you how to track the internal order and analyze linkages between the files.
Threshold Encryption Scheme based on Cocks' IBE Scheme
Bezzateev, Sergey V. ; Kim, Dae-Youb ;
The KIPS Transactions:PartC, volume 19C, issue 4, 2012, Pages 225~230
DOI : 10.3745/KIPSTC.2012.19C.4.225
Since one of weak points of public crypto-systems is to require the verification of public key, identity based crypto-systems were proposed as an alternative. However, such techniques need a private key generator which can be a single point of failure. To improve such weakness, threshold identity-based crypto-systems were proposed. In this paper, we propose a new threshold identity-based encryption scheme which is constructed to extend an identity-based encryption scheme by Cocks. Since the proposed scheme is based on quadratic residues, it has smaller complexity of encryption. And we prove that the proposed scheme is secure against a chosen identity attack.
A New Logging Scheme in Smart Devices for Digital Evidences
Shin, Weon ;
The KIPS Transactions:PartC, volume 19C, issue 4, 2012, Pages 231~234
DOI : 10.3745/KIPSTC.2012.19C.4.231
Logging is an important part of any secure computer system. By analyzing logs in computer systems, you can identify early various problems and detect intrusions by attackers. Also logs can use to collect digital evidences in smart devices and to be forensics value for cybercrime investigations. In this paper, we propose a new logging scheme for smart devices and improve it to apply various environments. The proposed scheme satisfies the requirements of logging for smart devices. Thus it will help to develop a better logging in smart devices for digital evidences.
Application Authentication via Various Distributors
Han, Kyu-Suk ; Shon, Tae-Shik ;
The KIPS Transactions:PartC, volume 19C, issue 4, 2012, Pages 235~238
DOI : 10.3745/KIPSTC.2012.19C.4.235
Google Android provides market based application distribution to provide ease use of application services. While openness of Android allows various ways of application distribution, including installation of unsigned application. such openness also invokes critical threats such as the spread of malwares and the illegal distribution of applications. In order to prevent such threats, several distributors use on-line authentication techniques by using mobile subscriber's information. However such methods also have limits that even legal users cannot use their purchased application in situations. Therefore, in this paper, we discuss such problems and provide some ideas of authentication method that allow users to use their purchased application when users change their status.
Location Estimation Method using Extended Kalman Filter with Frequency Offsets in CSS WPAN
Nam, Yoon-Seok ;
The KIPS Transactions:PartC, volume 19C, issue 4, 2012, Pages 239~246
DOI : 10.3745/KIPSTC.2012.19C.4.239
The function of location estimation in WPAN has been studied and specified on the ultra wide band optionally. But the devices based on CSS(Chirp Spread Spectrum) specification has been used widely in the market because of its functionality, cheapness and support of development. As the CSS device uses 2.4GHz for a carrier frequency and the sampling frequency is lower than that of the UWB, the resolution of a timestamp is very coarse. Then actually the error of a measured distance is very large about 30cm~1m at 10 m depart. And the location error in (
) environment is known as about 1m~2m. So for some applications which require more accurate location information, it is very natural and important to develop a sophisticated post processing algorithm after distance measurements. In this paper, we have studied extended Kalman filter with the frequency offsets of anchor nodes, and proposed a novel algorithm frequency offset compensated extended Kalman filter. The frequency offsets are composed with a variable as a common frequency offset and constants as individual frequency offsets. The proposed algorithm shows that the accurate location estimation, less than 10cm distance error, with CSS WPAN nodes is possible practically.
Comparison of Parallelized Network Coding Performance
Choi, Seong-Min ; Park, Joon-Sang ; Ahn, Sang-Hyun ;
The KIPS Transactions:PartC, volume 19C, issue 4, 2012, Pages 247~252
DOI : 10.3745/KIPSTC.2012.19C.4.247
Network coding has been shown to improve various performance metrics in network systems. However, if network coding is implemented as software a huge time delay may be incurred at encoding/decoding stage so it is imperative for network coding to be parallelized to reduce time delay when encoding/decoding. In this paper, we compare the performance of parallelized decoders for random linear network coding (RLC) and pipeline network coding (PNC), a recent development in order to alleviate problems of RLC. We also compare multi-threaded algorithms on multi-core CPUs and massively parallelized algorithms on GPGPU for PNC/RLC.