Fully Dynamic Secret Sharing Schemes

We consider secret sharing schemes in which the dealer has the feature of being able (after a preprocessing stage) to activate a particular access structure out of a given set and/or to allow the participants to reconstruct different secrets (in different time instants) by sending to all participants the same broadcast message. In this paper we establish a formal setting to study such secret sharing schemes. The security of the schemes presented is unconditional, since they are not based on any computational assumption. We give bounds on the size of the shares held by participants and on the site of the broadcast message in such schemes.

[1]  Douglas R. Stinson,et al.  An explication of secret sharing schemes , 1992, Des. Codes Cryptogr..

[2]  Chi-Sung Laih,et al.  Dynamic Threshold Scheme Based on the Definition of Cross-Product in an N-Dimentional Linear Space , 1989, CRYPTO.

[3]  Russell Impagliazzo,et al.  How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.

[4]  Douglas R. Stinson,et al.  Decomposition constructions for secret-sharing schemes , 1994, IEEE Trans. Inf. Theory.

[5]  Gustavus J. Simmons,et al.  How to (Really) Share a Secret , 1988, CRYPTO.

[6]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[7]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[8]  Ken Martin.  Discrete Structures in the Theory of Secret Sharing , 1991 .

[9]  G. R. Blakley,et al.  Threshold Schemes with Disenrollment , 1992, CRYPTO.

[10]  G. R. Blakley,et al.  Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[11]  Andrew Chi-Chih Yao,et al.  The complexity of nonuniform random number generation , 1976 .

[12]  Douglas R. Stinson,et al.  On the Dealer's Randomness Required in Secret Sharing Schemes , 1994, EUROCRYPT.

[13]  Ehud D. Karnin,et al.  On secret sharing systems , 1983, IEEE Trans. Inf. Theory.

[14]  Alfredo De Santis,et al.  On the Information Rate of Secret Sharing Schemes (Extended Abstract) , 1992, CRYPTO.