Rateless Codes for Private Distributed Matrix-Matrix Multiplication

04/27/2020
by   Rawad Bitar, et al.
0

We consider the problem of designing rateless coded private distributed matrix-matrix multiplication. A master server owns two private matrices A and B and wants to hire worker nodes to help compute the multiplication. The matrices should remain private from the workers, in an information-theoretic sense. This problem has been considered in the literature and codes with a predesigned threshold are constructed. More precisely, the master assigns tasks to the workers and waits for a predetermined number of workers to finish their assigned tasks. The size of the tasks assigned to the workers depends on the designed threshold. We are interested in settings where the size of the task must be small and independent of the designed threshold. We design a rateless private matrix-matrix multiplications scheme, called RPM3. Our scheme fixes the size of the tasks and allows the master to send multiple tasks to the workers. The master keeps receiving results until it can decode the multiplication. Two main applications require this property: i) leverage the possible heterogeneity in the system and assign more tasks to workers that are faster; and ii) assign tasks adaptively to account for a possibly time-varying system.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/14/2021

Adaptive Private Distributed Matrix Multiplication

We consider the problem of designing codes with flexible rate (referred ...
research
05/13/2023

Fully Private Grouped Matrix Multiplication with Colluding Workers

In this paper, we present a novel variation of the coded matrix multipli...
research
08/12/2021

Secure Private and Adaptive Matrix Multiplication Beyond the Singleton Bound

Consider the problem of designing secure and private codes for distribut...
research
04/10/2020

Coded Secure Multi-Party Computation for Massive Matrices with Adversarial Nodes

In this work, we consider the problem of secure multi-party computation ...
research
01/23/2019

Distributed and Private Coded Matrix Computation with Flexible Communication Load

Tensor operations, such as matrix multiplication, are central to large-s...
research
11/06/2018

Erasure coding for distributed matrix multiplication for matrices with bounded entries

Distributed matrix multiplication is widely used in several scientific d...
research
02/07/2018

Minimizing Latency for Secure Coded Computing Using Secret Sharing via Staircase Codes

We consider the setting of a Master server, M, who possesses confidentia...

Please sign up or login with your details

Forgot password? Click here to reset