[1] J Bar-Ilan, D Beaver.Non-cryptographic fault-tolerant computing in constant number of rounds of interaction.Proc ACM PODC89.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 EUROCRYPT00,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 STOC98.1988.1-10

[5] D Chaum, C Crepean, I Damgand.Multi-party unconditionally secure protocols.Proc ACM STOC98.1988.11-19

[6] 范-瓦尔登.代数学(Ⅰ)(中译本).北京:科学出版社, 1963