LPCQP: Lightweight private circular query protocol with divided POI-table and somewhat homomorphic encryption for privacy-preserving k-NN search

Yasuhito Utsunomiya, Kentaro Toyoda, Iwao Sasase

研究成果: Article

5 引用 (Scopus)

抜粋

With the recent growth of mobile communication, the location-based k-nearest neighbor (k-NN) search is getting much attention. While the k-NN search provides beneficial information about points of interest (POIs) near users, users’ locations could be revealed to the server. Lien et al. have recently proposed a highly-accurate privacypreserving k-NN search protocol with the additive homomorphism. However, it requires a heavy computation load due to the unnecessary multiplication on the server in the encryption domain. In this paper, we propose a lightweight private circular query protocol (LPCQP) with divided POI-table and the somewhat homomorphic encryption for privacypreserving k-NN search. Our proposed scheme removes unnecessary POI information for the request user by dividing and aggregating a POI-table, and this reduces both the computational and the communication costs. In addition, we use both additive and multiplicative homomorphisms to perform the above process in the encryption domain. We evaluate the performance of our proposed scheme and show that our scheme reduces both the computational and the communication costs while maintaining high security and high accuracy.

元の言語English
ページ(範囲)109-122
ページ数14
ジャーナルJournal of Information Processing
24
発行部数1
DOI
出版物ステータスPublished - 2016 1 15

ASJC Scopus subject areas

  • Computer Science(all)

フィンガープリント LPCQP: Lightweight private circular query protocol with divided POI-table and somewhat homomorphic encryption for privacy-preserving k-NN search' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用