• Journal of Internet Computing and Services
• /
• v.19 no.5
• /
• pp.13-19
• /
• 2018

Although it's been nearly decade since the electronic notarization system enforced, the utilization is not high because of the troublesomeness of the client or his agent to visit the notarial office directly. Recently, the ministry of justice introduced e-notary based on audio-visual conference through amendament of the notarial law, and hence it will vitalize the usage of e-notary. In addition, due to the spread of smartphones, many people use SMS messages to express simple statements or promises. However, in case of legal disputes, the judgment of the court is different according to the case. The electronic notarization system can be used to prove of evidence of SMS messages, however, there is a hassle to convert SMS messages to electronic documents. To solve this problem, this paper proposes an SMS notarization system using smartphones. The proposed system uses reliable notarization server and it is divided into notarization system for message senders and notarization system for message receivers according to notary requestor.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.10
• /
• pp.33-43
• /
• 2011

Recently, advances in mobile communication and location identifying technology of the moving object is evolving. Therefore, the location-based services based on request for service have increased and a variety of the indexing for the position management of moving objects has been studied. Because the index based on Euclidean space are no restriction of movement, it is difficult to apply to the real world. Also, there is additional cost to find adjacent road segments in road networks-based indexing. Existing studies of fixed static objects such as buildings or hospitals are not considered. In this paper, we propose an efficient road networks-based indexing for management of current positions. The proposed indexing partitions road networks by grids and has integrated road connection informations and manage separated extra indexing for fixed static objects. Through the experiment, we show that the proposed indexing based on road networks improves the performance of operation for search or update than existing indexing.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.5
• /
• pp.243-248
• /
• 2014

This study presents an investigation into the ways to detect the areas of object movement with Kinect's Depth Frame, which is capable of receiving 3D information regardless of external light sources. Applied to remove noises along the boundaries of objects among the depth information received from sensors were the blurring technique for the x and y coordinates of pixels and the frequency filter for the z coordinate. In addition, a clustering filter was applied according to the changing amounts of adjacent pixels to extract the areas of moving objects. It was also designed to detect fast movements above the standard according to filter settings, being applicable to mobile robots. Detected movements can be applied to security systems when being delivered to distant places via a network and can also be expanded to large-scale data through concerned information.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.3
• /
• pp.239-244
• /
• 2014

As the usefulness of mobile device is kept growing the privacy of the cloud computing is receiving more attentions. Even though many researches and solutions for privacy matters are suggested we are still worrying about the security problems. In addition most of cloud computing systems uses file-level synchronization which make it difficult to modify a part of a file. If we use data-centric app that stores data on embedded DBMS such as SQLite, a simple synchronization may incur some loss of information. In this paper we propose a solution to build a personal cloud that supports record-level synchronization. And we show a prototype system which uses RESTful web services and the same schema on mobie devices and the cloud storage. Synchronization is achieved by using a kind of optimistic concurrency control.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.3
• /
• pp.605-614
• /
• 2012

Nowadays u-healthcare which is very sensitive to the character of user's information among other ubiquitous computing field is popular in medical field. u-healthcare deals extremely personal information including personal health/medical information so it is exposed to various weaknees and threats in the part of security and privacy. In this paper, RFID based patient's information protecting protocol that prevents to damage the information using his or her mobile unit illegally by others is proposed. The protocol separates the authority of hospital(doctor, nurse, pharmacy) to access to patient's information by level of access authority of hospital which is registered to management server and makes the hospital do the minimum task. Specially, the management server which plays the role of gateway makes access permission key periodically not to be accessed by others about unauthorized information except authorized information and improves patient's certification and management.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.127-130
• /
• 2007

Skin detection research is important role in the 3G of mobile phone for video telephony and security system by using face recognition. We propose skin detection algorithm as preprocessing to the face recognition, and use YCbCr color space. In existing skin detection algorithm using CbCr, skin colors that is brightened by camera flash or sunlight at outdoor in images doesn't acknowledged the skin region. In order to detect skin region accuracy into any circumstance, this paper proposes 3-channel skin detection algorithm.

• Journal of KIISE
• /
• v.42 no.11
• /
• pp.1459-1466
• /
• 2015

Lockscreen is one of the most frequently encountered interfaces by smartphone users. Although users perform unlocking actions every day, there are no benefits in using lockscreens apart from security and authentication purposes. In this paper, we replace the traditional lockscreen with an application that analyzes facial expressions in order to collect facial expression data and provide real-time feedback to users. To evaluate this concept, we have implemented Quantified Lockscreen application, supporting the following contributions of this paper: 1) an unobtrusive interface for collecting facial expression data and evaluating emotional patterns, 2) an improvement in accuracy of facial expression detection through a personalized machine learning process, and 3) an enhancement of the validity of emotion data through bidirectional, multi-channel and multi-input methodology.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.6
• /
• pp.379-386
• /
• 2014

Recently, middleboxes play a key role in many network settings such as firewalls, VPN gateways, proxies, intrusion detection and prevention systems, and WAN optimizers. However, achieving the performance and security benefits that middleboxes offer is highly complex, and therefore it is essential to manage middleboxes efficiently and dynamically. In this respect, Software-Defined Networking (SDN) offers a promising solution for middlebox policy enforcement by using logically centralized management, decoupling the data and control planes, and providing the ability to programmatically configure forwarding rules. Also, cloud computing and distributed Network Function Virtualization (NFV) can enable to manage middleboxes more easily. We introduce SDN-based middlebox management framework in integrated wired and wireless networks and discuss the further issues.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.1
• /
• pp.29-37
• /
• 2006

Due to the spread of mobile communication with the development of computer network, nowadays various types of multimedia data play an important role in many areas such as entertainments, culture contents, e-commerce or medical science. But for the real application of these data, the security in the course of saving or transferring them through the public network should be assured. In this sense, many encryption algorithm have been developed and utilized. Nonetheless, most of them have focused on the text data. So they may not be suitable to the multimedia application because of their large size and real time constraint. In this paper, a chaotic map has been employed to create a symmetric stream type of encryption scheme which may be applied to the digital images with a large amounts of data. Then an efficient algebraic encryption algorithm based on the elementary operations of the Boolean matrix and image data characteristics.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.939-955
• /
• 2010

With the progress of IT and mobile positioning technologies, various types of location-based services (LBS) have been proposed and implemented. Finding a shortest path between two nodes is one of the most fundamental tasks in many LBS related applications. So far, there have been many research efforts on the shortest path finding problem. For instance, $A^*$ algorithm estimates neighboring nodes using a heuristic function and selects minimum cost node as the closest one to the destination. Pruning method, which is known to outperform the A* algorithm, improves its routing performance by avoiding unnecessary exploration in the search space. For pruning, shortest paths for all node pairs in a map need to be pre-computed, from which a shortest path container is generated for each edge. The container for an edge consists of all the destination nodes whose shortest path passes through the edge and possibly some unnecessary nodes. These containers are used during routing to prune unnecessary node visits. However, this method shows poor performance as the number of unnecessary nodes included in the container increases. In this paper, we focus on this problem and propose a new border line-based pruning scheme for path routing which can reduce the number of unnecessary node visits significantly. Through extensive experiments on randomly-generated, various complexity of maps, we empirically find out optimal number of border lines for clipping containers and compare its performance with other methods.