Skip to main content
SpringerLink
Log in

Constructions and Properties of k out of n Visual Secret Sharing Schemes

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

The idea of visual k out of n secret sharing schemes was introduced in Naor. Explicit constructions for k = 2 and k = n can be found there. For general k out of n schemes bounds have been described.

Here, two general k out of n constructions are presented. Their parameters are related to those of maximum size arcs or MDS codes. Further, results on the structure of k out of n schemes, such as bounds on their parameters, are obtained. Finally, the notion of coloured visual secret sharing schemes is introduced and a general construction is given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. B. Arazi, I. Dinstein and O. Kafri, Intuition, perception, and secure communication, IEEE Transactions on Systems, Man, and Cybernetics, Vol. 19 (1989) pp. 1016–1020.

    Google Scholar 

  2. F. van der Heijden, Image Based measurement Systems, John Wiley & Sons, Chichester (1994).

    Google Scholar 

  3. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North Holland, Amsterdam etc., 1977.

    Google Scholar 

  4. M. Naor and A. Shamir, Visual cryptography, Preproceedings of Eurocrypt '94 (1994) pp. 1–11.

  5. W. K. Pratt, Digital Image Processing, John Wiley & Sons, Chichester (1991).

    Google Scholar 

  6. W. Rudin, Functional Analysis, MacGraw-Hill Series in Higher Mathematics, MacGraw-Hill, New York (1973).

    Google Scholar 

  7. L. Storme and J. A. Thas, M. D. S. codes and arcs in P G(n, q) with q even: an improvement of the bounds of Bruen, Thas and Blokhuis, Journal of Combinatorial Theory, Series A, Vol. 62 (1993) pp. 139–154

    Google Scholar 

  8. J. A. Thas, Projective geometry over a finite field, Chapter 7 in Handbook of Incidence Geometry (F. Buekenhout, ed.), Elsevier Science, Amsterdam (1995).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ministry of the Interior, P.O. Box 20010, 2500 EA, the Hague, the Netherlands

    Eric R. Verheul

  2. Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, the Netherlands

    Henk C. A. van Tilborg

Authors
  1. Eric R. Verheul
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Henk C. A. van Tilborg
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Verheul, E.R., van Tilborg, H.C.A. Constructions and Properties of k out of n Visual Secret Sharing Schemes. Designs, Codes and Cryptography 11, 179–196 (1997). https://doi.org/10.1023/A:1008280705142

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008280705142

Search

Navigation