• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.8
• /
• pp.606-610
• /
• 2009

In Location-Based Service (LBS), a scheme to hide the exact locations of users is required for privacy protection, In this paper, we propose a grid-based cloaking method considering K-anonymity and L-diversity. For this, our method creates a minimum cloaking region by finding L number of buildings (L-diversity) and then finding number of users (K-anonymity). Especially, we use a effective filtering method for generating the minimum cloaking region in a fast way. Finally, we show from a performance analysis that our cloaking method outperforms the existing method, in terms of query processing time based on the size of cloaking regions.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.4
• /
• pp.1-10
• /
• 2008

In wireless internet, the location information of the user is one of the important resources for many applications. One of these applications is Location-Based Services (LBSs) which are being popular. Because, in the LBS system, users request a location-based query to LBS servers by sending their exact location, the location information of the users can be misused by adversaries. In this regard, there must be a mechanism which can deal with privacy protection of the users. In this paper, we propose a cloaking method considering both features of K-anonymity and L-diversity. Our cloaking method creates a minimum cloaking region by finding L number of buildings (L-diversity) and then finding number of users (K-anonymity). To support this, we use a R*-tree based index structure and use filtering methods especially for the m inimum cloaking region. Finally, we show from a performance analysis that our method outperforms the existing grid based cloaking method.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.1
• /
• pp.115-126
• /
• 2009

Recent development in wireless communication and mobile positioning technologies makes Location-Based Services (LBSs) popular. However, because, in the LBSs, users request a query to database servers by using their exact locations, the location information of the users can be misused by adversaries. Therefore, a mechanism for users' privacy protection is required for the safe use of LBSs by mobile users. For this, we, in this paper, propose a efficient cloaking region creation scheme using Hilbert curves in distributed grid environment, so as to protect users' privacy in LBSs. The proposed scheme generates a minimum cloaking region by analyzing the characteristic of a Hilbert curve and computing the Hilbert curve values of neighboring cells based on it, so that we may create a cloaking region to satisfy K-anonymity. In addition, to reduce network communication cost, we make use of a distributed hash table structure, called Chord. Finally, we show from our performance analysis that the proposed scheme outperforms the existing grid-based cloaking method.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.3
• /
• pp.19-30
• /
• 2009

Recent development in wireless communication technology and mobile equipment like PDA, cellular phone and GPS makes location-based services (LBSs) popular. However, because, in the LBSs, users continuously request a query to LBS servers by using their exact locations, privacy information could be in danger. Therefore, a mechanism for users' privacy protection is required for the safe and comfortable use of LBSs by mobile users. For this, this paper propose a grid-based cloaking area creation scheme supporting continuous LBSs. The proposed scheme creates a cloaking area rapidly by using grid-based cell expansion to efficiently support the continuous LBSs. In addition, to generate a cloaking area which makes the exposure probability of a mobile user to a minimum, we compute a privacy protection degree by granting weights to mobile users. Finally, we show from a performance analysis that our cloaking scheme outperforms the existing cloaking schemes, in terms of service time, privacy protection degree.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2010.06a
• /
• pp.155-163
• /
• 2010

최근 PDA, 휴대폰과 같은 모바일 기기 및 GPS와 같은 무선 통신 기술의 발달로 인하여 위치 기반 서비스의 이용이 확산되었다. 하지만 이러한 서비스는 사용자가 도로 네트워크에서 이동하면서 자신의 위치정보를 통해 LBS 서버에 질의를 요청하기 때문에, 심각한 개인 정보 누출의 위협이 될 수 있다. 따라서 모바일 사용자의 안전하고 편리한 위치기반 서비스 사용을 위한 개인 정보 보호 방법이 필요하다. 이를 위해 본 논문에서는 도로 네트워크 거리를 고려한 사용자 정보 보호를 지원하는 cloaking 영역 설정 기법을 제안한다. 제안하는 기법은 도로 네트워크에서 효율적이고 안전한 위치기반 서비스를 지원하기 위하여, 도로 네트워크의 거리를 고려하여 cloaking 영역을 설정한다. 마지막으로 성능평가를 통해서 제안하는 기법이 cloaking 영역 및 서비스 시간 측면에서 기존 연구보다 우수함을 보인다.

• Spatial Information Research
• /
• v.18 no.3
• /
• pp.53-62
• /
• 2010

