论文标题
多个功能的可验证编码计算
Verifiable Coded Computation of Multiple Functions
论文作者
论文摘要
我们考虑了在具有单个主节点和多个工作人员节点的分布式计算系统中的几个大型数据集上评估不同多元多项式的问题。当每个多元多项式在其相应的数据集上评估并提出对Lagrange编码的计算框架（Yu等人，2019年）的概括，以同时执行所有计算，同时为对时间响应不反应的士兵响应错误的计算和信息锻炼的人，我们将重点关注一般情况。我们的计划引入了一个小型计算开销，这导致下载成本的降低，并且在现有解决方案上也可以对Stragglers具有可比性的阻力。最重要的是，我们还提出了两种验证方案来检测对手的存在，从而导致结果不正确，而无需涉及其他节点。
We consider the problem of evaluating distinct multivariate polynomials over several massive datasets in a distributed computing system with a single master node and multiple worker nodes. We focus on the general case when each multivariate polynomial is evaluated over its corresponding dataset and propose a generalization of the Lagrange Coded Computing framework (Yu et al. 2019) to perform all computations simultaneously while providing robustness against stragglers who do not respond in time, adversarial workers who respond with wrong computation and information-theoretic security of dataset against colluding workers. Our scheme introduces a small computation overhead which results in a reduction in download cost and also offers comparable resistance to stragglers over existing solutions. On top of it, we also propose two verification schemes to detect the presence of adversaries, which leads to incorrect results, without involving additional nodes.
