We consider secret sharing schemes in which the dealer has the feature of being able (after a preprocessing stage) to activate a par-ticular 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.
CITATION STYLE
Blundo, C., Cresti, A., De Santis, A., & Vaccaro, U. (1994). Fully dynamic secret sharing schemes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 773 LNCS, pp. 110–125). Springer Verlag. https://doi.org/10.1007/3-540-48329-2_10
Mendeley helps you to discover research relevant for your work.