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

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)109-122
Number of pages14
JournalJournal of Information Processing
Volume24
Issue number1
DOIs
Publication statusPublished - 2016 Jan 15

Fingerprint

Cryptography
Network protocols
Communication
Servers
Costs
Nearest neighbor search

Keywords

  • K-nearest neighbor query
  • Location privacy
  • Location-based service
  • Somewhat homomorphic encryption

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

LPCQP : Lightweight private circular query protocol with divided POI-table and somewhat homomorphic encryption for privacy-preserving k-NN search. / Utsunomiya, Yasuhito; Toyoda, Kentaro; Sasase, Iwao.

In: Journal of Information Processing, Vol. 24, No. 1, 15.01.2016, p. 109-122.

Research output: Contribution to journalArticle

@article{e6d80f08ad524bf9986195af673dc624,
title = "LPCQP: Lightweight private circular query protocol with divided POI-table and somewhat homomorphic encryption for privacy-preserving k-NN search",
abstract = "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.",
keywords = "K-nearest neighbor query, Location privacy, Location-based service, Somewhat homomorphic encryption",
author = "Yasuhito Utsunomiya and Kentaro Toyoda and Iwao Sasase",
year = "2016",
month = "1",
day = "15",
doi = "10.2197/ipsjjip.24.109",
language = "English",
volume = "24",
pages = "109--122",
journal = "Journal of Information Processing",
issn = "0387-5806",
publisher = "Information Processing Society of Japan",
number = "1",

}

TY - JOUR

T1 - LPCQP

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

AU - Utsunomiya, Yasuhito

AU - Toyoda, Kentaro

AU - Sasase, Iwao

PY - 2016/1/15

Y1 - 2016/1/15

N2 - 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.

AB - 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.

KW - K-nearest neighbor query

KW - Location privacy

KW - Location-based service

KW - Somewhat homomorphic encryption

UR - http://www.scopus.com/inward/record.url?scp=84954325959&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84954325959&partnerID=8YFLogxK

U2 - 10.2197/ipsjjip.24.109

DO - 10.2197/ipsjjip.24.109

M3 - Article

AN - SCOPUS:84954325959

VL - 24

SP - 109

EP - 122

JO - Journal of Information Processing

JF - Journal of Information Processing

SN - 0387-5806

IS - 1

ER -