We consider constructing capacity-achieving linear codes with minimum message size for
private information retrieval (PIR) from N non-colluding databases, where each message is …

This article investigates the problem of demand privacy against colluding users for shared-
link coded caching systems, where no subset of users can learn any information about the …

In this paper, we study the problem of private and secure distributed matrix multiplication
(PSDMM), where a user having a private matrix and non-colluding servers sharing a library …

In this work, two practical concepts related to private information retrieval (PIR) are
introduced and coined full support-rank PIR and strongly linear PIR. Being of full support …

Private information retrieval (PIR) protocols ensure that a user can download a file from a
database without revealing any information on the identity of the requested file to the servers …

We consider the problems of Private and Secure Matrix Multiplication (PSMM) and Fully
Private Matrix Multiplication (FPMM), for which matrices privately selected by a master node …

We study the private information retrieval (PIR) problem under arbitrary collusion patterns for
replicated databases. We find a general characterization of the PIR capacity, which is the …

We study the symmetric private information retrieval (SPIR) problem under arbitrary
collusion and eavesdropping patterns for replicated databases. We find its capacity, which is …

The problem of-secure-colluding symmetric Private Polynomial Computation (PPC) from
coded storage system with Byzantine and unresponsive servers is studied in this paper …

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 …