| [1] Shamir A. How to share a secret[C]//Communications of the ACM, 1979, 22(11): 612-613.[2] Blakley G R. Safeguarding cryptographic keys[J]. In Proc NCC, AFIPS Press, 1979, 48: 313-317.[3] He J, Dawson E. Multistage secret sharing based on one-way function[J]. Electronics Letters, 1994, 30(19): 1591-1592.[4] Lin H Y, Yeh Y S. Dynamic multi-secret sharing scheme[J]. Int J Contemp Math Sciences, 2008(3): 37-42.[5] Chor B, Goldwasser S, Micali S, et al. Verifiable secret sharing and achieving simultaneity in the presence of faults[C]//In 26th Annual Symposium on Foundations of Computer Science, IEEE, 1985: 383-395.[6] Eslami Z, Zarepour A J. A verifiable multi-secret sharing scheme based on cellular automata[J]. Information Sciences, 2010, 180: 2889-2894.[7] Hu C Q, Liao X F, Cheng X Z. Verifiable multi-secret sharing based on LESR sequences[J]. Theoretical Computer Science, 2012, 445: 52-62.[8] Shao J. Efficient verifiable multi-secret sharing scheme based on hash function[J]. Information Sciences, 2014, 278: 104-109.[9] Martin K M, Pieprzyk J, Safavi-Naini R, et al. Changing thresholds in the absence of secure channels[C]//In 4th Australasian Conference Information Security and Privacy, ACISP, 1999, 1587: 177-191.[10] Tartary C, Wang H X. Dynamic threshold and cheater resistance for shamir secret sharing scheme[C]//In 2nd SKLOIS Conference on Information Security and Cryptology, 2006, 318: 103-117.[11] Nojoumian M, Stinson D R. On dealer-free dyna mic threshold schemes[J]. Advance in Mathema Tics of Communications, 2013(7): 39-56.[12] Zhao D W, Peng H P, Wang C, et al. Secret sharing scheme with short share realizing (t,n) threshold and adversary structure[J]. Computers and Mathematics with Applications, 2012, 64(4): 611-615. |
