Abstract
In this paper, we determine the access structure of a number of secret-sharing schemes that are based on error-correcting linear codes with respect to two approaches. Some secret-sharing, schemes based on linear codes are also constructed. The relation between the minimum distance of codes and the access structure of secret-sharing schemes is also investigated.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
G. R. Blakley, Safeguarding cryptographic keys, Proc. NCC AFIPS 1979, 313–317.
E. F. Brickell and D. M. Davenport, On the classification of ideal secret sharing schemes, J. Cryptology 4 (1991), 105–113. [Preliminary version in “Advances in Cryptology—Crypto'89, LNCS 435 (1990), 278–285.]
E. F. Brickell, Some ideal secret sharing schemes, in “Advances in Cryptology — Eurocrypt'89”, LNCS 434 (1990), 468–475.
C. Charnes, J. Pieprzyk and R. Safavi-Naini Conditionally secure secret sharing scheme with disenrollment capability, in “2nd ACM Conference on Computer and Communications Security,” ACM Press, 1994, 89–95.
E. Dawson, E. S. Mahmoodian and A. Rahilly, Orthogonal arrays and ordered threshold schemes, Australian Journal of Combinatorics 8 (1993), 27–44.
M. Van Dijk, A linear construction of Perfect secret sharing schemes, in “Advances in Cryptology-Eurocrypt'94”, A. De Santis, ed., LNCS 950 (1995), 23–34.
E. D. Karnin, J. W. Green and M. Hellman, On secret sharing systems, IEEE Trans Inform. Theory, Vol. IT-29 (1983), 644–654.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, 1978.
K. M. Martin, New secret sharing schemes from old, Journal of Combinatorial Mathematics and Combinatorial Computing 14 (1993), 65–77.
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.
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.
R. J. McEliece and D. V. Sarwate, On sharing secrets and Reed-Solomon codes, Comm. ACM 24 (1981), 583–584.
A. Shamir, How to share a secret, Comm. ACM 22, 1979, 612–613.
G. J. Simmons, How to (really) share a secret, in “Advances in Cryptology — Crypto'88”, Goldwasser, ed., LNCS 403 (1989), 390–448.
G. J. Simmons, Geometric shared secret and/or shared control schemes, in “Advances in Cryptology — Crypt'90”, LNCS 537 (1991), 216–241.
Y. Zheng, T. Hardjono and J. Seberry, Reusing shares in secret sharing schemes, The Computer Journal 37 (1994), 199–205.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Renvall, A., Ding, C. (1996). The access structure of some secret-sharing schemes. In: Pieprzyk, J., Seberry, J. (eds) Information Security and Privacy. ACISP 1996. Lecture Notes in Computer Science, vol 1172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023288
Download citation
DOI: https://doi.org/10.1007/BFb0023288
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61991-8
Online ISBN: 978-3-540-49583-3
eBook Packages: Springer Book Archive