Secure and Efficient k-NN Queries

被引：1

作者：

Asif, Hafiz ^{[1
]}

Vaidya, Jaideep ^{[1
]}

Shafiq, Basit ^{[2
]}

Adam, Nabil ^{[1
]}

机构：

[1] Rutgers State Univ, MSIS Dept, New Brunswick, NJ 08901 USA

[2] Lahore Univ Managment Sci, CS Dept, Lahore, Pakistan

来源：

ICT SYSTEMS SECURITY AND PRIVACY PROTECTION, SEC 2017 | 2017年 / 502卷

基金：

美国国家科学基金会; 美国国家卫生研究院;

关键词：

k-NN queries; k-NN classification; Privacy; Distributed computation;

D O I：

10.1007/978-3-319-58469-0_11

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：155 / 170

页数：16

共 50 条

[1] Subspace Similarity Search: Efficient k-NN Queries in Arbitrary Subspaces
Bernecker, Thomas
Emrich, Tobias
Graf, Franz
Kriegel, Hans-Peter
Kroeger, Peer
Renz, Matthias
Schubert, Erich
Zimek, Arthur
[J]. SCIENTIFIC AND STATISTICAL DATABASE MANAGEMENT, 2010, 6187 : 555 - 564
[2] A Spatial Mashup Service for Efficient Evaluation of Concurrent k-NN Queries
Zhang, Detian
Chow, Chi-Yin
Li, Qing
Zhang, Xinming
Xu, Yinlong
[J]. IEEE TRANSACTIONS ON COMPUTERS, 2016, 65 (08) : 2428 - 2442
[3] Exact k-NN queries on clustered SVD datasets
Thomasian, A
Li, Y
Zhang, LJ
[J]. INFORMATION PROCESSING LETTERS, 2005, 94 (06) : 247 - 252
[4] Efficient K-NN for Playlist Continuation
Kelen, Domokos M.
Berecz, Daniel
Beres, Ferenc
Benczur, Andras A.
[J]. RECSYS CHALLENGE'18: PROCEEDINGS OF THE ACM RECOMMENDER SYSTEMS CHALLENGE 2018, 2018,
[5] Processing Class-Constraint K-NN Queries with MISP
Milchevski, Evica
Neffgen, Fabian
Michel, Sebastian
[J]. PROCEEDINGS OF THE 21ST WORKSHOP ON THE WEB AND DATABASES (WEBDB 2018), 2018,
[6] S-KNN: an efficient approach for processing k-NN queries over moving objects
Han, Ruizhi
Wang, Dong
Leng, Hao
Han, Shiyuan
Zhou, Jin
[J]. IEEE ICCSS 2016 - 2016 3RD INTERNATIONAL CONFERENCE ON INFORMATIVE AND CYBERNETICS FOR COMPUTATIONAL SOCIAL SYSTEMS (ICCSS), 2016, : 76 - 80
[7] Efficiently processing continuous k-NN queries on data streams
Boehm, Christian
Ooi, Beng Chin
Plant, Claudia
Yan, Ying
[J]. 2007 IEEE 23RD INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3, 2007, : 131 - +
[8] K-nn Queries in Graph Databases Using M-Trees
Serratosa, Francesc
Sole-Ribalta, Albert
Cortes, Xavier
[J]. COMPUTER ANALYSIS OF IMAGES AND PATTERNS: 14TH INTERNATIONAL CONFERENCE, CAIP 2011, PT I, 2011, 6854 : 202 - 210
[9] An Optimized Algorithm for Approximate k-NN Queries in Wireless Sensor Networks
Zhao Zhibin
Yao Lan
Dong Xiaomei
[J]. 2009 5TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-8, 2009, : 3223 - 3227
[10] Maintenance of K-nn and spatial join queries on continuously moving points
Iwerks, Glenn S.
Samet, Hanan
Smith, Kenneth P.
[J]. ACM TRANSACTIONS ON DATABASE SYSTEMS, 2006, 31 (02): : 485 - 536

← 1 2 3 4 5 →