Privacy-preserving k-nearest neighbour query on outsourced database

DOI10.1007/978-3-319-40253-6_11MaRDI QIDQ2817461zbMATH OpenOpenAlexFDO

Authors Rui Xu, Kirill E. Morozov, Yanjiang Yang, Jianying Zhou, Tsuyoshi Takagi

Publication date 31 August 2016

Published in Information Security and Privacy (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-40253-6_11

zbMATH Keywords

oblivious RAMencrypted database\(k\)-nearest neighbour searchoutsourcing of computationprivacy-preserving computation

Mathematics Subject Classification ID

Database theory (68P15) Privacy of data (68P27)

Recommendations

• Secure collaborative outsourced \(k\)-nearest neighbor classification with multiple owners in cloud environment
• A reusable and single-interactive model for secure approximate k-nearest neighbor query in cloud
• Efficient privacy-preserving protocol for \(k\)-NN search over encrypted data in location-based service
• Processing secure, verifiable and efficient SQL over outsourced database
• 支持隐私保护的 k 近邻分类器

Cites work

• scientific article; zbMATH DE number 1941261 (Why is no real title available?)
• An Algorithm for Finding Nearest Neighbors
• Cryptanalysis of an algebraic privacy homomorphism
• Efficient, oblivious data structures for MPC
• Foundations of Cryptography
• Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
• Private information retrieval
• Software protection and simulation on oblivious RAMs

Cited in

(3)

• Secure collaborative outsourced \(k\)-nearest neighbor classification with multiple owners in cloud environment
• Privacy-Preserving Ad-Hoc Equi-Join on Outsourced Data
• A reusable and single-interactive model for secure approximate k-nearest neighbor query in cloud

Describes a project that uses

Uses Software

• JustGarble

This page was built for publication: Privacy-preserving \(k\)-nearest neighbour query on outsourced database

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817461)