【24h】

preface

机译:前言

获取原文
获取原文并翻译 | 示例
       

摘要

More than a decade has passed since general results concerning secure two-party and multiparty computations were first announced in [15], [24], and [16] (see details in [14]). In anutshell, assuming the existence of trapdoor permutations, these results assertthat one Can construct protocols for securely computing any desirable multiparty fuunctionality. These results either require a majority of honest players or allow dishonest players to Suspend the execution (while being detected as bad). Subsequent "unconditional" results In the "private channel model" require a two-thirds majority of honest players (see [14]and [17].
机译:自[15],[24]和[16]首次宣布有关安全两方和多方计算的一般结果以来,已经过去了十多年(请参阅[14]中的详细信息)。简而言之,假设存在活板门置换,这些结果表明,一个Can可以构造协议来安全地计算任何所需的多方功能。这些结果要么需要大多数诚实的玩家,要么允许不诚实的玩家暂停执行(虽然被检测为错误)。随后的“无条件”结果在“私有渠道模型”中,需要诚实参与者的三分之二多数(参见[14]和[17])。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号