FULLY DYNAMIC SECRET SHARING SCHEMES

We consider secret sharing schemes in which the dealer is able (after a preprocessing stage) to activate a particular access structure out o f a given set and/or to allow the participants to reconstruct differen t secrets (in different time instants) by sending them the same broadc ast message. In this paper we establish a formal setting to study secr et sharing schemes of this kind. The security of the schemes presented is unconditional, since they are not based on any computational assum ption. We give bounds on the size of the shares held by participants, on the size of the broadcast message, and on the randomness needed in such schemes.