A Dynamic Secret Sharing Scheme Based on Factorization and Discrete Logarithms

Shamir A.How to share a secret[J].Communications of the ACM.1979,22(11):612-613[2]Blackley G R.Safeguarding cryptographic keys.In:Proceedings of the National Computer Conference of AFIPS,Montvale,1979,48:313-317.[3]Fouque P A,Poupard G,Sten J.Sharing decryption in the context of voting or lotteries.Proceedings of Financial Cryptography 2000.Berlin:Springer-Verlag,2000:90-104.[4]Brickell E F,Daveport D M.On the classification of idea secret sharing scheme.J.Cryptology,1991,4(2):123-134.[5]Tompa M,Woll H.How to share a secret with cheaters[J].J.Cryptology.1988,1(2):133-138[6]Chor B,Goldwasser S,Awerbuch B.Verifiable secret sharing and achieving simultaneity in the presence of faults.Proceedings of the 26th Annual IEEE Symposium on the Foundations of Computer Science,1985:383-395.[7]Stadler M.Publicly verifiable secret sharing.Advances in Cryptology-Eurocrypt96,Berlin:Springer-Verlag,1996:190-199.[8]Gennaro R,Micali S.Verifiable secret sharing as secure computation.Advances in CryptologyCrypto94.Berlin:Springer-Verlag,1995:168-182.