Pith. sign in

REVIEW 2 cited by

GASP Codes for Secure Distributed Matrix Multiplication

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1812.09962 v3 pith:HGMFOSUB submitted 2018-12-24 cs.IT math.IT

Rafael G.L. D'Oliveira , Salim El Rouayheb , David Karpuk This is my paper · ORCID
classification cs.ITmath.IT
keywords codessecuredistributedgaspmatrixmultiplicationpolynomialproblem
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. $X$-secure $T$-private Information Retrieval from MDS Coded Storage with Byzantine and Unresponsive Servers

    cs.IT 2019-08 conditional novelty 7.0 of 10

    A cross-subspace alignment scheme with layered interference cancellation achieves rate 1-(Kc+X+T+2B-1)/(N-U) for X-secure T-private retrieval from MDS-coded storage with U unresponsive and B Byzantine servers, improvi...

  2. Private and Secure Distributed Matrix Multiplication with Flexible Communication Load

    cs.IT 2019-09 conditional novelty 6.0 of 10

    Secure generalized PolyDot codes give a flexible recovery-threshold and communication-load trade-off for private and secure distributed matrix multiplication.

Pith tools