Journal of University of Chinese Academy of Sciences >
Secure Constant-Round Protocols for DeterminingCo-Prime of Polynomials
Received date: 2003-03-11
Revised date: 2003-05-12
Online published: 2004-03-19
Based on some known constant-round protocols for generating random shared values,for secure multiplicationsand for addition of shared values,we give the Shamirs 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
HE Yun-Xiao , XU Hai-Xia , LV Ke-Wei , LI Bao . Secure Constant-Round Protocols for DeterminingCo-Prime of Polynomials[J]. Journal of University of Chinese Academy of Sciences, 2004 , 21(2) : 179 -184 . DOI: 10.7523/j.issn.2095-6134.2004.2.006
[1] J Bar-Ilan, D Beaver.Non-cryptographic fault-tolerant computing in constant number of rounds of interaction.Proc ACM PODC89.1989.201-209
[2] R Cramer, I Damgand.Secure dist ributed linear algebra in a constant number of rounds.Proceedings of CRYPTO ' 01, Santa Barbara, Ca.SpringerVerlag LNCS, 2001
[3] R Cramer, I Damgand, UMaucer.General secure mult i-party computation f rom any linear secret-sharing scheme.Proc EUROCRYPT00,Vol.1807.SpringerVerlag LNCS, 2000.316-334
[4] D Ben-Or, S Goldwarser, A wigderson.Completeness theory for noncryptographic fault-tolerant distributed computation.Proc ACM STOC98.1988.1-10
[5] D Chaum, C Crepean, I Damgand.Multi-party unconditionally secure protocols.Proc ACM STOC98.1988.11-19
[6] 范-瓦尔登.代数学(Ⅰ)(中译本).北京:科学出版社, 1963
/
| 〈 |
|
〉 |