199
Views
4
CrossRef citations to date
0
Altmetric
Original Articles

Multisecret-sharing schemes and bounded distance decoding of linear codes

&
Pages 107-114 | Received 08 May 2015, Accepted 01 Sep 2015, Published online: 16 Oct 2015

References

  • E.R. Berlekamp, R.J. McEliece, and H. van Tilborg, On the inherent intractability of some coding problems, IEEE Trans. Inform. Theory (1978), pp. 384–386.
  • G.R. Blakley, Safeguarding cryptographic keys, in Proceedings of the 1979 National Computer Conference, New York, June, 1979, pp. 313–317.
  • E.F. Brickell, Some ideal secret sharing schemes, in Advances in Cryptology-EUROCRYPT 89, IEEE Press, ed., Lecture Notes in Computer Science, Springer, Berlin, New York, Tokyo, vol. 434, 1990, pp. 468– 475.
  • C. Ding, D. Kohel, and S. Ling, Secret-sharing with a class of ternary codes, Theor. Comp. Sci. 246 (2000), pp. 285–298.
  • C. Ding, T. Laihonen, and A. Renvall, Linear multisecret-sharing schemes and error correcting codes, J. Comput. Sci. 3(9) (1997), pp. 1023–1036.
  • R. Hill, A First Course in Coding Theory, Oxford University, Oxford, 1986.
  • W.-A. Jackson, K.M. Martin, and C. O'Keefe, Ideal secret sharing schemes with multiple secrets, J. Cryptol. 9 (1996), pp. 223–250.
  • E.D. Karnin, J.W. Greene, and M.E. Hellman, On secret sharing systems, IEEE Trans. Inf. Theory IT-29(1) (1983), pp. 35–41.
  • F.J. MacWilliams and N.J.A. Sloane, The Theory of Error Correcting Codes, North Holland, 1977.
  • J.L. Massey, Minimal codewords and secret sharing, Proceedings of the 6th Joint Swedish-Russian Workshop on Information Theory, Mölle, Sweden, 1993, pp. 276–279.
  • R.J. McEliece and D.V. Sarwate, On sharing secrets and Reed-Solomon codes, Commun. Assoc. Comp. Mach. 24 (1981), pp. 583–584.
  • K. Okada and K. Kurosawa, MDS secret sharing scheme secure against cheaters, IEEE Trans. Inf. Theory 46(3) (1997), pp. 1078–1081.
  • H. Ozadam, F. Ozbudak, and Z. Saygı, Secret sharing schemes and linear codes, in Proceedings of Information Security Cryptology Conference with International Participation, Ankara, Turkey, December 2007, pp. 101–106.
  • J. Piepryzk and X.M. Zhang, Ideal threshold schemes from MDS codes, Proceedings of Information Security and Cryptology ICISC 2002, Lecture Notes in Computer Science, Vol. 2587, Springer-Verlag, Berlin, 2003, pp. 269–279.
  • S. Roman, Coding and Information Theory, Springer, Berlin, New York, Tokyo, 1992.
  • A. Shamir, How to share a secret, Comm. ACM 52 (1979), pp. 612–613.
  • J. Massey, Some applications of coding theory, in Cryptography, Codes and Ciphers: Cryptography and Coding IV, P. G. Farrell, ed., Formara Limited, Essex, England, 1995, pp. 33–47.
  • J. Yuan and C. Ding, Secret sharing schemes from three classes of linear codes, IEEE Trans. Inform. Theory 52(1) (2006), pp. 206–212.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.