首页> 外文会议>Theory of Cryptography Conference >Designing Fully Secure Protocols for Secure Two-Party Computation of Constant-Domain Functions
【24h】

Designing Fully Secure Protocols for Secure Two-Party Computation of Constant-Domain Functions

机译:为恒定域功能的安全两方计算设计完全安全的协议

获取原文

摘要

In a sense, a two-party protocol achieves fairness if the output from the computation is obtained simultaneously by both parties. A seminal result by Cleve (STOC 1986) states that fairness is impossible, in general. Surprisingly, Gordon et al. (JACM 2011) showed that there exist interesting functions that are computable with fairness. The two results give rise to a distinction between fair functions and unfair ones. The question of characterizing these functions has been studied in a sequence of works leading to the complete characterization of (symmetric) Boolean functions by Asharov et al. (TCC 2015). In this paper, we design new fully secure protocols for functions that were previously unknown to be fair. To this end, our main technical contribution is a generic construction of a fully secure (fair) protocol, starting with a constant-round protocol satisfying limited security requirements. Our construction introduces new conceptual tools for the analysis of fairness that apply to arbitrary (constant-domain) functions. While the characterization remains open, we believe that our results lay the foundation for a deeper understanding of fairness.
机译:从某种意义上说,如果双方都同时获得计算的输出,那么两方协议就可以达到公平。 Cleve(STOC 1986)的开创性结果指出,一般而言,公平是不可能的。出人意料的是,戈登等人。 (JACM 2011)表明存在一些有趣的函数,这些函数可以公平地计算。这两个结果导致公平职能与不公平职能之间的区别。通过一系列工作研究了表征这些函数的问题,从而使Asharov等人完整地表征了(对称)布尔函数。 (TCC 2015)。在本文中,我们为以前未知的功能设计了新的完全安全的协议。为此,我们的主要技术贡献是从满足有限安全性要求的恒定回合协议开始,全面构建完全安全(公平)的协议。我们的构造引入了用于公平性分析的新概念工具,这些工具适用于任意(恒定域)函数。在表征保持开放的同时,我们相信我们的结果为更深入地了解公平奠定了基础。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号