Loading…

Codes Trading Upload for Download Cost in Secure Distributed Matrix Multiplication

In secure distributed matrix multiplication (SDMM) the multiplication \boldsymbol A \boldsymbol B from two private matrices \boldsymbol A and \boldsymbol B is outsourced to N distributed servers. In \ell -SDMM, the goal is to design a joint communication-computation procedure that optimally...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2021-08, Vol.69 (8), p.5409-5424
Main Authors: Kakar, Jaber, Khristoforov, Anton, Ebadifar, Seyedhamed, Sezgin, Aydin
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In secure distributed matrix multiplication (SDMM) the multiplication \boldsymbol A \boldsymbol B from two private matrices \boldsymbol A and \boldsymbol B is outsourced to N distributed servers. In \ell -SDMM, the goal is to design a joint communication-computation procedure that optimally balances conflicting communication and computation metrics without leaking any information on both \boldsymbol A and \boldsymbol B to any set of \ell {< }N servers. To this end, the user applies coding with \tilde { \boldsymbol A}_{i} and \tilde { \boldsymbol B}_{i} representing encoded versions of \boldsymbol A and \boldsymbol B destined to the i -th server. Now, SDMM involves multiple tradeoffs. One such tradeoff is the tradeoff between upload (UL) and download (DL) costs. To find a good balance between these two metrics, we propose two schemes which we term USCSA and GSCSA that are based on secure cross subspace alignment (SCSA). We show that there are various scenarios where they outperform existing SDMM schemes from the literature with respect to UL-DL efficiency. Next, we implement schemes from the literature, including USCSA and GSCSA, and test their performance on Amazon EC2. Our numerical results show that USCSA and GSCSA establish a good balance between the time spent on the communication and computation in SDMMs. This is because they combine advantages of polynomial codes, namely low time for the upload of \tilde { \boldsymbol A}_{i} and
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2021.3083730