Secure and Efficient k-NN Queries - ICT Systems Security and Privacy Protection (SEC 2017) Access content directly
Conference Papers Year : 2017

Secure and Efficient k-NN Queries


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.
Fichier principal
Vignette du fichier
449885_1_En_11_Chapter.pdf (489.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01649018 , version 1 (27-11-2017)





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⟩
74 View
41 Download



Gmail Facebook X LinkedIn More