Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation

Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
复制标题

门评估秘密共享和安全一轮两方计算

DOI：
--
复制
发表时间：
2005
期刊：
International Conference on the Theory and Application of Cryptology and Information Security
影响因子：
--
通讯作者：
V. Kolesnikov
V. Kolesnikov
中科院分区：
--
文献类型：
--
作者：
V. Kolesnikov

文献摘要

被引文献

相似文献

我们提出了一种新的秘密共享方法——门评估秘密共享（GESS），它被设计用于最小交互的安全功能评估（SFE）。由此产生的简单而强大的GESS SFE方法是姚的乱码电路技术的推广。
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simple and powerful GESS approach to SFE is a generalization of Yao’s garbled circuit technique. We give efficient GESS schemes for evaluating binary gates and prove (almost) matching lower bounds. We give a more efficient information-theoretic reduction of SFE of a boolean formula F to oblivious transfer. Its complexity is ≈ ∑ di2, where di is the depth of the i-th leaf of F.