A construction of practical secret sharing schemes using linear block codes
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  and . 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.
Unable to display preview. Download preview PDF.
- F.J. MacWilliams, N. J. A. Sloane, The Theory of ErrorCorrecting Codes, North-Holland, First Edition 1977Google Scholar
- A. Shamir, How to Share a Secret, Comm. ACM, Vol.22, pp612, Nov 1979Google Scholar
- G. R. Blakely, Safeguarding Cryptographic Keys, Proc. AFIPS 1979 Natl. Computer Conference, New York, Vol.48, pp 313–317, June 1979Google Scholar
- G. Simmons Ed, Contemporary Cryptology, IEEE Press, 1992Google Scholar
- G. Simmons, W. Jackson, K. Martin, The Geometry of Shared Secret Schemes, Bulletin of the Institute of Combinatorics and its Application (ICA) to appear 1991Google Scholar
- R. J. McEliece, D. V. Sarwate, On Sharing Secrets and Reed-Solomon Codes, Comm. ACM, Vol.24, pp 583–584, Sep 1981Google Scholar
- 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 1983Google Scholar
- K.M. Martin, Discrete Structures in the Theory of Secret Sharing, Doct. Thesis, Royal Holloway and Bedford New College, University of London, 1991Google Scholar