Algebraic Geometry Codes for Secure Distributed Matrix Multiplication

03/27/2023
by   Camilla Hollanti, et al.
0

In this paper, we propose a novel construction for secure distributed matrix multiplication (SDMM) based on algebraic geometry (AG) codes. The proposed construction is inspired by the GASP code, where so-called gaps in a certain polynomial are utilized to achieve higher communication rates. Our construction considers the gaps in a Weierstrass semigroup of a rational place in an algebraic function field to achieve a similar increase in the rate. This construction shows that there is potential in utilizing AG codes and their subcodes in SDMM since we demonstrate a better performance compared to state-of-the-art schemes in some parameter regimes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/24/2018

GASP Codes for Secure Distributed Matrix Multiplication

We consider the problem of secure distributed matrix multiplication (SDM...
research
06/14/2021

Bivariate Polynomial Codes for Secure Distributed Matrix Multiplication

We consider the problem of secure distributed matrix multiplication. Cod...
research
03/29/2023

HerA Scheme: Secure Distributed Matrix Multiplication via Hermitian Codes

We consider the problem of secure distributed matrix multiplication (SDM...
research
05/05/2023

Modular Polynomial Codes for Secure and Robust Distributed Matrix Multiplication

We present Modular Polynomial (MP) Codes for Secure Distributed Matrix M...
research
01/02/2020

Expand-and-Randomize: An Algebraic Approach to Secure Computation

We consider the secure computation problem in a minimal model, where Ali...
research
05/31/2019

A Dynamical System-based Key Equation for Decoding One-Point Algebraic-Geometry Codes

A closer look at linear recurring sequences allowed us to define the mul...

Please sign up or login with your details

Forgot password? Click here to reset