降低安全分布式计算中的延迟
Minimizing Latency for Secure Distributed Computing
AI总结:
本文提出使用阶梯码替代传统秘密分享方案,以降低安全分布式计算中的延迟,实验表明阶梯码在特定条件下可减少高达40%的延迟。
摘要:
我们考虑一个主服务器拥有保密数据(如基因组、医疗数据等)并希望在机器学习算法中运行高强度计算的场景。主服务器希望将这些计算任务分配给不信任的工人,这些工人可能已经自愿或被激励来帮助完成任务。然而,数据必须保持隐私(从信息论意义上讲),不能泄露给个别工人。工人可能很忙,甚至无响应,并且完成分配的任务需要随机时间。我们关注的是减少主服务器经历的总延迟。我们专注于线性计算,这是许多迭代算法中的基本操作。已知的解决方案是使用线性秘密分享方案将数据分成秘密份额,让工人计算。我们提出改用新的安全代码,称为阶梯码,由两位作者之前引入。我们研究了阶梯码引起的延迟,其始终低于秘密分享。原因在于秘密分享方案需要等待固定比例的工人响应,而阶梯码在这方面提供了更大的灵活性。例如,对于速率R=1/2的代码,阶梯码相比秘密分享可减少高达40%的延迟。
英文摘要:
We consider the setting of a master server who possesses confidential data (genomic, medical data, etc.) 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 have volunteered or are incentivized to help with this task. However, the data must be kept private (in an information theoretic sense) and not revealed to the individual workers. The workers may be busy, or even unresponsive, and will take a random time to finish the task assigned to them. We are interested in reducing the aggregate delay experienced by the master. We focus on linear computations as an essential operation in many iterative algorithms. A known solution is to use a linear secret sharing scheme to divide the data into secret shares on which the workers can compute. We propose to use instead new secure codes, called Staircase codes, introduced previously by two of the authors. We study the delay induced by Staircase codes which is always less than that of secret sharing. The reason is that secret sharing schemes need to wait for the responses of a fixed fraction of the workers, whereas Staircase codes offer more flexibility in this respect. For instance, for codes with rate $R=1/2$ Staircase codes can lead to up to $40\%$ reduction in delay compared to secret sharing.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。