Secure and efficient k-NN queries

Hafiz Asif, Jaideep Vaidya, Basit Shafiq, Nabil Adam

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

1 Scopus citations


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.

Original languageEnglish (US)
Title of host publicationICT Systems Security and Privacy Protection - 32nd IFIP TC 11 International Conference, SEC 2017, Proceedings
EditorsSabrina De Capitani di Vimercati, Fabio Martinelli
PublisherSpringer New York LLC
Number of pages16
ISBN (Print)9783319584683
StatePublished - 2017
Event32nd International Conference on ICT Systems Security and Privacy Protection, IFIP SEC 2017 - Rome, Italy
Duration: May 29 2017May 31 2017

Publication series

NameIFIP Advances in Information and Communication Technology
ISSN (Print)1868-4238


Other32nd International Conference on ICT Systems Security and Privacy Protection, IFIP SEC 2017

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Networks and Communications
  • Information Systems and Management


  • Distributed computation
  • K-NN classification
  • K-NN queries
  • Privacy


Dive into the research topics of 'Secure and efficient k-NN queries'. Together they form a unique fingerprint.

Cite this