Framework and Researching Content of Distributed Cryptography

Shamir A. How to share a secret[J].Communications of the ACM.1979, 22(11):612-[2]Blakley G R. Safeguarding cryptographic keys[C][J].Proc.National Computer Conference79, AFIPS Proceedings.1979,vol.48:313-[3]Ito M, Saito A, Nishizeki T. Secret sharing scheme realizing general access structure[C]. IEEE Globcom87, Tokyo Japan,1987:99 - 102.[4]Desmedt Y. Society and group oriented cryptography: a new concept[C]. Proc. of CRYPTO87, California USA, 1988:120- 127.[5]Desmedt Y, Frankel Y. Threshold cryptosystems[C]. Proc. of CRYPTO89, California USA, 1 990:307 - 315.[6]Chor B, Goldwasser S, Micali S, Awerbuch B. Verifiable secret sharing and achieving simultaneity in the presence of faults[C].Proc. of IEEE 26-th Annual Symp. on FOCS, Portland, Oregon,1985:383 - 395.[7]Yao A C. Protocols for secure computations[C]. Proc. 23rd Ann.Symp. on Foundations of Computer Science, California USA,1982: 160- 164.[8]Goldreich O. Secure Multi-party Computation. http:∥ www.wisdom.weizmann.ac.il～oded.[9]Canetti R. Studies in secure multiparty computation and applications[D]. [Ph.D. thesis], Weizmann Institute of Science,1995.[10]Desmedt Y.[J].Wang Y. Perfectly secure message transmission revisited[C]. Proc. of EUROCRYPT02, Amsterdam, the Netherlands.2002,:-[11]Hirt M, Maurer U. Player simulation and general adversary structures in perfect multiparty computation[J].Journal of Cryptology.2000, 13(1):31-[12]Karchmer K., Wigderson A. On span programs[C]. Proc. of 8-th Annual Structure in IEEE Complexity Theory Conference, 1993:102- 111.[13]Stanislaw J. Efficient threshold cryptosystems[D]. [PH.D. thesis],MIT, 2001.[14]Catalano D.[J].Gennaro R, Halevi S. Computing inverses over a shared secret modulus[C]. Proc. of EUROCRYPT02,Amsterdam, the Netherlands.2002,:-[15]Algesheimer J, Camenisch J, Shoup V. Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. http:∥eprint. iacr. org/2002 - 029.[16]Cramer R.[J].Fehr S. Optimal black-box secret sharing over arbitrary Abelian groups[C]. Proc. of CRYPTO02, California,USA.2002,:-[17]Cramer R.[J].Fehr S, Ishai Y, Kushilevitz K. Efficient multi-party computation over rings[C]. Proc. of EUROCRYPT03, Warsaw,Poland.2003,:-