Secure and efficient k-NN queries

Hafiz Asif, Jaideep Vaidya, Basit Shafiq

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

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.

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
Pages155-170
Number of pages16
ISBN (Print)9783319584683
DOIs
StatePublished - Jan 1 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
Volume502

Other

Other32nd International Conference on ICT Systems Security and Privacy Protection, IFIP SEC 2017
CountryItaly
CityRome
Period5/29/175/31/17

Fingerprint

Query
Investment portfolio
Financial sector
Data base
Ranking

All Science Journal Classification (ASJC) codes

  • Information Systems and Management

Cite this

Asif, H., Vaidya, J., & Shafiq, B. (2017). Secure and efficient k-NN queries. In S. De Capitani di Vimercati, & F. Martinelli (Eds.), ICT Systems Security and Privacy Protection - 32nd IFIP TC 11 International Conference, SEC 2017, Proceedings (pp. 155-170). (IFIP Advances in Information and Communication Technology; Vol. 502). Springer New York LLC. https://doi.org/10.1007/978-3-319-58469-0_11
Asif, Hafiz ; Vaidya, Jaideep ; Shafiq, Basit. / Secure and efficient k-NN queries. ICT Systems Security and Privacy Protection - 32nd IFIP TC 11 International Conference, SEC 2017, Proceedings. editor / Sabrina De Capitani di Vimercati ; Fabio Martinelli. Springer New York LLC, 2017. pp. 155-170 (IFIP Advances in Information and Communication Technology).
@inproceedings{886f74fae2aa411ca16d77458ed8dbba,
title = "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.",
author = "Hafiz Asif and Jaideep Vaidya and Basit Shafiq",
year = "2017",
month = "1",
day = "1",
doi = "https://doi.org/10.1007/978-3-319-58469-0_11",
language = "English (US)",
isbn = "9783319584683",
series = "IFIP Advances in Information and Communication Technology",
publisher = "Springer New York LLC",
pages = "155--170",
editor = "{De Capitani di Vimercati}, Sabrina and Fabio Martinelli",
booktitle = "ICT Systems Security and Privacy Protection - 32nd IFIP TC 11 International Conference, SEC 2017, Proceedings",

}

Asif, H, Vaidya, J & Shafiq, B 2017, Secure and efficient k-NN queries. in S De Capitani di Vimercati & F Martinelli (eds), ICT Systems Security and Privacy Protection - 32nd IFIP TC 11 International Conference, SEC 2017, Proceedings. IFIP Advances in Information and Communication Technology, vol. 502, Springer New York LLC, pp. 155-170, 32nd International Conference on ICT Systems Security and Privacy Protection, IFIP SEC 2017, Rome, Italy, 5/29/17. https://doi.org/10.1007/978-3-319-58469-0_11

Secure and efficient k-NN queries. / Asif, Hafiz; Vaidya, Jaideep; Shafiq, Basit.

ICT Systems Security and Privacy Protection - 32nd IFIP TC 11 International Conference, SEC 2017, Proceedings. ed. / Sabrina De Capitani di Vimercati; Fabio Martinelli. Springer New York LLC, 2017. p. 155-170 (IFIP Advances in Information and Communication Technology; Vol. 502).

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

TY - GEN

T1 - Secure and efficient k-NN queries

AU - Asif, Hafiz

AU - Vaidya, Jaideep

AU - Shafiq, Basit

PY - 2017/1/1

Y1 - 2017/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85019668716&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85019668716&partnerID=8YFLogxK

U2 - https://doi.org/10.1007/978-3-319-58469-0_11

DO - https://doi.org/10.1007/978-3-319-58469-0_11

M3 - Conference contribution

SN - 9783319584683

T3 - IFIP Advances in Information and Communication Technology

SP - 155

EP - 170

BT - ICT Systems Security and Privacy Protection - 32nd IFIP TC 11 International Conference, SEC 2017, Proceedings

A2 - De Capitani di Vimercati, Sabrina

A2 - Martinelli, Fabio

PB - Springer New York LLC

ER -

Asif H, Vaidya J, Shafiq B. Secure and efficient k-NN queries. In De Capitani di Vimercati S, Martinelli F, editors, ICT Systems Security and Privacy Protection - 32nd IFIP TC 11 International Conference, SEC 2017, Proceedings. Springer New York LLC. 2017. p. 155-170. (IFIP Advances in Information and Communication Technology). https://doi.org/10.1007/978-3-319-58469-0_11