Linear multisecret-sharing schemes and error-correcting codes

Journal of Universal Computer Science

Volumn 3, Issue 9, 1997, Pages 1023-1036

  Ding, Cunsheng ^a   Laihonen, Tero ^b   Renvall, Ari ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b UNIVERSITY OF TURKU   (Finland)

Author keywords

Cryptosystems; Error correcting codes; Information theory

Indexed keywords

EID: 33646805667     PISSN: 0958695X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. G. R. Blakley, Safeguarding cryptographic keys, Proc. NCC AFIPS 1979, 313-317.
2. C. Blundo, A. De Santis, G. Di Cresceno, A. Gaggia, and U. Vaccaro, Multi-secret sharing schemes, Advances in Cryptology: Crypto'93, LNCS 773, Springer-Verlag, 1993, 126-135.
3. D. C. Bossen and S. S. Yau, Redundant residue polynomial codes, Information and Control, 13 (1968), 597-618.
4. W. A. Jackson, K. M. Martin, and C. M. O'Keefe, Multisecret threshold schemes, Advances in Cryptology: Crypto'94, LNCS 839, Springer-Verlag, 1994, 150-163.
5. E. D. Karnin, J. W. Green and M. Hellman, On secret sharing systems, IEEE Trans Inform. Theory, Vol. IT-29 (1983), 35-41.
6. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, 1978.
7. J. L. Massey, Minimal codewords and secret sharing, Proc. 6th Joint Swedish-Russian Workshop on Inform. Theory, Mölle, Sweden, August 22-27, 1993, 276-279.
8. J. L. Massey, Some applications of coding theory in cryptography, in Codes and Cyphers: Cryptography and Coding IV (Ed. P. G. Farrell). Esses, England: Formara Ltd., 1995, 33-47.
9. R. J. McEliece and D. V. Sarwate, On sharing secrets and Reed-Solomon codes, Comm. ACM, Vol. 24 (1981), 583-584.
10. A. Salomaa, Public-Key Cryptography, Heidelberg: Springer, 1990, 187-190.
11. A. Shamir, How to share a secret, Comm. ACM, Vol. 22, 1979, 612-613.
12. G. J. Simmons, How to (really) share a secret, Proc. Crypto'88, LNCS 403, Springer 1989, 390-448.
13. G. J. Simmons, Geometric shared secret and/or shared control schemes, Proc. Crypto'90, LNCS 537, Springer 1991, 216-241.
14. D. R. Stinson and S. A. Vanstone, A combinatorial approach to threshold schemes, SIAM J. Disc. Math, vol. 1, No. 2 (1988), 230-236.
15. Y. Zheng, T. Hardjono, and J. Seberry, Reusing shares in secret sharing schemes, The Computer Journal 37 (1994), 199-205.