Abstract
In this paper we address the problem of constructing secret sharing schemes for general access structures. The construction is inspired by linear block codes. Already in the beginning of the eighties constructions of threshold schemes using linear block codes were presented in [6] and [7]. In this paper we generalize those results to construct secret sharing schemes for arbitrary access structure. We also present a solution to the problem of retrieving the secret.
Preview
Unable to display preview. Download preview PDF.
References
F.J. MacWilliams, N. J. A. Sloane, The Theory of ErrorCorrecting Codes, North-Holland, First Edition 1977
A. Shamir, How to Share a Secret, Comm. ACM, Vol.22, pp612, Nov 1979
G. R. Blakely, Safeguarding Cryptographic Keys, Proc. AFIPS 1979 Natl. Computer Conference, New York, Vol.48, pp 313–317, June 1979
G. Simmons Ed, Contemporary Cryptology, IEEE Press, 1992
G. Simmons, W. Jackson, K. Martin, The Geometry of Shared Secret Schemes, Bulletin of the Institute of Combinatorics and its Application (ICA) to appear 1991
R. J. McEliece, D. V. Sarwate, On Sharing Secrets and Reed-Solomon Codes, Comm. ACM, Vol.24, pp 583–584, Sep 1981
E.D Karnin, J.W. Green, M.E. Hellman, On Secret Sharing Systems, IEEE Trans. Information Th., Vol. IT-29, No 1, pp. 35–41, Jan 1983
K.M. Martin, Discrete Structures in the Theory of Secret Sharing, Doct. Thesis, Royal Holloway and Bedford New College, University of London, 1991
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bertilsson, M., Ingemarsson, I. (1993). A construction of practical secret sharing schemes using linear block codes. In: Seberry, J., Zheng, Y. (eds) Advances in Cryptology — AUSCRYPT '92. AUSCRYPT 1992. Lecture Notes in Computer Science, vol 718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57220-1_53
Download citation
DOI: https://doi.org/10.1007/3-540-57220-1_53
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57220-6
Online ISBN: 978-3-540-47976-5
eBook Packages: Springer Book Archive