Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
复制标题
布尔函数安全两方计算中公平性的完整表征
DOI：
--
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
Eran Omri
中科院分区：
文献类型：
--
作者：
Gilad Asharov;A. Beimel;Nikolaos Makriyannis;Eran Omri
公平是安全计算中的一个理想属性；非正式地说，它意味着如果一方得到函数的输出，那么所有各方都得到输出。唉，Cleve的结果(STEC 86)的一个含义是，当没有诚实的多数时，特别是在两方设置的重要情况下，存在不能公平计算的布尔函数。在一个令人惊讶的结果中，戈登等人。(JACM 2011)证明了一些有趣的函数可以在两方设置下公平计算，并重新提出了理解哪些布尔函数可以公平计算，哪些不可以计算的问题。
Fairness is a desirable property in secure computation; informally it means that if one party gets the output of the function, then all parties get the output. Alas, an implication of Cleve’s result (STOC 86) is that when there is no honest majority, in particular in the important case of the two-party setting, there exist Boolean functions that cannot be computed with fairness. In a surprising result, Gordon et al. (JACM 2011) showed that some interesting functions can be computed with fairness in the two-party setting, and re-opened the question of understanding which Boolean functions can be computed with fairness, and which cannot.