1[1]Wu T, Malkin M, Boneh D. Building intrusion tolerant applications.Proceedings of the USENIX Security Symposium, 1999:79-91
2[2]Rivest R, Shamir A, Adleman L. A method for obtaining digital signatures and public-key cryptosystem. Communications of the ACM,1978;21(2):120-126
3[5]Shamir A. How to share a secret. Communications of the ACM,1979; 22(11):612-613
4[6]Chor B, GoldWasser S, Micali S, Awerbuch B. Verifiable secret sharing and achieving simultaneity in the presence of faults.Proceedings of 26th IEEE Symposium on Foundations of Computer Science. 1985:251-260
5[7]Pedersen T. Non-interactive and information-theoretic secure verifiable secret sharing. Advances in Cryptology-Crypto' 91. 1991:129-140
6[8]Gennaro R. Theory and practice of verifiable secret sharing. USA:Massachusetts Institute of Technology(MIT), 1996
7[9]Feldman P. A practical scheme for non-interactive verifiable secret sharing. Proceedings of 28th IEEE Symposium on Foundations of Computer Science. 1987:427-437
8[10]Gennaro R, Rabin M, Babin T. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. Proceedings of 1998 ACM Symposium on Principles of Distributed Computing. Mexico: Puerto Vallarta, 1998:101-111
9[11]Frankel. Y, Gemmell P, MacKenzie. P D, et al. Optimal-resilience proactive public-key cryptosystems. IEEE Symposium on Foundations of Computer Science, 1997: 384-393
