Fully Private Grouped Matrix Multiplication with Colluding Workers. (arXiv:2305.07983v1 [cs.IT])

In this paper, we present a novel variation of the coded matrix
multiplication problem which we refer to as fully private grouped matrix
multiplication (FPGMM). In FPGMM, a master wants to compute a group of matrix
products between two matrix libraries that can be accessed by all workers while
ensuring that any number of prescribed colluding workers learn nothing about
which matrix products the master desires, nor the number of matrix products. We
present an achievable scheme using a variant …

compute master matrix novel private problem products workers