• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.9
• /
• pp.397-406
• /
• 2017

In case of using the existing encrypted algorithm for massive data encryption service under the cloud environment, the problem that requires much time in data encryption come to the fore. To make up for this weakness, a partial encryption method is used generally. However, the existing partial encryption method has a disadvantage that the encrypted data can be inferred due to the remaining area that is not encrypted. This study proposes a partial encryption method of increasing the encryption speed and complying with the security standard in order to solve this demerit. The proposed method consists of 3 processes such as header formation, partial encryption and block shuffle. In step 1 Header formation process, header data necessary for the algorithm are generated. In step 2 Partial encryption process, a part of data is encrypted, using LEA (Lightweight Encryption Algorithm), and all data are transformed with XOR of data in the unencrypted part and the block generated in the encryption process. In step 3 Block shuffle process, the blocks are mixed, using the shuffle data stored with the random arrangement form in the header to carry out encryption by transforming the data into an unrecognizable form. As a result of the implementation of the proposed method, applying it to a mobile device, all the encrypted data were transformed into an unrecognizable form, so the data could not be inferred, and the data could not be restored without the encryption key. It was confirmed that the proposed method could make prompt treatment possible in encrypting mass data since the encryption speed is improved by approximately 273% or so compared to LEA which is Lightweight Encryption Algorithm.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.7
• /
• pp.297-306
• /
• 2017

Citizens want more accurate forecast information using Bus Information System. However, most bus information systems that use an average based short-term prediction algorithm include many errors because they do not consider the effects of the traffic flow, signal period, and halting time. In this paper, we try to improve the precision of forecast information by analyzing the influencing factors of the error, thereby making the convenience of the citizens. We analyzed the influence factors of the error using BIS data. It is shown in the analyzed data that the effects of the time characteristics and geographical conditions are mixed, and that effects on halting time and passes speed is different. Therefore, the halt time is constructed using Generalized Additive Model with explanatory variable such as hour, GPS coordinate and number of routes, and we used Hidden Markov Model to construct a pattern considering the influence of traffic flow on the unit section. As a result of the pattern construction, accurate real-time forecasting and long-term prediction of route travel time were possible. Finally, it is shown that this model is suitable for travel time prediction through statistical test between observed data and predicted data. As a result of this paper, we can provide more precise forecast information to the citizens, and we think that long-term forecasting can play an important role in decision making such as route scheduling.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.7
• /
• pp.307-314
• /
• 2017

Stick-PC is small and portable, So it can be used like a desktop if you connect it to a display device such as a monitor or TV anytime and anywhere. Accordingly, Stick-PC can related to various crimes, and various evidence may remain. Stick-PC uses the same Windows version of the operating system as the regular Desktop, the artifacts to be analyzed are the same. However, unlike the Desktop, it can be used as a meaningful information for forensic investigation if it is possible to identify the actual user and trace the usage by finding the traces of peripheral devices before analyzing the system due to the mobility. In this paper, We presents a method of collecting images using Bootable OS, which is one of the image collection methods of Stick-PC. In addition, we show how to analyze the trace of peripheral connection and network connection trace such as Display, Bluetooth through the registry and event log, and suggest the application method from the forensic point of view through experimental scenario.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.2
• /
• pp.59-66
• /
• 2017

MySQL database is the second place in the market share of the current database. Especially InnoDB storage engine has been used in the default storage engine from the version of MySQL5.5. And many companies are using the MySQL database with InnoDB storage engine. Study on the structural features and the log of the InnoDB storage engine in the field of digital forensics has been steadily underway, but for how to restore on a record-by-record basis for the deleted data, has not been studied. In the process of digital forensic investigation, database administrators damaged evidence for the purpose of destruction of evidence. For this reason, it is important in the process of forensic investigation to recover deleted record in database. In this paper, We proposed the method of recovering deleted data on a record-by-record in database by analyzing the structure of MySQL InnoDB storage engine. And we prove this method by tools. This method can be prevented by database anti forensic, and used to recover deleted data when incident which is related with MySQL InnoDB database is occurred.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.4
• /
• pp.179-188
• /
• 2017

It is very challenging to analyze the traffic flow in the city because there are lots of traffic accidents, intersections, and pedestrians etc. Now, even in mid-size cities Bus Information Systems(BIS) have been deployed, which have offered the forecast of arriving times at the stations to passengers. BIS also provides more informations such as the current locations, departure-arrival times of buses. In this paper, we perform the time-series analysis of the traffic flow using the data of the average trvel time and the average speed between stations extracted from the BIS. In the mid size cities, the data from BIS will have a important role on prediction and analysis of the traffic flow. We used the Dynamic Linear Model(DLM) for how to make the time series forecasting model to analyze and predict the average speeds at the given locations, which seem to show the representative of traffics in the city. Especially, we analysis travel times for weekdays and weekends separately. We think this study can help forecast the traffic jams, congestion areas and more accurate arrival times of buses.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.4
• /
• pp.189-196
• /
• 2017

