常数轮多项式互素多方安全判定协议

Secure Constant-Round Protocols for Determining Co-Prime of Polynomials

以生成随机共享值、安全共享乘法与加法的常数轮协议为基础 ,给出有限域K上多项式的Shamir共享 ,并构造常数轮协议 ,使得网络可以安全判定K[x]中两个多项式是否互素 .所构造协议的安全性基于已知基本协议的安全性 .

Based on some known constant-round protocols for generating random shared values,for secure multiplications and for addition of shared values,we give the Shamirs sharing for polynomials in a finite field K,and construct a protocol allowing a network to securely determine whether two polynomials in K[x] are co-prime.Security of the protocols constructed depends on security of these basic protocols above.