关键词: 多方安全计算, 共享, 常数轮

Abstract:

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

Key words: multi-party secure computation, sharing, constant-round