Privacy-Preserving k-Nearest Neighbour Query on Outsourced Database

DOI10.1007/978-3-319-40253-6_11zbMath1476.68075OpenAlexW2483834360MaRDI QIDQ2817461

Tsuyoshi Takagi, Yanjiang Yang, Kirill Morozov, Jianying Zhou, Rui Xu

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)

Uses Software

• JustGarble

Cites Work

• Unnamed Item
• Efficient, Oblivious Data Structures for MPC
• Oblivious RAM with O((logN)3) Worst-Case Cost
• Private information retrieval
• Cryptanalysis of an Algebraic Privacy Homomorphism
• Foundations of Cryptography
• An Algorithm for Finding Nearest Neighbors
• Software protection and simulation on oblivious RAMs

This page was built for publication: Privacy-Preserving k-Nearest Neighbour Query on Outsourced Database