Skip to main content
SpringerLink
Log in

New Colored Visual Secret Sharing Schemes

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

Abstract

Visual secretsharing (VSS) schemes are used to protect the visual secret bysending n transparencies to different participantsso that k-1 or fewer of them have no informationabout the original image, but the image can be seen by stackingk or more transparencies. However, the revealedsecret image of a conventional VSS scheme is just black and white.The colored k out of n VSS scheme sharinga colored image is first introduced by Verheul and Van Tilborg[1]. In this paper, a new construction for the colored VSS schemeis proposed. This scheme can be easily implemented on basis ofa black & white VSS scheme and get much better block lengththan the Verheul-Van Tilborg scheme.

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. G. Ateniese, C. Blundo, A. De Santis, and D. R. Stinson, Constructions and bounds for visual cryptography, Proc. 23rd International Colloquium on Automata, Languages, and Programming (ICALP' 96), (1996) pp. 416–428.

  2. G. Ateniese, C. Blundo, A. De Santis, and D. R. Stinson, Visual cryptography for general access structures, ECCC, Electronic Colloquium on Computational Complexity (TR96–012), via WWW using http://www.eccc.uni-trier.de/eccc/.

  3. G. R. Blakley, Safeguarding cryptographic keys, AFIPS Conference Proceedings, Vol. 48 (1979) pp. 313–317.

  4. S. Droste, New results on visual cryptography, Advances in Cryptology-CRYPTO' 96, Lecture Notes in Computer Science, No. 1109 (1996) pp. 401–415.

  5. T. Katoh and H. Imai, Some visual secret sharing schemes and their share size, Proceedings of International Conferences on Cryptology and Information Security, (1996) pp. 41–47.

  6. Kazukuni, Kobara and H. Imai, Limiting the visible space visual secret sharing schemes and their application to human identification, Advances in Cryptology-ASISCRYPTO' 96, Lecture Notes in Computer Science, No. 1163 (1996) pp. 185–195.

  7. M. Naor and A. Shamir, Visual cryptography, Advances in Cryptology-EUROCRYPT' 94, Lecture Notes in Computer Science, No. 950 (1995) pp. 1–12.

  8. A. Shamir, How to share a secret, Commun. of the ACM, Vol. 22 (1979) pp. 612–613.

    Google Scholar 

  9. E. R. Verheul and H. C. A. Van Tilborg, Constructions and properties of k out of n visual secret sharing schemes, Designs, Codes and Cryptography, Vol. 11, No. 2 (1997) pp. 179–196

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien, Taiwan

    Ching-Nung Yang

  2. Department of Electrical Engineering, National Cheng Kung University, Tainan, Taiwan, R.O.C.

    Chi-Sung Laih

Authors
  1. Ching-Nung Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chi-Sung Laih
    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

Yang, CN., Laih, CS. New Colored Visual Secret Sharing Schemes. Designs, Codes and Cryptography 20, 325–336 (2000). https://doi.org/10.1023/A:1008382327051

Download citation

  • Issue Date:

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

Search

Navigation