Efficient Polynomial Operations in the Shared-Coefficients Setting
Efficient Polynomial Operations in the Shared-Coefficients Setting
复制标题
共享系数设置中的高效多项式运算
DOI：
--
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
M. Franklin
中科院分区：
文献类型：
--
作者：
Payman Mohassel;M. Franklin
我们研究了多项式操作的共享系数设置的高效和私有协议的设计。我们提出了有效的协议多项式乘法，除法与余数，多项式插值，多项式gcd，和其他一些操作。本文介绍的所有协议都是恒轮的，并且比一般的MPC更有效。这些协议都是可组合的，并且可以组合以执行更复杂的功能。由于我们的协议的应用，我们着重于使用一个门限加法同态公钥方案。但是，我们的协议也可以安全地计算在信息理论的设置。最后，我们提到我们的协议的隐私保护集操作的一些应用。
We study the design of efficient and private protocols for polynomial operations in the shared-coefficients setting. We propose efficient protocols for polynomial multiplication, division with remainder, polynomial interpolation, polynomial gcd, and a few other operations. All the protocols introduced in this paper are constant-round, and more efficient than the general MPC. The protocols are all composable, and can be combined to perform more complicated functionalities. We focus on using a threshold additively homomorphic public key scheme due to the applications of our protocols. But, our protocols can also be securely computed in the information-theoretic setting. Finally, we mention some applications of our protocols to privacy-preserving set-operations.