Most of our lives are conducted in the cyberspace. The human notion of privacy translates
into a cyber notion of privacy on many functions that take place in the cyberspace. This …

We consider the problem of T-Private Information Retrieval with private side information
(TPIR-PSI). In this problem, N replicated databases store K independent messages, and a …

The goal of coded distributed computation is to efficiently distribute a computation task, such
as matrix multiplication, N-linear computation, or multivariate polynomial evaluation, across …

In the robust secure aggregation problem, a server wishes to learn and only learn the sum of
the inputs of a number of users while some users may drop out (ie, may not respond). The …

The problem of X-secure T-private information retrieval from MDS coded storage is studied
in this paper, where the user wishes to privately retrieve one out of K independent messages …

Computationally efficient matrix multiplication is a fundamental requirement in various fields,
including and particularly in data analytics. To do so, the computation task of large-scale …

A secure multi-party batch matrix multiplication problem (SMBMM) is considered, where the
goal is to allow a master to efficiently compute the pairwise products of two batches 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 …

Linear computations over quantum many-to-one communication networks offer opportunities
for communication cost improvements through schemes that exploit quantum entanglement …

We consider both the classical and quantum variations of X-secure, E-eavesdropped and T-
colluding symmetric private information retrieval (SPIR). This is the first work to study SPIR …