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]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

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

[3]  G. R. BLAKLEY.  Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

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

[5]  Carlo Blundo.  A Note on Dynamic Threshold Schemes , 1995, Inf. Process. Lett..

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

[7]  László Csirmaz,et al.  The Size of a Share Must Be Large , 1994, Journal of Cryptology.

[8]  Alfredo De Santis,et al.  Randomness in Distributed Protocols , 1994 .

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

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

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

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

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

[14]  Alfredo De Santis,et al.  On the Information Rate of Secret Sharing Schemes , 1996, Theor. Comput. Sci..

[15]  Alfredo De Santis,et al.  Graph Decompositions and Secret Sharing Schemes , 1992, EUROCRYPT.

[16]  Alfredo De Santis,et al.  Tight Bounds on the Information Rate of Secret Sharing Schemes , 1997, Des. Codes Cryptogr..

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

[18]  Hung-Min Sun,et al.  On Dynamic Threshold Schemes , 1994, Inf. Process. Lett..

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

[20]  Eli Upfal,et al.  A time-randomness tradeoff for oblivious routing , 1988, STOC '88.

[21]  Suresh C. Kothari,et al.  Generalized Linear Threshold Scheme , 1985, CRYPTO.

[22]  Douglas R. Stinson,et al.  New General Lower Bounds on the Information Rate of Secret Sharing Schemes , 1992, CRYPTO.

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

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

[25]  Marten van Dijk.  On the information rate of perfect secret sharing schemes , 1995, Des. Codes Cryptogr..