• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.902-905
• /
• 2005

In this paper we challenge the mobile node Authentication using Java Card authentication protocol in Ad-hoc network environment. Ad-hoc network is a collection of wireless mobile nodes without the support of a stationary infrastructure. and DSR routing protocol, which is one of famous mobile ad-hoc rooting protocols, has the following network path problem. this paper is the security structure that defined in a mobile network and security and watches all kinds of password related technology related to the existing authentication system. It looks up weakness point on security with a problem on the design that uses Ad-hoc based structure and transmission hierarchical security back of a mobile network, and a server-client holds for user authentication of an application level all and all, and it provides one counterproposal. Java Card Authentication of mobile node can possibly be applied to the area of M-Commerce, Wireless Security, and Ubiquitous Computing and so on.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.5
• /
• pp.59-71
• /
• 2005

A RFID (Radio Frequency Identification) system receives attention as the technology which can realize the ubiquitous computing environment. However, the feature of the RFID tags may bring about new threats to the security and privacy of individuals. Recently, Juels proposed the minimalist cryptography for very low-cost RFID tags, which is secure. but only under the impractical assumption such that an adversary is allowed to eavesdrop only the pre-defined number of sessions. In this paper, we propose a scheme to protect privacy for very low-cost RFID systems. The proposed protocol uses only bit-wise operations without my costly cryptographic function such as hashing, encryption which is secure which is secure against an adversary who is allowed to eavesdrop transmitted message in every session any impractical assumption. The proposed scheme also is more efficient since our scheme requires less datas as well as few number of computations than Juels's scheme.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.1
• /
• pp.11-23
• /
• 2007

In this paper, we design and implement a framework based on Web Services for effective management of the profiles that were proposed to provide a user with personalized service. The profiles must be constituted the related information of the user and could be exchanged according to cyclic.acyclic or event among user's device, profile repository and service server for providing the user with personalized service. The profiles also must be supplied the services providers that need to the profiles for the personalized service. The profile framework is necessary to provide the functions like this for managing effectively of the personalized service. The proposed framework used the Web Services for exchanging and providing the profile regardless the various devices and platform. The framework also was applied the metadata constitute method and dynamic constitute method for managing effectively of the profile. The result of experiment using proposed framework was effective process and management of the profile and could exchange the profile with regardless of platform and device. The implemented system using the proposed framework was foundation of providing the personalized services with a user by through a effective management function of the profile.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10c
• /
• pp.253-257
• /
• 2007

