.png){kind=icon}
返回
Secure Distributed Computing With Straggling Servers Using Polynomial Codes
.png){kind=icon}
OA
AI
DOI：10.1109/TIFS.2018.2846601.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we consider a secure distributed computing scenario in which a master wants to perform matrix multiplication of confidential inputs with multiple workers in parallel. In such a setting, a master does not want to reveal information about the two input matrices to the workers in an information-theoretic sense. We propose a secure distributed computing scheme that can efficiently cope with straggling effects by applying polynomial codes on sub-tasks assigned to workers. The achievable recovery threshold, i.e., the number of workers that a master needs to wait for to get the final product, of our proposed scheme is revealed to be order-optimal to the number of workers. Moreover, we derive the achievable recovery threshold of the proposed scheme is within a constant multiplicative factor from information-theoretic lower bound. As a by product, we extend our strategy to secure distributed computing for convolution tasks on confidential data.
Keyword:
Distributed computing
data security
polynomial codes
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8
论文数:
5.3K
被引数:
2.3W
机构
引用论文
分享收藏Organic Anion Transporters (OAT) and Other SLC22 Transporters in Progression of Renal Cell Carcinoma.png)
Cancers
OAAI
CancersIF0
OAAI分享收藏Relevance of iodine intake as a reputed predisposing factor for thyroid cancer碘摄入量与甲状腺癌的易感因素的相关性OAAI
OAAI分享收藏
查看更多内容