Private retrieval, computing, and learning: Recent progress and future challenges

S Ulukus, S Avestimehr, M Gastpar… - IEEE Journal on …, 2022 - ieeexplore.ieee.org
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 …

The Capacity of T-Private Information Retrieval With Private Side Information

Z Chen, Z Wang, SA Jafar - IEEE Transactions on Information …, 2020 - ieeexplore.ieee.org
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 …

Cross subspace alignment codes for coded distributed batch computation

Z Jia, SA Jafar - IEEE Transactions on Information Theory, 2021 - ieeexplore.ieee.org
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 …

Information theoretic secure aggregation with user dropouts

Y Zhao, H Sun - IEEE Transactions on Information Theory, 2022 - ieeexplore.ieee.org
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 …

X-Secure T-Private Information Retrieval From MDS Coded Storage With Byzantine and Unresponsive Servers

Z Jia, SA Jafar - IEEE Transactions on Information Theory, 2020 - ieeexplore.ieee.org
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 …

On the capacity and straggler-robustness of distributed secure matrix multiplication

J Kakar, S Ebadifar, A Sezgin - IEEE Access, 2019 - ieeexplore.ieee.org
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 …

GCSA codes with noise alignment for secure coded multi-party batch matrix multiplication

Z Chen, Z Jia, Z Wang, SA Jafar - IEEE Journal on Selected …, 2021 - ieeexplore.ieee.org
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 …

The capacity of private information retrieval from heterogeneous uncoded caching databases

K Banawan, B Arasli, YP Wei… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
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 …

Quantum symmetric private information retrieval with secure storage and eavesdroppers

A Aytekin, M Nomeir, S Vithana… - 2023 IEEE Globecom …, 2023 - ieeexplore.ieee.org
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 …

Symmetric private information retrieval from MDS coded distributed storage with non-colluding and colluding servers

Q Wang, M Skoglund - IEEE Transactions on Information …, 2019 - ieeexplore.ieee.org
A user wants to retrieve a file from a database without revealing the identity of the file
retrieved to the operator of the database (server), which is known as the problem of private …