최근 웹 상에 정보가 폭발적으로 증가함에 따라, 사용자의 취향에 맞는 정보를 선별하여 제공하는 추천 시스템에 대한 연구가 활발히 진행되고 있다. 추천시스템은 사용자의 관심정보를 기술한 사용자 프로파일을 기반으로 동작하기 때문에 정확한 사용자 프로파일의 생성은 매우 중요하다. 사용자의 암시적인 행동정보를 기반으로 취향을 분석하는 대표적인 연구로 사용자가 이용한 웹 문서를 분석하는 방법이 있다. 이는 사용자가 이용하는 웹 문서에 빈번하게 등장하는 단어를 기반으로 사용자의 프로파일을 생성하는 것이다. 그러나 최근 웹 문서는 사용자 취향과 관련 없는 많은 구성요소들(로고, 저작권정보 등)을 포함하고 있다. 따라서 이러한 내용들을 모두 포함하여 웹 문서를 분석한다면 생성되는 프로파일의 정확도는 낮아질 것이다. 따라서 본 논문에서는 사용자 기기에서 사용자의 웹 문서 이용내역을 분석하고, 동일한 사이트로부터 얻어진 문서들에서 반복적으로 등장하는 블록을 제거한 후, 정보블럭을 식별하여 사용자의 관심단어를 추출하는 새로운 프로파일 생성방법을 제안한다. 이를 통해 보다 정확하고 빠른 프로파일 생성이 가능해진다. 본 논문에서는 제안방법의 평가를 위해, 최근 구매활동이 있었던 사용자들이 이용한 웹 문서 데이터를 수집하였으며, TF-IDF 방법과 제안방법을 이용하여 사용자 프로파일을 각각 추출하였다. 그리고 생성된 사용자 프로파일과 구매데이터와의 연관성을 비교하였으며, 보다 정확한 프로파일이 추출되는 결과와 프로파일 분석시간이 단축되는 결과를 통해 제안방법의 유효성을 입증하였다.)으로 높은 점수를 보였으며 내장첨가량에 따른 관능특성에서는 온쌀죽은 내장 $2{\sim}5%$ 첨가, 반쌀죽은 내장 $3{\sim}5%$ 첨가구에서 유의적(p<0.05)으로 높은 점수를 보였으나 쌀가루죽은 내장 $1{\sim}2%$ 첨가구에서 유의적(p<0.05)으로 낮은 점수를 보였다. 이상의 연구 결과를 통해 온쌀은 2%, 반쌀은 3%, 쌀가루는 4%의 내장을 첨가하여 제조한 전복죽이 이화학적, 물성적 및 관능적으로 우수한 것으로 나타났다.n)방법의 결과와 비교하였다.다. 유비스크립트에서는 모바일 코드의 개념을 통해서 앞서 언급한 유비쿼터스 컴퓨팅 환경에서의 문제점을 해결하고자 하였다. 모바일 코드에서는 프로그램 코드가 네트워크를 통해서 컴퓨터를 이동하면서 수행되는 개념인데, 이는 물리적으로 떨어져있으면서 네트워크로 연결되어 있는 다양한 컴퓨팅 장치가 서로 연동하기 위한 모델에 가장 적합하다. 이는 기본적으로 배포(deploy)라는 단계가 필요 없게 되고, 새로운 버전의 프로그램이 작성될지라도 런타임에 코드가 직접 이동하게 되므로 버전 관리의 문제도 해결된다. 게다가 원격 함수를 매번 호출하지 않고 한번 이동된 코드가 원격지에서 모두 수행을 하게 되므로 성능향상에도 도움이 된다. 장소 객체(Place Object)와 원격 스코프(Remote Scope)는 앞서 설명한 특징을 직접적으로 지원하는 언어 요소이다. 장소 객체는 모바일 코드가 이동해서 수행될 계산 환경(computational environment

• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.67-83
• /
• 2008

In order to realize ubiquitous computing, it is essential to efficiently use the resources and the computing power of mobile devices. Among others, memory efficiency, energy efficiency, and processing efficiency are required in executing the softwares embedded in mobile devices. In this paper, query processing over XML data in a mobile device where resources are limited is addressed. In a device with limited amount of memory, the techniques of XML. stream query processing need to be employed to process queries over a large volume of XML data Recently, a technique Galled XFrag was proposed whereby XML data is fragmented with the hole-filler model and streamed in fragments for processing. With XFrag, query processing is possible in the mobile device with limited memory without reconstructing the XML data out of its fragment stream. With the hole-filler model, however, memory efficiency is not high because the additional information on holes and fillers needs to be stored. In this paper, we propose a new technique called XFLab whereby XML data is fragmented with the XML labeling scheme which is for representing the structural relationship in XML data, and streamed in fragments for processing. Through implementation and experiments, XML showed that our XFLab outperformed XFrag both in memory usage and processing time.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.855-861
• /
• 2009

This paper presents the concept of dynamically reconfigurable space by introducing smart building components. Thanks to the advances in ubiquitous computing and ITC technology, we are able to expect, in the near future, the aspects of future buildings which may transform their appearance and states to perform specific functions. In other words, it is certain that the building space will actively reconfigure itself to accommodate user's needs once we acquire proper technologies. Based on the assumption that building components may not be transformed through the magical process, but change its physical states (e.g. transparency, illumination, display contents, etc.) and functions of embedded devices (e.g. audio, actuators, sensors, etc.), we can envision a dynamically reconfigurable smart space. In order to conceptualize such spaces, critical surveys have been conducted on current works of leading architects. When the room needs to be used as a specific function room, the components need to change theirs states or to behave in a certain manner to create an optimum environment. Our model defines the relationships and elements to describe the mechanism of reconfigurable space. We expect this model provides a conceptual guideline for developing a smart building components based on spatial service scenarios. Therefore, a future smart spaces implemented by integrating various technologies are not designed in deterministic manner, so that spatial functions are expanded without constrained by physical existence.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.1
• /
• pp.207-214
• /
• 2016

RFID technology is a technology perceiving information with the device called reader and tag which is now used in public transportation such as Hi-pass. In this paper, we design a system which tracks indoor location using this technology. GPS, the most frequently used location-tracking system, has a defect that its accuracy decreases when the device is indoor. In suggested experiment, we simulate signals according to the moving of located objects, then compare with the result of the experiment. Based on the extracted data, we inform data which is for the purpose of tracking system based on analysis of the route and errors. Simulations for the tracking were performed with relocation of real objects. In the real experiment, we arrange the readers around the room and move the tagged object that we like to know the location, then analyze the data from the equipment. This paper suggests the analyzed data for the future indoor tag tracking applications. We expect that the RFID based location positioning data will be used for other indoor positioning research and development.

• The KIPS Transactions:PartC
• /
• v.14C no.3 s.113
• /
• pp.229-238
• /
• 2007

Sensor networks consist of many tiny sensor nodes that collaborate among themselves to collect, process, analyze, and disseminate data. In sensor networks, sensor nodes are typically powered by batteries, and have limited computing resources. Moreover, the redeployment of nodes by energy exhaustion or their movement makes network topology change dynamically. These features incur problems that do not appear in traditional, wired networks. Security in sensor networks is challenging problem due to the nature of wireless communication and the lack of resources. Several efforts are underway to provide security services in sensor networks, but most of them are preventive approaches based on cryptography. However, sensor nodes are extremely vulnerable to capture or key compromise. To ensure the security of the network, it is critical to develop suity mechanisms that can survive malicious attacks from "insiders" who have access to the keying materials or the full control of some nodes. In order to protect against insider attacks, it is necessary to understand how an insider can attack a sensor network. Several attacks have been discussed in the literature. However, insider attacks in general have not been thoroughly studied and verified. In this paper, we study the insider attacks against routing protocols in sensor networks using the Ad-hoc On-Demand Distance Vector (AODV) protocol. We identify the goals of attack, and then study how to achieve these goals by modifying of the routing messages. Finally, with the simulation we study how an attacker affects the sensor networks. After we understand the features of inside attacker, we propose a detect mechanism using hop count information.

• The KIPS Transactions:PartC
• /
• v.16C no.2
• /
• pp.151-164
• /
• 2009

The importance of sensor networks as a base of ubiquitous computing realization is being highlighted, and espicially the security is recognized as an important research isuue, because of their characteristics.Several efforts are underway to provide security services in sensor networks, but most of them are preventive approaches based on cryptography. However, sensor nodes are extremely vulnerable to capture or key compromise. To ensure the security of the network, it is critical to develop security Intrusion Detection System (IDS) that can survive malicious attacks from "insiders" who have access to keying materials or the full control of some nodes, taking their charateristics into consideration. In this perper, we design a distributed and adaptive IDS architecture on sensor networks, respecting both of energy efficiency and IDS efficiency. Utilizing a modified HEED algorithm, a clustering algorithm, distributed IDS nodes (dIDS) are selected according to node's residual energy and degree. Then the monitoring results of dIDSswith detection codes are transferred to dIDSs in next round, in order to perform consecutive and integrated IDS process and urgent report are sent through high priority messages. With the simulation we show that the superiorities of our architecture in the the efficiency, overhead, and detection capability view, in comparison with a recent existent research, adaptive IDS.

• Journal of KIISE:Software and Applications
• /
• v.36 no.9
• /
• pp.732-748
• /
• 2009

The technology of Semantic Web realizes the base technology for context-awareness that creates new services by dynamically and flexibly combining various resources (people, concepts, etc). According to the realization of ubiquitous computing technology, many researchers are currently working for the embodiment of web service. However, most studies of them bring about the only predefined results those are limited to the initial description by service designer. In this paper, we propose a new service supporting model to provide an automatic method for plan related tasks which achieve goal state from initial state. The inputs on an planner are intial and goal descriptions which are mapped to the current situation and to the user request respectively. The idea of the method is to infer context from world model by DL-based ontology reasoning using OWL domain ontology. The context guide services to be loaded into planner. Then, the planner searches and plans at least one service to satisfy the goal state from initial state. This is STRIPS-style backward planner, and combine OWL-S services based on AI planning theory that enabling reduced search scope of huge web-service space. Also, when feasible service do not find using pattern matching, we give user alternative services through DL-based semantic searching. The experimental result demonstrates a new possibility for realizing dynamic service modeler, compared to OWLS-XPlan, which has been known as an effective application for service composition.