Abstract
With the recent growth of mobile communication, location-based services (LBSs) are getting much attention. While LBSs provide beneficial information about points of interest (POIs) such as restaurants or cafes near users, their current location could be revealed to the server. Lien et al. have recently proposed a privacy-preserving k-nearest neighbor (k-NN) search with additive homomorphic encryption. However, it requires heavy computation due to unnecessary multiplication in the encryption domain and this causes intolerant burden on the server. In this paper, we propose a lightweight private circular query protocol (LPCQP) for privacy-preserving k-NN search with additive and multiplicative homomorphism. Our proposed scheme divides a POI-table into some sub-tables and aggregates them with homomorphic cryptography in order to remove unnecessary POI information for the request user, and thus the computational cost required on the server is reduced. We evaluate the performance of our proposed scheme and show that our scheme reduces the computational cost on the LBS server while keeping high security and high accuracy.
| Original language | English |
|---|---|
| Title of host publication | 2015 12th Annual IEEE Consumer Communications and Networking Conference, CCNC 2015 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 59-64 |
| Number of pages | 6 |
| ISBN (Print) | 9781479963904 |
| DOIs | |
| Publication status | Published - 2015 Jul 14 |
| Event | 2015 12th Annual IEEE Consumer Communications and Networking Conference, CCNC 2015 - Las Vegas, United States Duration: 2015 Jan 9 → 2015 Jan 12 |
Other
| Other | 2015 12th Annual IEEE Consumer Communications and Networking Conference, CCNC 2015 |
|---|---|
| Country | United States |
| City | Las Vegas |
| Period | 15/1/9 → 15/1/12 |
Fingerprint
ASJC Scopus subject areas
- Computer Networks and Communications
Cite this
LPCQP : Lightweight private circular query protocol for privacy-preserving k-NN search. / Utsunomiya, Yasuhito; Toyoda, Kentaro; Sasase, Iwao.
2015 12th Annual IEEE Consumer Communications and Networking Conference, CCNC 2015. Institute of Electrical and Electronics Engineers Inc., 2015. p. 59-64 7157947.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - LPCQP
T2 - Lightweight private circular query protocol for privacy-preserving k-NN search
AU - Utsunomiya, Yasuhito
AU - Toyoda, Kentaro
AU - Sasase, Iwao
PY - 2015/7/14
Y1 - 2015/7/14
N2 - With the recent growth of mobile communication, location-based services (LBSs) are getting much attention. While LBSs provide beneficial information about points of interest (POIs) such as restaurants or cafes near users, their current location could be revealed to the server. Lien et al. have recently proposed a privacy-preserving k-nearest neighbor (k-NN) search with additive homomorphic encryption. However, it requires heavy computation due to unnecessary multiplication in the encryption domain and this causes intolerant burden on the server. In this paper, we propose a lightweight private circular query protocol (LPCQP) for privacy-preserving k-NN search with additive and multiplicative homomorphism. Our proposed scheme divides a POI-table into some sub-tables and aggregates them with homomorphic cryptography in order to remove unnecessary POI information for the request user, and thus the computational cost required on the server is reduced. We evaluate the performance of our proposed scheme and show that our scheme reduces the computational cost on the LBS server while keeping high security and high accuracy.
AB - With the recent growth of mobile communication, location-based services (LBSs) are getting much attention. While LBSs provide beneficial information about points of interest (POIs) such as restaurants or cafes near users, their current location could be revealed to the server. Lien et al. have recently proposed a privacy-preserving k-nearest neighbor (k-NN) search with additive homomorphic encryption. However, it requires heavy computation due to unnecessary multiplication in the encryption domain and this causes intolerant burden on the server. In this paper, we propose a lightweight private circular query protocol (LPCQP) for privacy-preserving k-NN search with additive and multiplicative homomorphism. Our proposed scheme divides a POI-table into some sub-tables and aggregates them with homomorphic cryptography in order to remove unnecessary POI information for the request user, and thus the computational cost required on the server is reduced. We evaluate the performance of our proposed scheme and show that our scheme reduces the computational cost on the LBS server while keeping high security and high accuracy.
UR - http://www.scopus.com/inward/record.url?scp=84943156811&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84943156811&partnerID=8YFLogxK
U2 - 10.1109/CCNC.2015.7157947
DO - 10.1109/CCNC.2015.7157947
M3 - Conference contribution
AN - SCOPUS:84943156811
SN - 9781479963904
SP - 59
EP - 64
BT - 2015 12th Annual IEEE Consumer Communications and Networking Conference, CCNC 2015
PB - Institute of Electrical and Electronics Engineers Inc.
ER -