LPCQP: Lightweight Private Circular Query Protocol with Divided POI-table and Somewhat Homomorphic Encryption for Privacy-Preserving k-NN Search

• Item type: Journal(1)
• 公開日: 2016-01-15
• タイトル: LPCQP: Lightweight Private Circular Query Protocol with Divided POI-table and Somewhat Homomorphic Encryption for Privacy-Preserving k-NN Search
• タイトル / 言語: en
• タイトル: LPCQP: Lightweight Private Circular Query Protocol with Divided POI-table and Somewhat Homomorphic Encryption for Privacy-Preserving k-NN Search
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: [一般論文] location privacy, k-nearest neighbor query, location-based service, somewhat homomorphic encryption
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: Keio University
• 著者所属: Keio University
• 著者所属: Keio University
• 著者所属(英): en
• 著者所属(英): Keio University
• 著者所属(英): en
• 著者所属(英): Keio University
• 著者所属(英): en
• 著者所属(英): Keio University
• 著者名: Yasuhito, Utsunomiya; Kentaroh, Toyoda; Iwao, Sasase
• 著者名(英): Yasuhito, Utsunomiya; Kentaroh, Toyoda; Iwao, Sasase
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: 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 privacy-preserving 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 privacy-preserving 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.; \n------------------------------; This is a preprint of an article intended for publication Journal of; Information Processing(JIP). This preprint should not be cited. This; article should be cited as: Journal of Information Processing Vol.24(2016) No.1 (online); DOI http://dx.doi.org/10.2197/ipsjjip.24.109; ------------------------------
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: 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 privacy-preserving 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 privacy-preserving 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.; \n------------------------------; This is a preprint of an article intended for publication Journal of; Information Processing(JIP). This preprint should not be cited. This; article should be cited as: Journal of Information Processing Vol.24(2016) No.1 (online); DOI http://dx.doi.org/10.2197/ipsjjip.24.109; ------------------------------
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN00116647
• 書誌情報: 情報処理学会論文誌; 巻 57, 号 1, 発行日 2016-01-15
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7764