4.7 Article

Highly Efficient Privacy Preserving Location-Based Services with Enhanced One-Round Blind Filter

Journal

IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING
Volume 9, Issue 4, Pages 1803-1814

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TETC.2019.2926385

Keywords

Location-based services; user privacy; homomorphic encryption

Funding

  1. National Key Research and Development Program of China [2017YFB0802300]
  2. Natural Science Foundation of China [61602240]
  3. Natural Science Foundation of Jiangsu Province of China [BK20150760]
  4. China Scholarship Council Scholarship [201806830071]
  5. Postgraduate Research & Practice Innovation Program of Jiangsu Province [KYCX18_0305]

Ask authors/readers for more resources

This paper proposes a novel privacy preserving LBS scheme that utilizes k-anonymity technique and pseudo random function to protect user privacy, and designs an enhanced blind filter protocol based on the Paillier cryptosystem for secure filtering. The proposed scheme ensures user privacy protection and high query efficiency while incurring low computation and communication costs on the server side. Through theoretical analysis and extensive experiments, the security and efficiency of the proposed scheme are demonstrated.
To take advantages of location-based services (LBS) while protecting user privacy against untrusted LBS providers, privacy preserving LBS have attracted increasing attention. Considering that users in an LBS system are often equipped with resource-constrained mobile devices, most existing privacy preserving LBS methods are based on anonymization techniques. However, these existing schemes still have some privacy and efficiency limitations. In this paper, we propose a novel privacy preserving LBS scheme, which simultaneously achieves user privacy protection and high query efficiency. Specifically, we utilize the k-anonymity technique and the pseudo random function to protect the location privacy and the query message privacy of users. We design an enhanced one-round blind filter protocol (ORBFe) based on the Paillier cryptosystem to securely filter out redundant records generated by the k-anonymity technique. Compared with existing solutions, our ORBFe protocol not only ensures that users receive exactly satisfying results but also incurs a low computation and communication cost on the server side. Through the theoretical analysis and extensive experiments, we demonstrate the security and efficiency of our proposed scheme.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available