Details of Research Outputs

TitlePractical K Nearest Neighbor Query Scheme with Two-Party Guarantees in Road Networks
Creator
Date Issued2018-09-05
Conference Name17th 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)
Source PublicationProceedings - 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
ISBN978-1-5386-4387-7
ISSN2324-9013
Pages1316-1321
Conference DateJUL 31-AUG 03, 2018
Conference PlaceNew York, U.S.A.
Abstract

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.

KeywordK nearest neighbor query location-based service oblivious transfer privacy preservation private information retrieval
DOI10.1109/TrustCom/BigDataSE.2018.00181
URLView source
Indexed ByCPCI-S
Language英语English
WOS Research AreaComputer Science
WOS SubjectComputer Science, Information Systems ; Computer Science, Theory & Methods
WOS IDWOS:000495072100172
Scopus ID2-s2.0-85054093887
Citation statistics
Cited Times:4[WOS]   [WOS Record]     [Related Records in WOS]
Document TypeConference paper
Identifierhttp://repository.uic.edu.cn/handle/39GCC9TT/7173
CollectionResearch outside affiliated institution
Affiliation
College of Computer Science and Technology, Huaqiao University, Xiamen, China
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Usage statistics
Google Scholar
Similar articles in Google Scholar
[Zhou, Changli]'s Articles
[Wang, Tian]'s Articles
[Jiang, Wenxian]'s Articles
Baidu academic
Similar articles in Baidu academic
[Zhou, Changli]'s Articles
[Wang, Tian]'s Articles
[Jiang, Wenxian]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Zhou, Changli]'s Articles
[Wang, Tian]'s Articles
[Jiang, Wenxian]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.