A construction of practical secret sharing schemes using linear block codes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 718 LNCS, Issue , 1993, Pages 67-79

  Bertilsson, Michael ^a   Ingemarsson, Ingemar ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

GENERAL ACCESS STRUCTURE; LINEAR BLOCK CODE; SECRET SHARING SCHEMES; THRESHOLD SCHEMES;

BLOCK CODES;

EID: 84984804645     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57220-1_53     Document Type: Conference Paper

References (8)

1. EJ. MacWiniams, N. J. A. Sloane, The Theory of ErrorCorrecting Codes, North-Holland, First Edition 1977
2. A. Shamir, How to Share a Secret, Comm. ACM, Vol.22, pp612, Nov 1979
3. G. R. Blakely, Safeguarding Cryptographic Keys, Proc. AFIPS 1979 Natl. Computer Conference, New York, Vol.48, pp 313-317, June 1979
4. G. Simmons Ed, Contemporary Cryptology, IEEE Press, 1992
5. 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
6. R. J. McEliece, D. V. Sarwate, On Sharing Secrets and Reed-Solomon Codes, Comm. ACM, Vol.24, pp 583-584, Sep 1981
7. E.D Kamin, J.W. Green, M.E. Hellman, On Secret Sharing Systems, IEEE Trans. Information Th., Vol. IT-29, No 1, pp. 35-41, Jan 1983
8. K.M. Martin, Discrete Structures in the Theory of Secret Sharing, Doct. Thesis, Royal Holloway and Bedford New College, University of London, 1991