Private Similarity Search with Sublinear Communication
Nearest neighbor search is a fundamental building-block for a wide range of applications. A privacy-preserving protocol for nearest neighbor search involves a set of clients who send queries to a remote database. Each client retrieves the nearest neighbor(s) to its query in the database without reve...
Main Author: | Servan-Schreiber, Sacha |
---|---|
Other Authors: | Devadas, Srinivas |
Format: | Thesis |
Published: |
Massachusetts Institute of Technology
2022
|
Online Access: | https://hdl.handle.net/1721.1/140146 |
Similar Items
-
Single-Server Private Information Retrieval with Sublinear Amortized Time
by: Henzinger, Alexandra
Published: (2022) -
Sublinear Time Algorithms
by: Rubinfeld, Ronitt, et al.
Published: (2012) -
Which distribution distances are sublinearly testable?
by: Daskalakis, C, et al.
Published: (2022) -
Sublinear Randomized Algorithms for Skeleton Decompositions
by: Chiu, Jiawei, et al.
Published: (2014) -
Sublinear algorithms for massive data problems
by: Mahabadi, Sepideh
Published: (2018)