.png){kind=icon}
Return
Fully Private Coded Matrix Multiplication From Colluding Workers
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2020.3037744.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Recently, coded computation has been used to reduce the completion time in distributed computing by mitigating straggler effects with erasure codes. As a variation of coded computation, fully private coded matrix multiplication (FPCMM) has been proposed to preserve a master's privacy in a scenario where the master wants to obtain a matrix multiplication result from the libraries which are shared at the workers, while concealing both of the two indices of the desired matrices from each worker. In this letter, we propose a new FPCMM scheme to keep a master's privacy from up to T colluding workers. Furthermore, we compare the performance of our scheme with those of the existing private coded matrix multiplication schemes for non-colluding workers and for concealing the index of a single desired matrix.
Keywords:
Coded computation
cross subspace alignment
private information retrieval
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
Cited Papers
ShareSaveShareSaveShareSaveHigh-Throughput Sequencing and Copy Number Variation Detection Using Formalin Fixed Embedded Tissue in Metastatic Gastric Cancer.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAIShareSaveShareSave no more
no more