• Spatial Information Research
• /
• 제20권4호
• /
• pp.83-92
• /
• 2012

무선 통신 기술 및 GPS(Global Positioning System)등의 발달로 인하여 위치 기반 서비스 (Location-Based Services: LBS)가 크게 발전하는 추세이다. 그러나 위치 기반 서비스를 이용하기 위해 질의 요청자는 자신의 정확한 위치 정보를 위치 기반 서비스 제공자에게 전송해야 한다. 따라서 위치 기반 서비스를 제공하면서 질의 요청자의 위치 정보를 보호하는 것이 중요한 과제이다. 이 문제를 해결하기 위해, 기존 기법은 실제 사용자의 위치를 숨기며 네트워크 사용을 줄일 수 있는 2PASS 기법을 사용하였다. 그러나 이 기법은 실제 사용자 분포를 고려하지 않기 때문에 실제 사용자 위치 보호를 완전히 보장하지 않는다. 따라서 본 논문에서는 K-anonymity를 보장하는 가중치 근접성 그래프 기반 최근접 질의처리 알고리즘을 제안한다. 제안하는 알고리즘은 질의 영역 내 K-anonymity를 보장함으로써 사용자의 위치 정보를 보호할 뿐만 아니라 불필요한 질의 결과 탐색을 줄여 네트워크 효율을 증가시킨다. 마지막으로, 성능평가를 통해 제안하는 기법이 기존 연구에 비해 질의 처리 시간 및 네트워크 효율 측면에서 우수함을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권6호
• /
• pp.3199-3218
• /
• 2019

Location-based services (LBSs) have become popular in recent years due to the ever-increasing usage of smart mobile devices and mobile applications through networks. Although LBS application provides great benefits to mobile users, it also raises a sever privacy concern of users due to the untrusted service providers. In the lack of privacy enhancing mechanisms, most applications of the LBS may discourage the user's acceptance of location services in general, and endanger the user's privacy in particular. Therefore, it is a great interest to discuss on the recent privacy-preserving mechanisms in LBSs. Many existing location-privacy protection-mechanisms (LPPMs) make great efforts to increase the attacker's uncertainty on the user's actual whereabouts by generating a multiple of fake-locations together with user's actual positions. In this survey, we present a study and analysis of existing LPPMs and the state-of-art privacy measures in service quality aware LBS applications. We first study the general architecture of privacy qualification system for LBSs by surveying the existing framework and outlining its main feature components. We then give an overview of the basic privacy requirements to be considered in the design and evaluation of LPPMs. Furthermore, we discuss the classification and countermeasure solutions of existing LPPMs for mitigating the current LBS privacy protection challenges. These classifications include anonymization, obfuscation, and an encryption-based technique, as well as the combination of them is called a hybrid mechanism. Finally, we discuss several open issues and research challenges based on the latest progresses for on-going LBS and location privacy research.

• 한국정보전자통신기술학회논문지
• /
• 제9권6호
• /
• pp.526-533
• /
• 2016

위치기반서비스(LBS; location based services)에서 사용자의 위치를 보호하는 연구가 많은 관심을 받아오고 있다. 특히 k-익명화(k-anonymity)를 이용한 연구가 가장 인기 있는 사생활 보호 기법이다. k-익명화란 k-1개의 다른 더미(dummy) 또는 클라이언트를 선택하여 클로킹 영역을 계산하는 기법을 말한다. 질의자는 신뢰할 수 없는 서버 또는 공격자에게 1/k의 확률로 자신의 위치 노출 확률을 줄일 수 있다. 그러나 더미가 사용자 주변에 밀집되어 있거나 질의자가 존재할 수 없는 곳에 더미가 생성된다면 질의자의 위치가 공격자에게 노출될 수 있다. 따라서 본 논문에서 우리는 실제 도로환경을 고려해서 더미를 생성함으로서 사용자의 위치보호를 높일 수 있는 시스템 모델과 알고리즘을 제안한다. 실험 결과를 통하여 제안기법의 우수성을 증명하였다.

• 한국컴퓨터정보학회논문지
• /
• 제18권3호
• /
• pp.47-57
• /
• 2013

