%0 Conference Proceedings
%T A Location Privacy Preserving Method Based on Sensitive Diversity for LBS
%+ Harbin Engineering University
%+ Jia Mu Si University
%+ Harbin Crystal Commercial Photography Co. Ltd
%A Zhou, Changli
%A Ma, Chunguang
%A Yang, Songtao
%A Wu, Peng
%A Liu, Linlin
%Z Part 4: Applications of Parallel and Distributed Computing
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 11th IFIP International Conference on Network and Parallel Computing (NPC)
%C Ilan, Taiwan
%Y Ching-Hsien Hsu
%Y Xuanhua Shi
%Y Valentina Salapura
%I Springer
%3 Network and Parallel Computing
%V LNCS-8707
%P 409-422
%8 2014-09-18
%D 2014
%R 10.1007/978-3-662-44917-2_34
%Z Computer Science [cs]Conference papers
%X A user’s staying points in her trajectory have semantic association with privacy, such as she stays at a hospital. Staying at a sensitive place, a user may have privacy exposure risks when she gets location based service (LBS). Constructing cloaking regions and using fake locations are common methods. But if regions and fake positions are still in the sensitive area, it is vulnerable to lead location privacy exposure. We propose an anchor generating method based on sensitive places diversity. According to the visiting number and peak time of users, sensitive places are chosen to form a diversity zone, its centroid is taken as the anchor location which increases a user’s location diversity. Based on the anchor, a query algorithm for places of interest (POIs) is proposed, and precise results can be deduced with the anchor instead of sending users’ actual location to LBS server. The experiments show that our method achieves a tradeoff between QoS and privacy preserving, and it has a good working performance.
%G English
%Z TC 10
%Z WG 10.3
%2 https://inria.hal.science/hal-01403110/document
%2 https://inria.hal.science/hal-01403110/file/978-3-662-44917-2_34_Chapter.pdf
%L hal-01403110
%U https://inria.hal.science/hal-01403110
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-AICT
%~ IFIP-TC
%~ IFIP-LNCS-8707
%~ IFIP-TC10
%~ IFIP-NPC
%~ IFIP-WG10-3