Abstract
A secret sharing scheme is a method for dividing a secret key k among a set P of participants in such a way that: if the participants in A ⊆ P are qualified to know the secret they can reconstruct the secret key k; but any set A ⊆ P, which is not qualified to know the secret, has absolutely no information on k.
In this paper we give further evidence that Information Theory is source of valuable tools to analyze and design efficient secret sharing schemes.
This work was partially supported by the National Council of Research (C.N.R.) under grant 91.02326.CT12 and by M.U.R.S.T. in the framework of Project: “Algoritmi, Sistemi di Calcolo e Strutture Informative”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. C. Benaloh and J. Leichter, Generalized Secret Sharing and Monotone Functions, Proceedings of Crypto ’88, Advances in Cryptology, Lecture Notes in Computer Science, vol. 403, S. Goldwasser, Ed., Springer-Verlag, Berlin, 1990, pp. 27–35.
G. R. Blakley, Safeguarding Cryptographic Keys, Proceedings of AFIPS 1979 National Computer Conference, vol. 48, New York, NY, pp. 313–317, June 1979.
G. R. Blakley and C. Meadows, Security of Ramp Schemes, Proceedings of Crypto ’84, Advances in Cryptology, Lecture Notes in Computer Science, vol. 196, G. R. Blakley and D. Chaum, Eds., Springer-Verlag, Berlin, 1985, pp. 411–431.
C. Blundo, A. De Santis, D. R. Stinson, and U. Vaccaro, Graph Decomposition and Secret Sharing Schemes, Eurocrypt ’92.
C. Blundo, A. De Santis, L. Gargano, and U. Vaccaro, On the Information Rate of Secret Sharing Schemes, preprint.
E. F. Brickell, Some Ideal Secret Sharing Schemes, J. Combin. Math. and Comb. Comput., vol. 9, 105–113, 1989.
E. F. Brickell and D. M. Davenport, On the Classification of Ideal Secret Sharing Schemes, J. Cryptology, vol. 4, 123–143, 1991.
E. F. Brickell and D. R. Stinson, Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes, in “Advances in Cryptology — CRYPTO 90”, S. A. Vanstone, Ed., Lectures Notes in Computer Science, Springer-Verlag, Berlin.
R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, On the Size of Shares in Secret Sharing Schemes, in “Advances in Cryptology — CRYPTO 91”, J. Feigenbaum, Ed., Lecture Notes in Computer Science, Springer-Verlag, Berlin.
I. Csiszár and J. Körner, Information Theory. Coding theorems for discrete memoryless systems, Academic Press, 1981.
D. Denning, Cryptography and Data Security, Addison-Wesley, Reading, MA, 1983.
R. G. Gallager, Information Theory and Reliable Communications, John Wiley & Sons, New York, NY, 1968.
O. Goldreich, S. Micali, and A. Wigderson, How to Play Any Mental Game, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, pp. 218–229.
M. Ito, A. Saito, and T. Nishizeki, Secret Sharing Scheme Realizing General Access Structure, Proceedings of IEEE Global Telecommunications Conference, Globecom 87, Tokyo, Japan, 1987, pp. 99–102.
E. D. Karnin, J. W. Greene, and M. E. Hellman, On Secret Sharing Systems, IEEE Transactions on Information Theory, vol. IT-29, no. 1, Jan. 1983, pp. 35–41.
S. C. Kothari, Generalized Linear Threshold Schemes, Proceedings of Crypto ’84, Advances in Cryptology, Lecture Notes in Computer Science, vol. 196, G. R. Blakley and D. Chaum, Eds., Springer-Verlag, Berlin, 1985, pp. 231–241.
R. J. McEliece and D. Sarwate, On Sharing Secrets and Reed-Solomon Codes, Communications of the ACM, vol. 24, n. 9, pp. 583–584, September 1981.
P. J. Schellenberg and D. R. Stinson, Threshold Schemes from Combinatorial Design, J. Combin. Math. and Combin. Computing, vol. 5, pp. 143–160, 1989.
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.
D. R. Stinson and A. Vanstone, A combinatorial approach to threshold schemes, SIAM J. Disc. Math., vol. 1, May 1988, pp.230–236.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag New York, Inc.
About this paper
Cite this paper
Capocelli, R.M., De Santis, A., Gargano, L., Vaccaro, U. (1993). A Note on Secret Sharing Schemes. In: Capocelli, R., De Santis, A., Vaccaro, U. (eds) Sequences II. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9323-8_25
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9323-8_25
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-9325-2
Online ISBN: 978-1-4613-9323-8
eBook Packages: Springer Book Archive