题名 | Practical K Nearest Neighbor Query Scheme with Two-Party Guarantees in Road Networks |
作者 | |
发表日期 | 2018-09-05 |
会议名称 | 17th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (IEEE TrustCom) / 12th IEEE International Conference on Big Data Science and Engineering (IEEE BigDataSE) |
会议录名称 | Proceedings - 17th IEEE International Conference on Trust, Security and Privacy in Computing and Communications and 12th IEEE International Conference on Big Data Science and Engineering, Trustcom/BigDataSE 2018
![]() |
ISBN | 978-1-5386-4387-7 |
ISSN | 2324-9013 |
页码 | 1316-1321 |
会议日期 | JUL 31-AUG 03, 2018 |
会议地点 | New York, U.S.A. |
摘要 | In order to achieve user's privacy preservation and data security of LBS server in road networks, a query scheme for points of interest(PoI) is proposed in this paper based on oblivious transfer and private information retrieval. The scheme can proceed in two phases: Firstly, we take vertexes in road networks as generating elements to construct a new data structure which is employed to store the distribution information and details of PoIs which are encrypted with different symmetric keys for sake of data security of LBS server. And an oblivious transfer protocol is presented based on the data structure, which facilitates a user to privately obtain the unique key materials corresponding to his interested PoIs without revealing any other PoI information in LBS server since the data is its asset. Then, a private information retrieval protocol is presented to obtain the interested PoI details, the user does not need to provide his location or explicit query content in the query, whereas he can derive an accurate result with the previous key materials, so it guarantees the user's privacy as well. Finally, performance analysis and experiments show that our scheme is more efficient and accurate in a real scenario compared with existing solutions. |
关键词 | K nearest neighbor query location-based service oblivious transfer privacy preservation private information retrieval |
DOI | 10.1109/TrustCom/BigDataSE.2018.00181 |
URL | 查看来源 |
收录类别 | CPCI-S |
语种 | 英语English |
WOS研究方向 | Computer Science |
WOS类目 | Computer Science, Information Systems ; Computer Science, Theory & Methods |
WOS记录号 | WOS:000495072100172 |
Scopus入藏号 | 2-s2.0-85054093887 |
引用统计 | |
文献类型 | 会议论文 |
条目标识符 | https://repository.uic.edu.cn/handle/39GCC9TT/7173 |
专题 | 个人在本单位外知识产出 |
作者单位 | College of Computer Science and Technology, Huaqiao University, Xiamen, China |
推荐引用方式 GB/T 7714 | Zhou, Changli,Wang, Tian,Jiang, Wenxianet al. Practical K Nearest Neighbor Query Scheme with Two-Party Guarantees in Road Networks[C], 2018: 1316-1321. |
条目包含的文件 | 条目无相关文件。 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论