We consider the problem of symmetric private information retrieval (SPIR) with user-side
common randomness. In SPIR, a user retrieves a message out of messages from non …

We introduce the problem of random symmetric private information retrieval (RSPIR). In
canonical PIR, a user downloads a message out of K messages from N non-colluding and …

A private information retrieval (PIR) protocol guarantees that a user can privately retrieve
files stored in a database without revealing any information about the identity of the …

The problem of weakly-private information retrieval (WPIR) is to allow the user to retrieve
one out of K messages from a set of N distributed servers while guaranteeing that the …

Double blind T-private information retrieval (DB-TPIR) enables two users, each of whom
specifies an index (θ 1, θ 2, resp.), to efficiently retrieve a message W (θ 1, θ 2) labeled by …

We study the problem of weakly private information retrieval (PIR) when there is
heterogeneity in servers' trustfulness under the maximal leakage (Max-L) metric. A user …

We study the problem of weakly private information retrieval (W-PIR), where a user wishes to
retrieve a desired message from N non-colluding servers in a way that the privacy leakage …

Private information retrieval protocols guarantee that a user can privately and losslessly
retrieve a single file from a database stored across multiple servers. In this work, we propose …

Mobile electronic health systems collect a large amount of people's trajectory data through
smart devices (eg, sensors). Generally, to provide data confidentiality, trajectories are …

In the private information retrieval (PIR) problem, a user wants to retrieve a file from a
database without revealing any information about the desired file's identity to the servers that …