Private information retrieval with side information
S Kadhe, B Garcia, A Heidarzadeh… - IEEE Transactions …, 2019 - ieeexplore.ieee.org
We study the problem of Private Information Retrieval (PIR) in the presence of prior side
information. The problem setup includes a database of K independent messages possibly …
information. The problem setup includes a database of K independent messages possibly …
The role of coded side information in single-server private information retrieval
A Heidarzadeh, F Kazemi… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
We study the role of coded side information in single-server Private Information Retrieval
(PIR). An instance of the single-server PIR problem includes a server that stores a database …
(PIR). An instance of the single-server PIR problem includes a server that stores a database …
On the capacity of single-server multi-message private information retrieval with side information
A Heidarzadeh, B Garcia, S Kadhe… - 2018 56th Annual …, 2018 - ieeexplore.ieee.org
We study Private Information Retrieval with Side Information (PIR-SI) in the single-server
multi-message setting. In this setting, a user wants to download D messages from a …
multi-message setting. In this setting, a user wants to download D messages from a …
The capacity of private information retrieval
In the private information retrieval (PIR) problem, a user wishes to retrieve, as efficiently as
possible, one out of K messages from N non-communicating databases (each holds all K …
possible, one out of K messages from N non-communicating databases (each holds all K …
Multiround private information retrieval: Capacity and storage overhead
Private information retrieval (PIR) is the problem of retrieving one message out of K
messages from N noncommunicating replicated databases, where each database stores all …
messages from N noncommunicating replicated databases, where each database stores all …
Single-server multi-message individually-private information retrieval with side information
A Heidarzadeh, S Kadhe… - 2019 IEEE …, 2019 - ieeexplore.ieee.org
We consider a multi-user variant of the private information retrieval problem described as
follows. Suppose there are D users, each of which wants to privately retrieve a distinct …
follows. Suppose there are D users, each of which wants to privately retrieve a distinct …
Multi-message private information retrieval with private side information
SP Shariatpanahi, MJ Siavoshani… - 2018 IEEE …, 2018 - ieeexplore.ieee.org
We consider the problem of private information retrieval (PIR) where a single user with
private side information aims to retrieve multiple files from a library stored (uncoded) at a …
private side information aims to retrieve multiple files from a library stored (uncoded) at a …
The capacity of robust private information retrieval with colluding databases
Private information retrieval (PIR) is the problem of retrieving as efficiently as possible, one
out of K messages from N non-communicating replicated databases (each holds all K …
out of K messages from N non-communicating replicated databases (each holds all K …
The capacity of symmetric private information retrieval
Private information retrieval (PIR) is the problem of retrieving, as efficiently as possible, one
out of K messages from N non-communicating replicated databases (each holds all K …
out of K messages from N non-communicating replicated databases (each holds all K …
The capacity of private information retrieval from uncoded storage constrained databases
Private information retrieval (PIR) allows a user to retrieve a desired message from a set of
databases without revealing the identity of the desired message. The replicated database …
databases without revealing the identity of the desired message. The replicated database …