On the Hardness of Information-Theoretic Multiparty Computation
On the Hardness of Information-Theoretic Multiparty Computation
复制标题
论信息论多方计算的硬度
DOI：
10.1007/978-3-540-24676-3_26
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
E. Kushilevitz
中科院分区：
文献类型：
--
作者：
Yuval Ishai;E. Kushilevitz
我们重新审视信息论密码学中的以下开放问题：无条件安全计算的通信复杂性是否取决于正在计算的函数的计算复杂性？例如，计算上无限制的玩家能否以多项式通信复杂性和无条件隐私的线性阈值计算其输入的任意函数？这可以通过使用恒定数量的通信轮数来完成吗？
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational complexity of the function being computed? For instance, can computationally unbounded players compute an arbitrary function of their inputs with polynomial communication complexity and a linear threshold of unconditional privacy? Can this be done using a constant number of communication rounds?