Abstract
A secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of partecipants can recover the secret, but any non-qualified subset has absolutely no information on the secret. The set of all qualified subsets defines the access structure to the secret. Sharing schemes are useful in the management of cryptographic keys and in multy-party secure protocols.
We analyze the relationships among the entropies of the sample spaces from which the shares and the secret are chosen. We show that there are access structures with 4 participants for which any secret sharing scheme must give to a participant a share at least 50% greater than the secret size. This is the first proof that there exist access structures for which the best achievable information rate (i.e., the ratio between the size of the secret and that of the largest share) is bounded away from 1. The bound is the best possible, as we construct a secret sharing scheme for the above access structures which meets the bound with equality.
This work was partially supported by the Italian Ministry of the University and Scientific Research, within the framework of the Project: Progetto ed Analisi di Algoritmi and by the National Council of Research, Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo.
Chapter PDF
Similar content being viewed by others
Keywords
- Access Structure
- Secret Sharing Scheme
- Threshold Scheme
- Average Uncertainty
- Conditional Mutual Information
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
J. C. Benaloh and J. Leichter, Generalized Secret Sharing and Monotone Functions, Crypto 88, pp. 27–35.
G. R. Blakley, Safeguarding Cryptographic Keys, Proceedings AFIPS 1979 National Computer Conference, pp. 313–317, June 1979.
E. F. Brickell and D. M. Davenport, On the Classification of Ideal Secret Sharing Schemes, J. Cryptology, to appear.
E. F. Brickell and D. R. Stinson, Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes, Crypto 90 (Published also as Research Report #106, May 1990, University of Nebraska).
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, Proc. IEEE Global Telecommunications Conf., Globecom 87, Tokyo, Japan, 1987, pp. 99–102.
E. D. Karnin, J. W. Greene, and M. E. Hellman, On Secret Sharing Systems, IEEE Trans. on Inform. Theory, vol. IT-29, no. 1, Jan. 1983, pp. 35–41.
S. C. Kothari, Generalized Linear Threshold Schemes, Crypto 84, pp. 231–241.
A. Shamir, How to Share a Secret, Communications of the ACM, vol. 22, n. 11, pp. 612–613, Nov. 1979.
C. E. Shannon, The Mathematical Theory of Communication, Bell. Syst. J., vol. 27, pp. 379–423, 623–656, July/Oct. 1948.
G.J. Simmons, Robust Shared Secret Schemes or “How to be Sure You Have the Right Answer even though You don’t Know the Question”, Congressus Numerantium, vol. 8, pp. 215–248, 1989.
G.J. Simmons, The Geometry of Shared Secret Schemes, Bulletin of the Institute of Combinatorics and its Applications (ICA), vol. 1, pp. 59–70, Jan. 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Capocelli, R.M., De Santis, A., Gargano, L., Vaccaro, U. (1992). On the Size of Shares for Secret Sharing Schemes. In: Feigenbaum, J. (eds) Advances in Cryptology — CRYPTO ’91. CRYPTO 1991. Lecture Notes in Computer Science, vol 576. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46766-1_7
Download citation
DOI: https://doi.org/10.1007/3-540-46766-1_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55188-1
Online ISBN: 978-3-540-46766-3
eBook Packages: Springer Book Archive