Designs, Codes and Cryptography

, Volume 38, Issue 2, pp 219–236 | Cite as

Cheating in Visual Cryptography

  • Gwoboa HorngEmail author
  • Tzungher Chen
  • Du-shiau Tsai


A secret sharing scheme allows a secret to be shared among a set of participants, P, such that only authorized subsets of P can recover the secret, but any unauthorized subset cannot recover the secret. In 1995, Naor and Shamir proposed a variant of secret sharing, called visual cryptography, where the shares given to participants are xeroxed onto transparencies. If X is an authorized subset of P, then the participants in X can visually recover the secret image by stacking their transparencies together without performing any computation. In this paper, we address the issue of cheating by dishonest participants, called cheaters, in visual cryptography. The experimental results demonstrate that cheating is possible when the cheaters form a coalition in order to deceive honest participants. We also propose two simple cheating prevention visual cryptographic schemes.


visual cryptography cheating secret sharing visual authentication 

AMS Classification



Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Blakley G., Safeguarding Cryptographic Keys, Proc. AFIPS 1979 Natl. Conf. New York, Vol. 48 (1979) pp. 313–317.Google Scholar
  2. 2.
    Brickell, E. F., Stinson, D. R. 1991The detection of cheaters in threshold schemesSIAM J. Disc. Math.4502510MathSciNetGoogle Scholar
  3. 3.
    Carpenteri, M. 1995A perfect threshold secret sharing scheme to identify cheatersDes. Codes Cryptogr.5183187MathSciNetGoogle Scholar
  4. 4.
    Chang, C. C., Chuang, J. C. 2002An image intellectual property protection scheme for gray-level image using visual secret sharing strategyPattern Recogn. Lett.23931941MathSciNetGoogle Scholar
  5. 5.
    Chang, C. C., Hwang, R. J. 1997Efficient cheater identification method for threshold schemesIEE Proc.-Comput. Digit. Technol.1442327Google Scholar
  6. 6.
  7. 7.
    Naor, M., Pinkas, B. 1997Visual Authentication and IdentificationBurton, S. Kaliski,Jr. eds. Advances in Cryptology—Proceedings of Crypto 97Springer-VerlagNew York322336Lecture Notes in Computer Science, 1294Google Scholar
  8. 8.
    Naor, M., Shamir, A. 1995Visual cryptographySantis, Alfredo eds. Advances in Cryptology—Proceedings of Eurocypto 94Springer-VerlagNew York112Lecture Notes in Computer Science, 950Google Scholar
  9. 9.
    Ogata, W., Kurosawa, K. 1996Optimum secret sharing scheme secure against cheatingMaurer, Ueli M. eds. Advances in Cryptology—Proceedings of Eurocypto 96Springer-VerlagNew York200211Lecture Notes in Computer Science, 1070Google Scholar
  10. 10.
    Rabin, M. 1989Efficient dispersal of information for security, load balancing, and fault toleranceJ. ACM36335348CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Shamir, A. 1979How to share a secretComm. ACM22612613CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    G. J. Simmons, An introduction to shared secret and/or shared control schemes and their applications, Contemporary Cryptology, IEEE Press, Piscataway (1991) pp. 491–497.Google Scholar
  13. 13.
    Tompa, M., Woll, H. 1988How to share a secret with cheatersJ. Cryptology1133138MathSciNetGoogle Scholar
  14. 14.
    Wang, C. C., Tai, S. C., Yu, C. S. 2000Repeating image watermarking technique by the visual cryptographyIEICE Trans. FundamentalsE83-A15891598Google Scholar

Copyright information

© Springer Science+Business Media, Inc. 2006

Authors and Affiliations

  1. 1.Department of Computer ScienceNational Chung Hsing UniversityTaichungR. O. C
  2. 2.Department of Information ManagementHsiuping Institute of TechnologyDali City,Taichung County 412Taiwan R. O. C.

Personalised recommendations