… commitment (LMC) and an arbitrary linear PIR scheme to produce a k-verifiable PIR scheme,
termed a committed … of our proposal by implementing the committed PIR schemes based on …

… problem of private information retrieval (PIR). In the classical PIR setting, a user wishes to
retrieve a … For instance, assume that B ≤ B databases commit errors and are identified to be …

… Our definition generalizes private information retrieval to weighted functions of the database
rows: the client has a secret function f in mind, which must come from a particular class of …

… Private information retrieval (PIR) is normally modeled as a game between two players: a
user and a database. The user wants to retrieve … of PIR user-private information retrieval (UPIR)…

… to the PIR subprotocol, using the string R committed in step 1 above as random tape, and
using as a tuple of indices one of the two m-tuples committed in step 1 above. This can be …

… the computational Private Information Retrieval problem is not … , computationally-private
information-retrieval scheme with O(… committed value, or a certificate that the database has either …

This book deals with Private Information Retrieval (PIR), a technique allowing a user to
retrieve an element from a server in possession of a database without revealing to the server …

With the digitization of society and the continuous migration of services to the electronic
world, individuals have lost significant control over their data. In this paper, we consider the …

A computational PIR scheme allows a client to privately query a database hosted on a single
server without downloading the entire database. We introduce the notion of verifiable PIR (…

… Suppose that a client wants to retrieve a file xi with i ∈ [n]. A private information retrieval (PIR)
protocol allows him/her … For our purposes we require that vector commitment scheme are: …