版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Cent S Univ Sch Informat Sci & Engn Changsha 410083 Peoples R China Univ Texas San Antonio Dept Informat Syst & Cyber Secur San Antonio TX 78249 USA Guangzhou Univ Sch Comp Sci & Educ Software Guangzhou 510006 Guangdong Peoples R China Hunan Univ Coll Comp Sci & Elect Engn Changsha 410082 Hunan Peoples R China Hunan Univ Sci & Technol Sch Comp Sci & Engn Xiangtan 411201 Peoples R China
出 版 物:《FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE》 (下代计算机系统)
年 卷 期:2018年第86卷
页 面:881-892页
核心收录:
学科分类:08[工学] 0812[工学-计算机科学与技术(可授工学、理学学位)]
基 金:National Natural Science Foundation of China [61632009, 61472451, 61402161] High Level Talents Program of Higher Education in Guangdong Province [2016ZJ01] Hunan Provincial Education Department of China [2015C0589] Hunan Provincial Natural Science Foundation of China [2015JJ3046] Fundamental Research Funds for the Central Universities of Central South University [2016zzts058]
主 题:Location privacy Uniform grid Caching Order-preserving symmetric encryption (OPSE) k-anonymity
摘 要:With the increasing popularity of location-based services (LBSs), there is a corresponding increase in the potential for location privacy leakage. Existing solutions generally introduce a fully-trusted third party between the users and the location service provider (LSP). However, such an approach offers limited privacy guarantees and incurs high communication overhead. Specifically, once a fully-trusted third party is compromised, user information would likely be exposed. In this paper, we propose a solution designed to enhance location privacy in LBSs. Our scheme is based on the uniform grid, and adopts both order preserving symmetric encryption (OPSE) and k-anonymity technique. Thus, the anonymizer knows nothing about a user s real location, and it can only implement simple matching and comparison operations. In our approach, we also employ an entity (hereafter referred to as the converter) to transform the user defined grid structure into the uniform grid structure. This combined with the caching mechanism, allow us to avoid repeated queries from different users on the same query spatial region and consequently, reduce the overhead of the LBS server. The analysis and simulation results demonstrate that our proposal can effectively preserve a user s location privacy, with reduced overheads at the anonymizer and the LBS server. (C) 2017 Elsevier B.V. All rights reserved.