arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1405.1167cs.DCcs.CR
收藏

自愈计算

Self-Healing Computation

George Saad, Jared Saia

摘要:

在可靠多方计算(RC)问题中,存在$n$方,每一方具有单独的输入,并且各方希望联合计算$n$输入上的函数$f$。由于一个无所不知的对手控制着一小部分隐藏的当事人,这个问题变得更加复杂。我们描述了一个自我修复算法这个问题。特别地,对于固定功能$f$,具有$n$方和$m$门,我们描述了如何在$f$的输入改变时重复地执行RC。我们的算法保持以下属性,即使当对手控制多达$t \leq (\frac{1}{4} - ε) n$方,任何常数$ε>0$。首先,我们的算法使用以下分摊资源成本执行每个可靠计算:$O(m + n \log n)$消息、$O(m + n \log n)$计算操作和$O(\ell)$延迟,其中$\ell$是计算$f$的电路的深度。第二,预期的腐败总数是$O(t (\log^{*} m)^2)$,在此之后,敌对控制方被有效隔离,使他们不再造成腐败。

英文摘要:

In the problem of reliable multiparty computation (RC), there are $n$ parties, each with an individual input, and the parties want to jointly compute a function $f$ over $n$ inputs. The problem is complicated by the fact that an omniscient adversary controls a hidden fraction of the parties. We describe a self-healing algorithm for this problem. In particular, for a fixed function $f$, with $n$ parties and $m$ gates, we describe how to perform RC repeatedly as the inputs to $f$ change. Our algorithm maintains the following properties, even when an adversary controls up to $t \leq (\frac{1}{4} - ε) n$ parties, for any constant $ε>0$. First, our algorithm performs each reliable computation with the following amortized resource costs: $O(m + n \log n)$ messages, $O(m + n \log n)$ computational operations, and $O(\ell)$ latency, where $\ell$ is the depth of the circuit that computes $f$. Second, the expected total number of corruptions is $O(t (\log^{*} m)^2)$, after which the adversarially controlled parties are effectively quarantined so that they cause no more corruptions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