LPCQP

Lightweight private circular query protocol for privacy-preserving k-NN search

Yasuhito Utsunomiya, Kentaro Toyoda, Iwao Sasase

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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 languageEnglish
Title of host publication2015 12th Annual IEEE Consumer Communications and Networking Conference, CCNC 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages59-64
Number of pages6
ISBN (Print)9781479963904
DOIs
Publication statusPublished - 2015 Jul 14
Event2015 12th Annual IEEE Consumer Communications and Networking Conference, CCNC 2015 - Las Vegas, United States
Duration: 2015 Jan 92015 Jan 12

Other

Other2015 12th Annual IEEE Consumer Communications and Networking Conference, CCNC 2015
CountryUnited States
CityLas Vegas
Period15/1/915/1/12

Fingerprint

Location based services
Servers
Cryptography
Network protocols
Costs
Nearest neighbor search
Communication

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Utsunomiya, Y., Toyoda, K., & Sasase, I. (2015). LPCQP: Lightweight private circular query protocol for privacy-preserving k-NN search. In 2015 12th Annual IEEE Consumer Communications and Networking Conference, CCNC 2015 (pp. 59-64). [7157947] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CCNC.2015.7157947

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 proceedingConference contribution

Utsunomiya, Y, Toyoda, K & Sasase, I 2015, LPCQP: Lightweight private circular query protocol for privacy-preserving k-NN search. in 2015 12th Annual IEEE Consumer Communications and Networking Conference, CCNC 2015., 7157947, Institute of Electrical and Electronics Engineers Inc., pp. 59-64, 2015 12th Annual IEEE Consumer Communications and Networking Conference, CCNC 2015, Las Vegas, United States, 15/1/9. https://doi.org/10.1109/CCNC.2015.7157947
Utsunomiya Y, Toyoda K, Sasase I. LPCQP: Lightweight private circular query protocol for privacy-preserving k-NN search. In 2015 12th Annual IEEE Consumer Communications and Networking Conference, CCNC 2015. Institute of Electrical and Electronics Engineers Inc. 2015. p. 59-64. 7157947 https://doi.org/10.1109/CCNC.2015.7157947
Utsunomiya, Yasuhito ; Toyoda, Kentaro ; Sasase, Iwao. / LPCQP : Lightweight private circular query protocol for privacy-preserving k-NN search. 2015 12th Annual IEEE Consumer Communications and Networking Conference, CCNC 2015. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 59-64
@inproceedings{72b031302ec940fbb3f96f7937f6baa0,
title = "LPCQP: Lightweight private circular query protocol for privacy-preserving k-NN search",
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.",
author = "Yasuhito Utsunomiya and Kentaro Toyoda and Iwao Sasase",
year = "2015",
month = "7",
day = "14",
doi = "10.1109/CCNC.2015.7157947",
language = "English",
isbn = "9781479963904",
pages = "59--64",
booktitle = "2015 12th Annual IEEE Consumer Communications and Networking Conference, CCNC 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

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

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 -