Abstract
A (k,n)-threshold visual cryptography scheme ((k,n)-threshold VCS, for short) is a method to encode a secret image SI into n shadow images called shares such that any k or more shares enable the “visual” recovery of the secret image, but by inspecting less than k shares one cannot gain any information on the secret image. The “visual” recovery consists of xeroxing the shares onto transparencies, and then stacking them. Any k shares will reveal the secret image without any cryptographic computation.
In this paper we analyze visual cryptography schemes in which the reconstruction of black pixels is perfect, that is, all the subpixels associated to a black pixel are black. For any value of k and n, where 2 ≤ k ≤ n, we give a construction for (k,n)-threshold VCS which improves on the best previously known constructions with respect to the pixel expansion (i.e., the number of subpixels each pixel of the original image is encoded into). We also provide a construction for coloured (2,n)-threshold VCS and for coloured (n,n)-threshold VCS. Both constructions improve on the best previously known constructions with respect to the pixel expansion.
Similar content being viewed by others
References
G. Ateniese, C. Blundo, A. De Santis and D. R. Stinson, Visual cryptography for general access structures, Inform. Computation, Vol. 129, No. 2 (1996) pp. 86–106.
G. Ateniese, C. Blundo, A. De Santis and D. R. Stinson, Constructions and bounds for visual cryptography. In 23rd International Colloquium on Automata, Languages and Programming, LNCS, Vol. 1099 (1996) pp. 416–428.
C. Blundo, P. D'Arco, A. De Santis and D. R. Stinson, Contrast optimal threshold visual cryptography schemes, SIAM J. Discrete Math., to appear (2000).
C. Blundo and A. De Santis, Visual cryptography schemes with perfect reconstruction of black pixels, J. Computers Graphics, Special issue: “Data Security in Image Communication and Networking.” Vol. 22, No. 4 (1999) pp. 449–455.
C. Blundo, A. De Santis and D. R. Stinson, On the contrast in visual cryptography schemes, J. Cryptol., Vol. 12 (1999) 73–85.
A. De Bonis and A. De Santis, Randomness in visual cryptography, STACS 2000, LNCS, Vol. 1770, pp. 627–638.
S. Droste, New results on visual cryptography. In Advances in Cryptology-CRYPTO '96, LNCS, Vol. 1109 (1996) pp. 401–415.
F. van der Heijden, Image Based Measurement Systems, John Wiley & Sons, Chichester (1994).
T. Hofmeister, M. Krause and H. U. Simon, Contrast-optimal k out of n secret sharing schemes in visual cryptography, COCOON '97, LNCS, Vol. 1276 (1997) pp. 176–185.
R. L. Grajam, D. E. Knuth and O. Patashnik, Concrete Mathematics, A Foundation for Computer Science, Addison Wesley (1988).
M. Naor and A. Shamir, Visual cryptography. In Advances in Cryptology-EUROCRYPT '94, LNCS, Vol. 950 (1995) pp. 1–12.
W. K. Pratt, Digital Image Processing, John Wiley & Sons, Chichester (1991).
D. R. Stinson, An introduction to visual cryptography. Presented at Public Key Solutions '97, Toronto, Canada, April (1997) pp. 28–30. Available as http://bibd.unl.edu/ stinson/VKS-PKS.ps.
E. R. Verheul and H. C. A. van Tilborg, Constructions and properties of k out of n visual secret sharing schemes, Des., Codes Cryptogr., Vol. 11, No. 2 (1997) pp. 179–196.
Rights and permissions
About this article
Cite this article
Blundo, C., Bonis, A.D. & Santis, A.D. Improved Schemes for Visual Cryptography. Designs, Codes and Cryptography 24, 255–278 (2001). https://doi.org/10.1023/A:1011271120274
Issue Date:
DOI: https://doi.org/10.1023/A:1011271120274