Abstract
The purpose of this paper is to provide a general information-theoretic framework extensible to arbitrary access structures and to establish the correspondence between ideal SSS and matroids without invoking the more restrictive combinatorial definition of ideal scheme.
on leave at Department of Mathematics, Texas A&M University
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
G. R. Blakley, Safeguarding cryptographic keys, Proceedings of AFIPS 1979 National Computer Conference, vol.48, N. Y., 1979, pp. 313–317.
A. Shamir, How to share a secret, Communications of the ACM, vol.22, no.1, 1979, pp. 612–613.
R. J. McEliece and D. V. Sarwate, On secret sharing and Reed-Solomon codes, Communications of the ACM, vol. 24, 1981, pp. 583–584.
E. D. Karnin, J. W. Greene, and M. E. Hellman, On secret sharing systems, IEEE Transactions on Informatiom Theory, vol. 29, no. 1, 1983, pp. 231–241.
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, 1993, pp. 157–167.
E. F. Brickell and D. M. Davenport, On the classification of ideal secret sharing schemes, Journal of Cryptology, vol. 4, 1991, pp. 123–134.
W.-A. Jackson and K. M. Martin, Combinatorial models for perfect secret sharing schemes, Submitted to Journal of Combinatorial Mathematics and Combinatorial Computing
D. R. Stinson, An explication of secret sharing schemes, Designs, Codes and Cryptography, vol.2, 1992, pp. 357–390.
K. M. Martin, Discrete structures in the theory of secret sharing, Ph. D. thesis, University of London, 1991.
D. J. A. Welsh, Matroid Theory, Academic Press, 1976.
K. Kurosawa, K. Okada, K. Sakano, W. Ogata and S. Tsujii, Nonperfect secret sharing schemes and matroids, Advances in Cryptology—EUROCRYPT’93, Lect. Notes in Comput. Sci. vol. 765, 1993, pp. 126–141.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blakley, G.R., Kabatianski, G.A. (1995). On General Perfect Secret Sharing Schemes. In: Coppersmith, D. (eds) Advances in Cryptology — CRYPT0’ 95. CRYPTO 1995. Lecture Notes in Computer Science, vol 963. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44750-4_29
Download citation
DOI: https://doi.org/10.1007/3-540-44750-4_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60221-7
Online ISBN: 978-3-540-44750-4
eBook Packages: Springer Book Archive