Secure Coded Multi-Party Computation for Massive Matrix Operations

by   Hanzaleh Akbari Nodehi, et al.

In this paper, we consider a secure multi-party computation problem (MPC), where the goal is to offload the computation of an arbitrary polynomial function of some massive private matrices to a network of workers. The workers are not reliable, some may collude to gain information about the input data. The system is initialized by sharing a (randomized) function of each input matrix to each server. Since the input matrices are massive, the size of each share is assumed to be at most 1/k fraction of the input matrix, for some k ∈N. The objective is to minimize the number of workers needed to perform the computation task correctly, such that even if an arbitrary subset of t-1 workers, for some t∈N, collude, they cannot gain any information about the input matrices. We propose a sharing scheme, called polynomial sharing, and show that it admits basic operations such as adding and multiplication of matrices, and transposing a matrix. By concatenating the procedures for basic operations, we show that any polynomial function of the input matrices can be calculated, subject to the problem constraints. We show that the proposed scheme can offer order-wise gain, in terms of number of workers needed, compared to the approaches formed by concatenation of job splitting and conventional MPC approaches.


page 1

page 2

page 3

page 4


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

In this work, we consider the problem of secure multi-party computation ...

GCSA Codes with Noise Alignment for Secure Coded Multi-Party Batch Matrix Multiplication

A secure multi-party batch matrix multiplication problem (SMBMM) is cons...

Private Secure Coded Computation

We introduce a variation of coded computation that ensures data security...

Adaptive Gap Entangled Polynomial Coding for Multi-Party Computation at the Edge

Multi-party computation (MPC) is promising for designing privacy-preserv...

Analog Lagrange Coded Computing

A distributed computing scenario is considered, where the computational ...

Parity-Checked Strassen Algorithm

To multiply astronomic matrices using parallel workers subject to stragg...

CodedSketch: A Coding Scheme for Distributed Computation of Approximated Matrix Multiplications

In this paper, we propose CodedSketch, as a distributed straggler-resist...