Abstract
Visual cryptography schemes allow the encoding of a secret image into n shares which are distributed to the participants. The shares are such that only qualified subsets of participants can “visually” recover the secret image. Usually the secret image consist of black and white pixels. In colored threshold visual cryptography schemes the secret image is composed of pixels taken from a given set of c colors. The pixels expansion and the contrast of a scheme are two measures of the goodness of the scheme.
In this paper, we study c-color (k,n)-threshold visual cryptography schemes and provide a characterization of contrast-optimal schemes. More specifically we prove that there exists a contrast-optimal scheme that is a member of a special set of schemes, which we call canonical schemes, and that satisfy strong symmetry properties.
Then we use canonical schemes to provide a constructive proof of optimality, with respect to the pixel expansion, of c-color (n,n)-threshold visual cryptography schemes.
Finally, we provide constructions of c-color (2,n)-threshold schemes whose pixels expansion improves on previously proposed schemes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G Ateniese C Blundo A Santis ParticleDe DR Stinson (1996) ArticleTitleVisual Cryptography for General Access Structures Information and Computation 129 IssueID2 86–106
G Ateniese C Blundo A Santis ParticleDe DR Stinson (2001) ArticleTitleExtended Schemes for Visual Cryptography Theoretical Computer Science 250 IssueID1-2 143–161
C. Blundo A. Bonis ParticleDe A Santis ParticleDe (2001) ArticleTitleImproved Schemes for Visual Cryptography Designs, Codes, and Cryptography 24 255–278
R. L. Grajam, D. E. Kunth and O. Patashnik, Concrete Mathematics, A Foundation for Computer Science, Addison Wesley, 1988.
JH Lint Particlevan RM Wilson (1992) A Course in Combinatorics Cambridge University Press Cambridge UK
M. Naor and A. Shamir, Visual Cryptography, In Advances in Cryptology – EUROCRYPT ‘94, LNCS 950, pp. 1–12, 1995.
ER Verheul HCA Tilborg Particlevan (1997) ArticleTitleConstructions and Properties of k out of n Visual Secret Sharing Schemes Designs, Codes, and Cryptography 11 IssueID2 179–196
CN Yang CS Laih (2000) ArticleTitleNew Colored Visual Secret Sharing Schemes Designs, Codes and Cryptography 20 325–335
Author information
Authors and Affiliations
Corresponding author
Additional information
*This author is also a member of the Akamai Faculty Group, Akamai Technologies, 8 Cambridge center, Cambridge, MA 02142, USA.
Rights and permissions
About this article
Cite this article
Cimato, S., Prisco, R.D. & Santis, A.D. Optimal Colored Threshold Visual Cryptography Schemes. Des Codes Crypt 35, 311–335 (2005). https://doi.org/10.1007/s10623-003-6741-z
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10623-003-6741-z