A personalized range‐sensitive privacy‐preserving scheme in LBSs. (27th August 2019)

• Record Type: Journal Article
• Authors: Li, Weihao; Niu, Ben; Cao, Jin; Luo, Yurong; Li, Hui
• Is Part Of: Concurrency and computation. Volume 32:Number 5(2020)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2019-08-27
• Subjects: location privacy -- privacy protection -- query privacy -- social networks; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.5462
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: Mobile social network has become a necessary part in our daily life, and location‐based services (LBSs) provide unprecedented convenience to mobile users. However, these attracting services are accompanied with privacy disclosures, including location privacy and query privacy. Mobile users have to expose their personal information to untrusted location‐based service provider (LSP) in order to obtain relevant service data. To address these privacy issues, we proposed a personalized range‐sensitive privacy‐preserving scheme, called PRPS, which considers the relationship between locations, query ranges, and query contents. Moreover, PRPS employs map storing algorithm (MSA) to facilitate the storage of two‐dimensional local map, reducing the cost of storage. Furthermore, range estimating algorithm (REA) adopts binary quad‐tree to decide the query radius of each submitted location, avoiding inference attacks by adversary. The requirements generating algorithm (RGA) selects relevant query content for each dummy location, guaranteeing mobile user's location privacy and query privacy. Finally, we illustrate the privacy analysis to proof PRPS's privacy degree; then, the performance and privacy evaluation results indicate that the proposed PRPS is effective and efficient.