Abstract
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.
Partially supported by Italian Ministry of University and Research (M.U.R.S.T.) and by National Council for Research (C.N.R.).
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
B. Blakley, G. R. Blakley, A. H. Chan, and J. Massey, Threshold Schemes with Disenrollment, in “Advances in Cryptology-CRYPTO’ 92”, Ed. E. Brickell, “Lecture Notes in Computer Science”, Springer-Verlag.
G. R. Blakley, Safeguarding Cryptographic Keys, Proceedings AFIPS 1979 National Computer Conference, pp.313–317, June 1979.
C. Blundo, A. De Santis, L. Gargano, and U. Vaccaro, On the Information Rate of Secret Sharing Schemes, in “Advances in Cryptology-CRYPTO’ 92”, Ed. E. Brickell, “Lecture Notes in Computer Science”, Springer-Verlag.
C. Blundo, A. De Santis, D. R. Stinson, and U. Vaccaro, Graph Decomposition and Secret Sharing Schemes, in “Advances in Cryptology — Eurocrypt’ 92”, Lecture Notes in Computer Science, Vol. 658, R. Rueppel Ed., Springer-Verlag, pp. 1–24, 1993.
E. F. Brickell and D. M. Davenport, On the Classification of Ideal Secret Sharing Schemes, J. Cryptology, Vol. 4, No. 2, pp. 123–134, 1991.
R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, On the Size of Shares for Secret Sharing Schemes, Journal of Cryptology, Vol. 6, No. 3, pp. 157–169, 1993.
O. Goldreich, S. Micali, and A. Wigderson, How to Play any Mental Game, Proceedings of 19th ACM Symp. on Theory of Computing, pp. 218–229, 1987.
L. Harn, T. Hwang, C. Laih, and J. Lee, Dynamic Threshold Scheme based on the definition of Cross-Product in a N-dimensional Linear Space in “Advances in Cryptology-Eurocrypt’ 89”, Lecture Notes in Computer Science, Vol. 435, J. Brassard Ed., Springer-Verlag, pp. 286–298.
E. D. Karnin, J. W. Greene, and M. E. Hellman, On Secret Sharing Systems, IEEE Trans. on Inform. Theory, Vol. IT-29, no. 1, pp. 35–41, Jan. 1983.
K. Martin, Discrete Structures in the Theory of Secret Sharing, PhD Thesis, University of London, 1991.
K. Martin, Untrustworthy Participants in Perfect Secret Sharing Schemes, Proceedings of the 3rd IMA Conference on Coding and Cryptology, 1992.
A. Shamir, How to Share a Secret, Communications of the ACM, Vol. 22, n. 11, pp. 612–613, Nov. 1979.
G. J. Simmons, An Introduction to Shared Secret and/or Shared Control Schemes and Their Application, Contemporary Cryptology, IEEE Press, pp. 441–497, 1991.
G. J. Simmons, How to (Really) Share a Secret, in “Advances in Cryptology-CRYPTO 88”, Ed. S. Goldwasser, “Lecture Notes in Computer Science”, Springer-Verlag.
G. J. Simmons, W. Jackson, and K. Martin, The Geometry of Shared Secret Schemes, Bulletin of the ICA, Vol. 1, pp. 71–88, 1991.
D. R. Stinson, An Explication of Secret Sharing Schemes, Design, Codes and Cryptography, Vol. 2, pp. 357–390, 1992.
D. R. Stinson, Decomposition Constructions for Secret Sharing Schemes, Technical Report UNL-CSE-92-020, Department of Computer Science and Engineering, University of Nebraska, September 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blundo, C., Cresti, A., De Santis, A., Vaccaro, U. (1994). Fully Dynamic Secret Sharing Schemes. In: Stinson, D.R. (eds) Advances in Cryptology — CRYPTO’ 93. CRYPTO 1993. Lecture Notes in Computer Science, vol 773. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48329-2_10
Download citation
DOI: https://doi.org/10.1007/3-540-48329-2_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57766-9
Online ISBN: 978-3-540-48329-8
eBook Packages: Springer Book Archive