Secure and Efficient k-NN Queries

Abstract : Given the morass of available data, ranking and best match queries are often used to find records of interest. As such, k-NN queries, which give the k closest matches to a query point, are of particular interest, and have many applications. We study this problem in the context of the financial sector, wherein an investment portfolio database is queried for matching portfolios. Given the sensitivity of the information involved, our key contribution is to develop a secure k-NN computation protocol that can enable the computation k-NN queries in a distributed multi-party environment while taking domain semantics into account. The experimental results show that the proposed protocols are extremely efficient.
Document type :
Conference papers
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download
Contributor : Hal Ifip <>
Submitted on : Monday, November 27, 2017 - 10:32:21 AM
Last modification on : Friday, August 9, 2019 - 3:24:28 PM


 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2020-01-01

Please log in to resquest access to the document


Distributed under a Creative Commons Attribution 4.0 International License



Hafiz Asif, Jaideep Vaidya, Basit Shafiq, Nabil Adam. Secure and Efficient k-NN Queries. 32th IFIP International Conference on ICT Systems Security and Privacy Protection (SEC), May 2017, Rome, Italy. pp.155-170, ⟨10.1007/978-3-319-58469-0_11⟩. ⟨hal-01649018⟩



Record views