최근 스마트폰의 발전에 따라서 많은 위치 기반 서비스가 활용되고 있으며, 위치 정보 노출로 인한 문제점이 사회적 이슈로 대두되고 있다. 기존의 잘 알려진 위치 정보 보호를 위한 공간 클로킹 기법은 사용자가 요청한 지역에서 위치 정보를 흐릿하게 처리하였다. 하지만 계속적으로 움직이는 이동 객체의 모든 지역을 클로킹하기에는 범위공간이 무수히 넓어지는 문제를 가진다. 따라서, 본 논문에서는 이동 객체 정보 보호를 위한 그리드 기반 시멘틱 클로킹 기법을 제안한다. 제안 기법은 시멘틱 클로킹을 위하여 EMD 갱신 스키마를 확장하고 이동 객체를 위한 대표 보호지역의 클로킹을 정의하였다. 성능 평가에서는 제안 기법이 기존 기법에 비해 처리 시간과 공간 범위에서 안전성과 효율성을 높였다. 이를 통해, 성공적으로 다양한 적으로부터 지속적으로 움직이는 객체의 위치 개인 정보를 보호하여 기존의 방법을 능가하는 성능을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권8호
• /
• pp.3328-3349
• /
• 2020

With rapid development of ubiquitous computing and location-based services (LBSs), human trajectory data and associated activities are increasingly easily recorded. Inappropriately publishing trajectory data may leak users' privacy. Therefore, we study publishing trajectory data while preserving privacy, denoted privacy-preserving activity trajectories publishing (PPATP). We propose S-PPATP to solve this problem. S-PPATP comprises three steps: modeling, algorithm design and algorithm adjustment. During modeling, two user models describe users' behaviors: one based on a Markov chain and the other based on the hidden Markov model. We assume a potential adversary who intends to infer users' privacy, defined as a set of sensitive information. An adversary model is then proposed to define the adversary's background knowledge and inference method. Additionally, privacy requirements and a data quality metric are defined for assessment. During algorithm design, we propose two publishing algorithms corresponding to the user models and prove that both algorithms satisfy the privacy requirement. Then, we perform a comparative analysis on utility, efficiency and speedup techniques. Finally, we evaluate our algorithms through experiments on several datasets. The experiment results verify that our proposed algorithms preserve users' privay. We also test utility and discuss the privacy-utility tradeoff that real-world data publishers may face.

• 한국비블리아학회지
• /
• 제20권4호
• /
• pp.143-157
• /
• 2009

본 연구는 시설 프로그램, 면적 구성비, 공간 구획, 순환 시스템 등 공간 구성의 분석을 통해 고문헌 전문도서관의 건축 계획 및 설계에 대한 기초적인 자료를 제공하는데 목적을 두며, 이러한 과정을 통하여 도출된 본 연구의 결과는 다음과 같다. 첫째, 각 사례의 공간구성은 크게 자료영역, 이용자영역, 사무/유지관리영역, 서비스/공공부분으로 구분되며, 각 영역은 세부영역으로 구분된다. 둘째, 자료영역은 다른 영역보다 큰 면적을 차지한다(39~56%). 셋째, 서고의 위치, 보존처리영역의 위치, 하역장의 설치 유무에 따라 다른 특성을 보인다. 넷째, 각 사례의 공간구성체계를 분석하면 각 사례별 공간구성은 자료의 이동경로와 관계가 있다.

• Journal of Computing Science and Engineering
• /
• 제5권3호
• /
• pp.210-222
• /
• 2011

In this work, we study the problem of privacy-preservation data publishing in moving objects databases. In particular, the trajectory of a mobile user in a plane is no longer a polyline in a two-dimensional space, instead it is a two-dimensional surface of fixed width $2A_{min}$, where $A_{min}$ defines the semi-diameter of the minimum spatial circular extent that must replace the real location of the mobile user on the XY-plane, in the anonymized (kNN) request. The desired anonymity is not achieved and the entire system becomes vulnerable to attackers, since a malicious attacker can observe that during the time, many of the neighbors' ids change, except for a small number of users. Thus, we reinforce the privacy model by clustering the mobile users according to their motion patterns in (u, ${\theta}$) plane, where u and ${\theta}$ define the velocity measure and the motion direction (angle) respectively. In this case, the anonymized (kNN) request looks up neighbors, who belong to the same cluster with the mobile requester in (u, ${\theta}$) space: Thus, we know that the trajectory of the k-anonymous mobile user is within this surface, but we do not know exactly where. We transform the surface's boundary poly-lines to dual points and we focus on the information distortion introduced by this space translation. We develop a set of efficient spatiotemporal access methods and we experimentally measure the impact of information distortion by comparing the performance results of the same spatiotemporal range queries executed on the original database and on the anonymized one.

