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 …

We introduce the problem of private computation, comprised of N distributed and non-
colluding servers, K independent datasets, and a user who wants to compute a function of …

We consider private information retrieval (PIR) of a single file out of K files from N non-
colluding databases with heterogeneous storage constraints m=(m 1,⋯, m N). The aim of this …

We study the problem of private set intersection (PSI). In this problem, there are two entities,
for, each storing a set, whose elements are picked from a finite set, on replicated and non …

We investigate the problem of multi-party private set intersection (MP-PSI). In MP-PSI, there
are M parties, each storing a data set P i over N i replicated and non-colluding databases …

Motivated by recent interest in federated submodel learning, this work explores the
fundamental problem of privately reading from and writing to a database comprised of files …

We investigate the problem of semantic private information retrieval (semantic PIR). In
semantic PIR, a user retrieves a message out of independent messages stored in replicated …

We consider the private information retrieval (PIR) problem from decentralized uncoded
caching databases. There are two phases in our problem setting, a caching phase, and a …

We consider the problem of private information retrieval (PIR) of a single message out of K
messages from N replicated and non-colluding databases where a cache-enabled user …

We consider the problem of private information retrieval (PIR) of a single message out of K
messages from N non-colluding and non-replicated databases. Different from the majority of …