Chapter title |
Secure and Efficient k-NN Queries
|
---|---|
Chapter number | 11 |
Book title |
ICT Systems Security and Privacy Protection
|
Published in |
ICT systems security and privacy protection : 32nd IFIP TC 11 International Conference, SEC 2017, Rome, Italy, May 29-31, 2017, Proceedings. IFIP TC11 International Information Security Conference (32nd : 2017 : Rome, Italy), May 2017
|
DOI | 10.1007/978-3-319-58469-0_11 |
Pubmed ID | |
Book ISBNs |
978-3-31-958468-3, 978-3-31-958469-0
|
Authors |
Hafiz Asif, Jaideep Vaidya, Basit Shafiq, Nabil Adam, Asif, Hafiz, Vaidya, Jaideep, Shafiq, Basit, Adam, Nabil |
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. |
Mendeley readers
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 4 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Master | 1 | 25% |
Professor | 1 | 25% |
Unknown | 2 | 50% |
Readers by discipline | Count | As % |
---|---|---|
Business, Management and Accounting | 1 | 25% |
Engineering | 1 | 25% |
Unknown | 2 | 50% |