Privacy-preserving k-nearest neighbour query on outsourced database
DOI10.1007/978-3-319-40253-6_11zbMATH Open1476.68075OpenAlexW2483834360MaRDI QIDQ2817461FDOQ2817461
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
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 近邻分类器
oblivious RAMencrypted database\(k\)-nearest neighbour searchoutsourcing of computationprivacy-preserving computation
Cites Work
- An Algorithm for Finding Nearest Neighbors
- Foundations of Cryptography
- Software protection and simulation on oblivious RAMs
- Cryptanalysis of an algebraic privacy homomorphism
- Private information retrieval
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- Title not available (Why is that?)
- Efficient, oblivious data structures for MPC
Cited In (3)
Uses Software
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)