A New Grid-Based Cloaking Algorithm for Privacy Protection in Location-Based Services

Um, Jung-Ho; Kim, Hyeong-Il; Choi, Young‐Ho; Chang, Jae-Woo

doi:10.1109/hpcc.2009.47

Cited by 9 publications

(6 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The existing cloaking methods with k-anonymity [6,7,8,9,10,11,14,15] don't protect user privacy to support continuous queries. While making cloaking region for each time, the methods include different group of k-1 users so that the unauthorized users are able to detect the query issuer.…”

Section: Related Workmentioning

confidence: 98%

Grid-based cloaking area creation scheme supporting continuous location-based services

Lee

Kim

et al. 2012

Proceedings of the 27th Annual ACM Symposium on Applied Computing

Self Cite

View full text Add to dashboard Cite

Recent development in wireless communication technology and mobile equipment like PDA, cellular phone and GPS is making location-based services (LBSs) more popular day by day. However, because, in the LBSs, users continuously send queries to LBS servers by using their exact locations, private information could be in danger. Therefore, a mechanism for users' privacy protection is required for the safe and comfortable use of LBSs. For this, in this paper, we propose a grid-based cloaking area creation scheme in order to support continuous queries in LBSs. Our 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 lowers the exposure probability of a mobile user to a minimum level, our scheme computes a privacy protection degree by granting weights to the mobile users. Finally, we show from a performance analysis that our cloaking scheme outperforms the existing cloaking schemes in terms of response time and privacy protection degree.

show abstract

Section: Related Workmentioning

confidence: 98%

Grid-based cloaking area creation scheme supporting continuous location-based services

Lee

Kim

et al. 2012

Proceedings of the 27th Annual ACM Symposium on Applied Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…However, a real-time LBS service cannot tolerate any delay of service requests such as in real-time traffic reporting. Although there are some new cloaking methods that have been proposed recently [7,31,32,43,44,50], the basic idea is still adding a third trusted party server to cloak the query before a request for LBS is sent to a provider, the location data in the request is replaced with a cloaked version, which may match at least k mobile devices. An adversary will not be able to determine from the cloaked location which of the k users has originated that request.…”

Section: Literature Reviewmentioning

confidence: 99%

Preserving Privacy for Location-Based Services with Continuous Queries

Wang

Fung

2009

2009 IEEE International Conference on Communications

View full text Add to dashboard Cite

permettant à la Bibliothèque et Archives Canada de reproduire, publier, archiver, sauvegarder, conserver, transmettre au public par télécommunication ou par l'Internet, prêter, distribuer et vendre des thèses partout dans le monde, à des fins commerciales ou autres, sur support microforme, papier, électronique et/ou autres formats. The author retains copyright ownership and moral rights in this thesis. Neither the thesis nor substantial extracts from it may be printed or otherwise reproduced without the author's permission. L'auteur conserve la propriété du droit d'auteur et des droits moraux qui protège cette thèse. Ni la thèse ni des extraits substantiels de celle-ci ne doivent être imprimés ou autrement reproduits sans son autorisation.In compliance with the Canadian Privacy Act some supporting forms may have been removed from this thesis.Conformément à la loi canadienne sur la protection de la vie privée, quelques formulaires secondaires ont été enlevés de cette thèse.While these forms may be included in the document page count, their removal does not represent any loss of content from the thesis.Bien que ces formulaires aient inclus dans la pagination, il n'y aura aucun contenu manquant.

show abstract

“…First of all, our algorithm adds p 1 and p 2 to candidate set. If k is not satisfied, our algorithm expands a border point between q 2 and b 4 because b 4 has the shortest distance to q 2 among border points, as shown in Fig. 3.…”

Section: Definition 8 Adjacent End Border Point (Adjb)mentioning

confidence: 99%

“…Thus, P 3 is added to the candidate set. Nevertheless, if k is still not satisfied, the algorithm should expand the border point of b 4 , thus reaching border points b 6 and b 7 . Moreover, q 1 and q 2 can share the distance between b 4 and b 6 and the distance between b 4 and b 7 as shown in Fig.…”

Section: Definition 8 Adjacent End Border Point (Adjb)mentioning

confidence: 99%

“…The LBS server sends some POI information to answer the user's request. However, the user's exact location can be overheard by adversaries and the user's private information related to his behavior can be revealed [4], [5]. Using the location information, an adversary can track the user's personal habits, and places where he/she visits regularly.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Privacy Protected k-NN Query Processing Algorithm Based on Network Voronoi Diagram in Spatial Networks

Jang

Chang

2014

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYWith the advances in wireless Internet and mobile positioning technology, location-based services (LBSs) have become popular. In LBSs, users must send their exact locations in order to use the services, but they may be subject to several privacy threats. To solve this problem, query processing algorithms based on a cloaking method have been proposed. The algorithms use spatial cloaking methods to blur the user's exact location in a region satisfying the required privacy threshold (k). With the cloaked region, an LBS server can execute a spatial query processing algorithm preserving their privacy. However, the existing algorithms cannot provide good query processing performance. To resolve this problem, we, in this paper, propose a k-NN query processing algorithm based on network Voronoi diagram for spatial networks. Therefore, our algorithm can reduce network expansion overhead and share the information of the expanded road network. In order to demonstrate the efficiency of our algorithms, we have conducted extensive performance evaluations. The results show that our algorithm achieves better performance on retrieval time than the existing algorithms, such as PSNN and kRNN. This is because our k-NN query processing algorithm can greatly reduce a network expansion cost for retrieving k POIs. key words: location based services (LBS), cloaking region based query processing algorithm, k-NN query processing algorithm, Network Voronoi diagram

show abstract

A New Grid-Based Cloaking Algorithm for Privacy Protection in Location-Based Services

Cited by 9 publications

References 6 publications

Grid-based cloaking area creation scheme supporting continuous location-based services

Grid-based cloaking area creation scheme supporting continuous location-based services

Preserving Privacy for Location-Based Services with Continuous Queries

A Privacy Protected k-NN Query Processing Algorithm Based on Network Voronoi Diagram in Spatial Networks

Contact Info

Product

Resources

About