Recent development in wireless communication technology, like GPS, and mobile equipments, like PDA and cellular phone, make location-based services (LBSs) popular. However, because, users continuously request a query to a server in the LBSs by using their exact locations, privacy information could be in danger. Therefore, a mechanism for users' privacy protection is required for the safe and comfortable use of LBSs by mobile users. For this, we, in this paper, propose a grid-based cloaking area creation scheme supporting continuous LBSs in peer-to-peer environment. The proposed scheme creates a cloaking area by using Chord protocol, so as to support the continuous LBSs in peer-to-peer environment. Finally, we show from a performance analysis that our cloaking scheme outperforms the existing cloaking schemes, in terms of service time.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06a
• /
• pp.41-44
• /
• 2011

논문은 위치기반 서비스에서 사용자의 위치 정보를 보호하기 위해 필요한 요구사항들을 정리하고, 기존에 연구되었던 기법들을 비교 분석하여 앞에서의 요구사항을 얼마나 충족하는지에 대하여 살펴본다. 또한 기존의 기법들이 충족하지 못하는 부문을 해결하기 위하여 시간대별로 통계화된 밀도 정보를 기반으로 Cloaking 영역을 생성하는 기법을 제안하여 사용자들이 위치기반 서비스를 사용함에 있어서 기존의 기법보다 더 효율적으로 사용자의 위치정보를 보호할 수 있음을 보인다.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.3
• /
• pp.47-57
• /
• 2013

Location privacy has been a serious concern for mobile users who use location-based services to acquire geographical location continuously. Spatial cloaking technique is a well-known privacy preserving method, which blurs an exact user location into a cloaked area to meet privacy requirements. However, cloaking for continuous moving object suffers from cloaked area size problem as it is unlikely for all objects travel in the same direction. In this paper, we propose a grid-based privacy preservation method with an improved Earth Mover's Distance(EMD) metric weight update scheme for semantic cloaking. We also define a representative cloaking area which protects continuous location privacy for moving users. Experimental implementation and evaluation exhibit that our proposed method renders good efficiency and scalability in cloaking processing time and area size control. We also show that our proposed method outperforms the existing method by successfully protects location privacy of continuous moving objects against various adversaries.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2010.06a
• /
• pp.53-60
• /
• 2010

위치 기반 서비스(Location-Based Services: LBS)에서 질의 요청자가 자신의 위치 정보와 원하는 질의를 전송하면, 위치 기반 서버는 이를 기반으로 질의를 처리하고 결과를 전송한다. 이 때 질의 요청자는 자신의 정확한 위치 좌표를 서버에 전송하기 때문에 개인 정보가 악용될 수 있는 위험에 노출된다. 이러한 문제를 해결하기 위하여 제안된 연구는 크게 Location Clocking 기법과 Private Information Retrieval(PIR) 기법으로 분류된다. Location Cloaking 기법은 사용자의 위치 좌표를 k-1개의 다른 사용자와 함께 묶어 하나의 Cloaking 영역을 생성하고 이를 바탕으로 질의를 처리한다. 그러나 영역에 대한 질의 후보 집합을 결과로 전송하므로 사용자에게 노출되는 POI 수가 증가하는 문제점을 지닌다. PIR은 암호화 기법으로 위치 기반 서버나 공격자에게 사용자의 위치와 질의 타입을 드러내지 않고 질의를 수행한다. 그러나 암호화 된 질의 결과로 사용자에게 데이터 전체를 전송하기 때문에 막대한 통신비용을 초래한다. 따라서 본 논문에서는 Location Cloakng과 PIR 기법의 장점을 결합하여 사용자의 개인 정보와 위치 기반 서버의 POI 정보 보호를 고려한 Approximate k-최근접점 질의 처리 알고리즘을 제안한다. 질의 전송시, 질의 요청자는 Cloaking 영역을 생성하여 위치 좌표를 감추고, 질의 결과 전송 시 Cloaking 영역에 제한된 PIR 프로토콜을 적용한다. 또한 k-최근접점 질의 수행시, 반환되는 POI의 수를 최소화하고, 정확도 높은 질의 결과를 만족하기 위해 Overlapping parameter를 적용한 색인 기법을 제안한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.8B
• /
• pp.929-938
• /
• 2011

The setting algorithm of cloaking region using dummy which is proposed in this paper solves the problem which counts the building with duplication that exists in several cells of Privacy Grid by adding the building grouping item to the index structure of the existing Privacy Grid, and by increasing K value after searching the contiguous cells in the comer of each building, the exposure problem of private location information due to the minimum cloaking region setting of the existing GBC is solved. In addition, this paper reduces the searching time of K value by setting smaller cloaking region than Privacy Grid and GBC with dummy K before expanding cloaking region and strengthens the location information protection of users using dummy K.