Concurrent general composition of secure protocols in the timing model
Concurrent general composition of secure protocols in the timing model
复制标题
时序模型中安全协议的并发通用构成
DOI：
10.1145/1060590.1060687
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
M. Prabhakaran
中科院分区：
文献类型：
--
作者：
Y. Kalai;Yehuda Lindell;M. Prabhakaran
在安全的多方计算的设置中，一组互惠不信任的各方希望共同计算其输入的某些功能（即，他们希望安全执行一些分布式任务）。 ％的联合计算应该使得即使在独立的情况下，也已经表明可以安全地计算每个有效函数。但是，在并发构图的设置中，在没有诚实多数（或值得信赖的设置）的情况下，已经证明了广泛的不可能结果。在本文中，我们调查了在某些时间范围的网络中获得安全的多方协议的可行性假设。具体而言，我们的协议的安全性依赖于非常合理的假设，即本地时钟不会“漂移”过多（即，假定它们以大致相同的速率进行）。我们表明，在此温和的时序假设下，可以在并发一般组成下安全地计算任何功能（只要从任意其他协议中延迟了指定的时间量的消息）。
In the setting of secure multiparty computation, a set of mutually distrustful parties wish to jointly compute some function of their input (i.e., they wish to securely carry out some distributed task). %The joint computation should be such that even In the stand-alone case, it has been shown that every efficient function can be securely computed. However, in the setting of concurrent composition, broad impossibility results have been proven for the case where there is no honest majority (or trusted setup).In this paper, we investigate the feasibility of obtaining secure multiparty protocols in a network where certain time bounds are assumed. Specifically, the security of our protocols rely on the very reasonable assumption that local clocks do not "drift" too much (i.e., it is assumed that they proceed at approximately the same rate). We show that under this mild timing assumption, it is possible to securely compute any functionality under concurrent general composition (as long as messages from the arbitrary other protocols are delayed for a specified amount of time).