pith. sign in

arxiv: 1812.09962 · v3 · pith:HGMFOSUBnew · submitted 2018-12-24 · 💻 cs.IT · math.IT

GASP Codes for Secure Distributed Matrix Multiplication

Rafael G.L. D'Oliveira , Salim El Rouayheb , David Karpuk This is my paper
classification 💻 cs.IT math.IT
keywords codessecuredistributedgaspmatrixmultiplicationpolynomialproblem
0
0 comments X
read the original abstract

We consider the problem of secure distributed matrix multiplication (SDMM) in which a user wishes to compute the product of two matrices with the assistance of honest but curious servers. We construct polynomial codes for SDMM by studying a combinatorial problem on a special type of addition table, which we call the degree table. The codes are based on arithmetic progressions, and are thus named GASP (Gap Additive Secure Polynomial) Codes. GASP Codes are shown to outperform all previously known polynomial codes for secure distributed matrix multiplication in terms of download rate.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. On the Upload versus Download Cost for Secure and Private Matrix Multiplication

    cs.IT 2019-06 unverdicted novelty 7.0

    Achieves lower convex hull of (N/(K-1), (K/(K-1)) * sum_{i=0 to M-1} (K/N)^i) pairs for K=2..N in secure private matrix multiplication over N servers.