A THRESHOLD SECRET SHARING SCHEME TO IDENTIFY CHEATERS

Blakley G R. Safeguarding cryptographic keys. Proc. AFIPS 1979, National Computer Confer-[2]ence, 1979, Vo1.48, 313-317.[3]Shamir A. How to share a secret[J].Communications of the ACM.1979, 22(11):612-613[4]Denning D. Cryptography and Data Security. Reading, MA: Addison-Wesley, 1983, 135-185.[5]Simmons G J. An introduction to shared secret and/or shared control schemes and their appli-[6]cation. in Contemporary Cryptology: The Science of Information Integrity, G. J. Simmons(Ed.), New York: IEEE Press, 1992, 441-497.[7]王育民,何大可.保密学--基础与应用.西安:西安电子科技大学出版社,1990, 246-342.[8]Carpentieri M, Santis A D, Vaccaro U. Size of shares and probability of cheating in threshold schemes. Advances in Cryptology-EUROCRYPT93 (T. Helleseth,ed.), Lecture Notes in Com-[9]puter Science vol.765, Springer-Verlag, New York: 1994, 118-125.[10]Karnin E D, Greene J W, Hellman M E. On secret sharing systems. IEEE Trans. on IT, 1983, IT-29(l): 35-41.[11]Stinson D R. Decomposition constructions for secret sharing schemes. IEEE Trans. on IT, 1994, IT-40(1): 118-125.[12]Blundo C, Gressti A, Santis A D, Vaccaro U. Fully dynamic secret sharing schemes. Proc.[J]. Crypto9.1994,LNCS vo1.773:110-[13]王新梅. 级连码(K, N)门限通信密钥分散保管系统.通信学报,1987, 8(1): 1-9.[14]郑宝东.关于(K, N)门通信密钥分散保管系统的讨论.通信学报,1994, 15(1): 23-28.[15]J McEliece R J, Sarwate D V. On sharing secrets and Reed-Solomon codes[J].Communication of the ACM.1981, 24(8):583-584