.png){kind=icon}
返回
Minimizing Latency for Secure Coded Computing Using Secret Sharing via Staircase Codes
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2020.2988506.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the setting of a Master server, M, who possesses confidential data and wants to run intensive computations on it, as part of a machine learning algorithm for example. The Master wants to distribute these computations to untrusted workers who volunteered to help with this task. However, the data must be kept private in an information theoretic sense. Some of the workers may be stragglers, e.g., slow or busy. We are interested in reducing the delays experienced by the Master. We focus on linear computations as an essential operation in many iterative algorithms. We propose a solution based on new codes, called Staircase codes, introduced previously by two of the authors. Staircase codes allow flexibility in the number of stragglers up to a given maximum, and universally achieve the information theoretic limit on the download cost by the Master, leading to latency reduction. We find upper and lower bounds on the Master's mean waiting time. We derive the distribution of the Master's waiting time, and its mean, for systems with up to two stragglers. We show that Staircase codes always outperform existing solutions based on classical secret sharing codes. We validate our results with extensive implementation on Amazon EC2.
Keyword:
Cryptography
Delays
Decoding
Distributed computing
Privacy
Encoding
Task analysis
Distributed computing
data privacy
secret sharing
secure coded computing
machine learning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
分享收藏Interaction of .theta.-Toxin (Perfringolysin O), a Cholesterol-Binding Cytolysin, with Liposomal Membranes: Change in the Aromatic Side Chains upon Binding and Insertion.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏
查看更多内容