On a private search problem

"In the Private Search problem we study, copies of a database are stored on several non-communicating servers. A user wishes to retrieve a subset of files of the database that are similar (i.e. close in Hamming Space) to a privately chosen user file, while having the servers learn as little as...