• Journal of Communications and Networks
• /
• 제13권2호
• /
• pp.102-112
• /
• 2011

In this paper, we propose a privacy-preserving emergency call scheme, called PEC, enabling patients in life-threatening emergencies to fast and accurately transmit emergency data to the nearby helpers via mobile healthcare social networks (MHSNs). Once an emergency happens, the personal digital assistant (PDA) of the patient runs the PEC to collect the emergency data including emergency location, patient health record, as well as patient physiological condition. The PEC then generates an emergency call with the emergency data inside and epidemically disseminates it to every user in the patient's neighborhood. If a physician happens to be nearby, the PEC ensures the time used to notify the physician of the emergency is the shortest. We show via theoretical analysis that the PEC is able to provide fine-grained access control on the emergency data, where the access policy is set by patients themselves. Moreover, the PEC can withstandmultiple types of attacks, such as identity theft attack, forgery attack, and collusion attack. We also devise an effective revocation mechanism to make the revocable PEC (rPEC) resistant to inside attacks. In addition, we demonstrate via simulation that the PEC can significantly reduce the response time of emergency care in MHSNs.

• International Journal of Knowledge Content Development & Technology
• /
• 제8권1호
• /
• pp.25-36
• /
• 2018

Research data must be testable. Science is all about verification and testing. To make data testable, tools used to produce, collect, and examine data during the research must be available. Quite often, however, these data become inaccessible once the work is over and the results being published. Hence, information and the related context must be provided on how research data are preserved and how they can be reproduced. Open Science is the international movement for making scientific research data properly accessible for research community. One of its major goals is building data repositories to foster wide dissemination of open data. The objectives of this research are to examine the features of research data, common repository platforms, and community requests for the purpose of designing functional requirements for research data repositories. To analyze the features of the research data, we use data curation profiles available from the Data Curation Center of the Purdue University, USA. For common repository platforms we examine Fedora Commons, iRODS, DataONE, Dataverse, Open Science Data Cloud (OSDC), and Figshare. We also analyze the requests from research community. To design a technical solution that would meet public needs for data accessibility and sharing, we take the requirements of RDA Repository Interest Group and the requests for the DataNest Community Platform developed by the Korea Institute of Science and Technology Information (KISTI). As a result, we particularize 75 requirement items grouped into 13 categories (metadata; identifiers; authentication and permission management; data access, policy support; publication; submission/ingest/management, data configuration, location; integration, preservation and sustainability, user interface; data and product quality). We hope that functional requirements set down in this study will be of help to organizations that consider deploying or designing data repositories.

• 한국환경복원기술학회지
• /
• 제6권6호
• /
• pp.14-24
• /
• 2003

This study had researched use conditions of forty-seven arboreta in the inside and outside of the country for the suggestion of activation plan of provincial arboretum. Chungnam Keum-Kang Arboretum in Kongju-Si, Chung-Cheong Nam-Do, had been surveyed as a case study. The survey was focused on current condition, location, ecological resources, characteristics and so on. In addition, questionnaire of users of Keum-Kang arboretum were conducted. Chungnam Keum-Kang arboretum is located in the inland area and has many vegetations. It is a provincial arboretum which was planted by trees, shrubs and vines, and a public garden which was used by paid admission. It has natural recreation forests, tropical green houses and breeding grounds for birds and wild animals. It, however, has many problem in the use and management system. And the shortages of attraction and program for user are serious problem. For the use activation and the improvement of management of this arboretum, this study suggested as follows ; (1) The responsible experts in charge of the general management of arboretum are demanded. (2) Term master plan for improvement of arboretum must be established. (3) It is necessary to manage for collection, propagation, display and preservation of plant species. (4) It is necessary to hold suitable and variety events for the seasons. (5) It is needed to arrange fitly convenience facilities.