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

无硬度假设的安全分布式算法

Secured Distributed Algorithms Without Hardness Assumptions

Leonid Barenboim, Harel Levin

摘要:

我们研究算法的分布式消息传递模型,产生安全的输出,输入图$G$。具体来说,每个顶点计算其在输出中的部分,整个输出是正确的,但每个顶点不能发现其他顶点的输出,具有一定的概率。这是由高性能处理器驱动的,这些处理器现在嵌入在各种各样的设备中。在这种情况下,将整个处理任务留给一台计算机甚至一组中央计算机不再有意义,在许多情况下也是不可行的。随着分布式算法领域的广泛研究,许多经典问题都得到了有效的分布式算法,分布式算法的安全性问题的讨论却被忽略了。尽管如此,在安全多方计算问题(MPC或SMC)的研究领域中,已经设计出了许多协议和算法。然而,这些协议的概念和术语与经典的分布式算法有很大的不同。因此,这些协议的重点是为每个函数$f$工作,代价是增加轮的复杂性,或者需要几个计算假设。在这项工作中,我们提出了一种新的方法,而不是把现有的算法变成安全的,识别和开发这些算法,本质上是安全的(这意味着他们不需要任何进一步的建设)。这种方法产生了有效的安全算法的各种局部性问题,如着色,网络分解,森林分解,以及各种额外的标签问题。值得注意的是,我们的方法不需要任何硬度假设,而只是在每个顶点一个私人的随机发生器。这与基于公钥加密方案的该设置中的先前已知技术形成对比。

英文摘要:

We study algorithms in the distributed message-passing model that produce secured output, for an input graph $G$. Specifically, each vertex computes its part in the output, the entire output is correct, but each vertex cannot discover the output of other vertices, with a certain probability. This is motivated by high-performance processors that are embedded nowadays in a large variety of devices. In such situations, it no longer makes sense, and in many cases it is not feasible, to leave the whole processing task to a single computer or even a group of central computers. As the extensive research in the distributed algorithms field yielded efficient decentralized algorithms for many classic problems, the discussion about the security of distributed algorithms was somewhat neglected. Nevertheless, many protocols and algorithms were devised in the research area of secure multi-party computation problem (MPC or SMC). However, the notions and terminology of these protocols are quite different than in classic distributed algorithms. As a consequence, the focus in those protocols was to work for every function $f$ at the expense of increasing the round complexity, or the necessity of several computational assumptions. In this work, we present a novel approach, which rather than turning existing algorithms into secure ones, identifies and develops those algorithms that are inherently secure (which means they do not require any further constructions). This approach yields efficient secure algorithms for various locality problems, such as coloring, network decomposition, forest decomposition, and a variety of additional labeling problems. Remarkably, our approach does not require any hardness assumption, but only a private randomness generator in each vertex. This is in contrast to previously known techniques in this setting that are based on public-key encryption schemes.

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

↑