Computationally private information retrieval (extended abstract)

Abstract

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Optimally Robust Private Information Retrieval (2012, background): “One class is computational PIR [8], in which the database servers can learn the client's query if they can apply sufficient computational power to break a particular cryptographic system.”
Path ORAM: an extremely simple oblivious RAM protocol (2012, unknown): “We ﬁrst describe the Path ORAM protocol with N/χ + O (log N ) · ω (1) blocks of client storage, and then later in Section 3.7 we explain how the client storage can be reduced to O (log 2 N/ log χ ) · ω (1) blocks via recursion.”
Function Secret Sharing: Improvements and Extensions (2016, background): “For a typical “reading” application, consider the problem of 2-server Private Information Retrieval (PIR) [10, 8].”
Can We Access a Database Both Locally and Privately? (2017, background): “PIR has been studied both in a multi-server setting, where security should only hold against non-colluding servers [CKGS98, CG97], and in a single-server setting [KO97].”
Privacy-Preserving Queries over Relational Databases (2010, background): “For example, the shape of the dynamic query in Listing 1 is not private; the question mark ? is used as a placeholder for a private value to be provided before the query is executed at runtime.”