BIS(Bus Information System) provides the different information related to buses including predictions of arriving times at stations. BIS have been deployed almost all cities in our country and played active roles to improve the convenience of public transportation systems. Moving average filters, Kalman filter and regression models have been representative in forecasting the arriving times of buses in current BIS. The accuracy in prediction of arriving times depends largely on the forecasting algorithms and traffic conditions considered when forecasting in BIS. In present BIS, the simple prediction algorithms are used only considering the passage times and distances between stations. The forecasting of arrivals, however, have been influenced by the traffic conditions such as traffic signals, traffic accidents and pedestrians ets., and missing data. To improve the accuracy of bus arriving estimates, there are big troubles in building models including the above problems. Hidden Markov Models have been effective algorithms considering various restrictions above. So, we have built the HMM forecasting models for bus arriving times in the current BIS. When building models, the data collected from Sunchean City at 2015 have been utilized. There are about 2298 stations and 217 routes in Suncheon city. The models are developed differently week days and weekend. And then the models are conformed with the data from different districts and times. We find that our HMM models can provide more accurate forecasting than other existing methods like moving average filters, Kalmam filters, or regression models. In this paper, we propose Hidden Markov Model to obtain more precise and accurate model better than Moving Average Filter, Kalman Filter and regression model. With the help of Hidden Markov Model, two different sections were used to find the pattern and verified using Bootstrap process.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.6
• /
• pp.271-280
• /
• 2017

In this paper, we propose a new safety system composed of wearable devices, driver's seat belt, and integrating controllers. The wearable device and driver's seat belt capture driver's biological information, while the integrating controller analyzes captured signal to alarm the driver or directly control the car appropriately according to the status of the driver. Previous studies regarding driver's safety from driver's seat, steering wheel, or facial camera to capture driver's physiological signal and facial information had difficulties in gathering accurate and continuous signals because the sensors required the upright posture of the driver. Utilizing wearable sensors, however, our proposed system can obtain continuous and highly accurate signals compared to the previous researches. Our advanced wearable apparatus features a sensor that measures the heart rate, skin conductivity, and skin temperature and applies filters to eliminate the noise generated by the automobile. Moreover, the acceleration sensor and the gyro sensor in our wearable device enable the reduction of the measurement errors. Based on the collected bio-signals, the criteria for identifying the driver's condition were presented. The accredited certification body has verified that the devices has the accuracy of the level of medical care. The laboratory test and the real automobile test demonstrate that our proposed system is good for the measurement of the driver's condition.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.6
• /
• pp.281-288
• /
• 2017

In Smart-cities, various types of integrated services must be linked to provide services to applications. Therefore, flexibility must be ensured between services so that various services can be efficiently provided. In order to secure the flexibility among services, it is very important to have a function to dynamically discover and invoke a desired service by searching for a semantic service by reflecting a recognized context through real-time context-aware in smart-cities. To date, quite a number of semantic service discovery techniques have been developed. However, they have not been verified as suitable for use in the smart-city domain. In this study, we tried to verify the existing ones to use a suitable one. We tested most of existing semantic service discovery techniques, but we found that none of them is suitable to our research. Therefore, we developed our own semantic service discovery technique. This paper introduces our work and presents the performance evaluation results that demonstrate that our developed works well and show good performance. For the performance evaluation, the experimental system was actually constructed and the real performance was measured. In the experiment, we implemented the semantic service discovery scenario that dynamically searches and calls the services needed to provide fire accident management services in smart cities.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.10
• /
• pp.421-428
• /
• 2017

The need for various approaches to non-face-to-face identification technology for registering and authenticating users online is being required because of the growth of online financial services and the rapid development of financial technology. In general, non-face-to-face approaches can be exposed to a greater number of threats than face-to-face approaches. Therefore, identification policies and technologies to verify users by using various factors and channels are being studied in order to complement the risks and to be more reliable non-face-to-face identification methods. One of these new approaches is to collect and verify a large number of personal information of user. Therefore, we propose a big-data based non-face-to-face Identity Proofing method that verifies identity on online based on various and large amount of information of user. The proposed method also provides an identification information management scheme that collects and verifies only the user information required for the identity verification level required by the service. In addition, we propose an identity information sharing model that can provide the information to other service providers so that user can reuse verified identity information. Finally, we prove by implementing a system that verifies and manages only the identity assurance level required by the service through the enhanced user verification in the non-face-to-face identity proofing process.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.10
• /
• pp.429-436
• /
• 2017

There is a growing tendency to outsource sensitive or important data in cloud computing recently. However, it is very important to protect the privacy of outsourced data. So far, a variety of secure and efficient multi-keyword search schemes have been proposed in cloud computing environment composed of a single data owner and multiple data users. Zhang et. al recently proposed a search protocol based on multi-keyword in cloud computing composed of multiple data owners and data users but their protocol has two problems. One is that the cloud server can illegally infer the relevance between data files by going through the keyword index and user's trapdoor, and the other is that the response for the user's request is delayed because the cloud server has to execute complicated operations as many times as the size of the keyword index. In this paper, we propose an improved multi-keyword based search protocol which protects the privacy of outsourced data under the assumption that the cloud server is completely unreliable. And our experiments show that the proposed protocol is more secure in terms of relevance inference between the data files and has higher efficiency in terms of processing time than Zhang's one.