Abstract
In a secret sharing scheme, a dealer has a secret. The dealer gives each participant in the scheme a share of the secret. There is a set Γ of subsets of the participants with the property that any subset of participants that is in Γ can determine the secret. In a perfect secret sharing scheme, any subset of participants that is not in Γ cannot obtain any information about the secret. We will say that a perfect secret sharing scheme is ideal if all of the shares are from the same domain as the secret. Shamir and Blakley constructed ideal threshold schemes, and Benaloh has constructed other ideal secret sharing schemes. In this paper, we construct ideal secret sharing schemes for more general access structures which include the multilevel and compartmented access structures proposed by Simmons.
This work performed at Sandia National Laboratories and supported by the US. Department of Energy under contract No. DE-AC04-76DP00789.
Chapter PDF
Similar content being viewed by others
References
Josh C. Benaloh and Jerry Leichter. Generalized secret sharing and monotone functions. to appear in Advances in Cryptology-CRYPTO88.
G. R. Blakley. Safeguarding cryptographic keys. In Proceedings AFIPS 1979 National Computer Conference, pages 313–317, 1979.
M. Ito, A. Saito, and T Nishizeki. Secret sharing scheme realizing general access structure. In Proceedings IEEE Globcom’87, pages 99–102, Tokyo, Japan, 1987.
Adi Shamir. How to share a secret. Communications of the ACM, 22(11):612–613, Nov 1979.
Gustavus J. Simmons. How to (really) share a secret. to appear in Advances in Cryptology-CRYPTO88.
Gustavus J. Simmons. Robust shared secret schemes. to appear in Congressus Numerantium, Vol. 68–69.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brickell, E.F. (1990). Some Ideal Secret Sharing Schemes. In: Quisquater, JJ., Vandewalle, J. (eds) Advances in Cryptology — EUROCRYPT ’89. EUROCRYPT 1989. Lecture Notes in Computer Science, vol 434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46885-4_45
Download citation
DOI: https://doi.org/10.1007/3-540-46885-4_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53433-4
Online ISBN: 978-3-540-46885-1
eBook Packages: Springer Book Archive