Skip to main content

A Cheat-Prevention Visual Secret Sharing Scheme with Minimum Pixel Expansion

  • 1552 Accesses

Part of the Lecture Notes in Computer Science book series (LNSC,volume 8389)


A visual secret sharing (VSS) scheme with minimum pixel expansion is proposed to prevent malicious participants from deceiving an honest participant. A VSS scheme encrypts a secret image into pieces referred to as shares where each participant keeps a share so that stacking sufficient number of shares recovers the secret image. A cheat prevention VSS scheme provides another piece for each participant for verifying whether the shares presented by other participants are genuine. The proposed scheme improves the contrast of the recovered image and cheat-prevention functionality by introducing randomness in producing pieces for verification. Experimental results show the effectiveness of the proposed scheme.


  • Visual secret sharing
  • Cheat prevention
  • Visual cryptography

This is a preview of subscription content, access via your institution.

Buying options

USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions


  1. Shamir, A.: How to share a secret. Commun. ACM 22, 612–613 (1979)

    CrossRef  MATH  MathSciNet  Google Scholar 

  2. Naor, M., Shamir, A.: Visual cryptography. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 1–12. Springer, Heidelberg (1995)

    CrossRef  Google Scholar 

  3. Biehl, I., Wetzel, S.: Traceable visual cryptography. In: Han, Y., Quing, S. (eds.) ICICS 1997. LNCS, vol. 1334, pp. 61–71. Springer, Heidelberg (1997)

    CrossRef  Google Scholar 

  4. Hofmeister, T., Krause, M., Simon, H.-U.: Contrast-optimal \(k\) out of \(n\) secret sharing schemes in visual cryptography. Theor. Comput. Sci. 240(2), 471–485 (2000)

    CrossRef  MATH  MathSciNet  Google Scholar 

  5. Cimato, S., Prisco, R.D., Santis, A.D.: Optimal colored visual cryptography schemes. Des. Codes Crypt. 35, 311–335 (2005)

    CrossRef  MATH  Google Scholar 

  6. Ishihara, T., Koga, H.: A visual secret sharing scheme for color images based on meanvalue-color mixing. IEICE Trans. Fundam. E86–A(1), 194–197 (2003)

    Google Scholar 

  7. Koga, H., Ishihara, T.: A general method for construction of \((t, n)\)- threshold visual secret sharing schemes for color images. Des. Codes Crypt. 61(2), 223–249 (2011)

    CrossRef  MATH  MathSciNet  Google Scholar 

  8. Ateniese, G., Blundo, C., De Santis, A., Stinson, D.R.: Extended capabilities for visual cryptography. Theor. Comput. Sci. 250, 143–161 (2001)

    CrossRef  MATH  Google Scholar 

  9. Chang, C.-C., Yu, T.-X.: Sharing a secret gray image in multiple secret. In: Proceedings of International Symposium on Cyber Worlds, pp. 1–8 (2002)

    Google Scholar 

  10. Iwamoto, M., Wang, L., Yoneyama, K., Kunihiro, N., Ohta, K.: Visual secret sharing schemes for multiple secret images allowing the rotation of shares. IEICE Trans. Fundam. E89(5), 1382–1395 (2006)

    CrossRef  Google Scholar 

  11. Iwamoto, M.: A weak security notion for visual secret sharing schemes. IEEE Trans. Inf. Forensics Secur. 7(2), 372–382 (2012)

    CrossRef  MathSciNet  Google Scholar 

  12. Iwamoto, M.: Security notions of visual secret sharing schemes. In: Proceedings of IWAIT, pp. 95–100 (2013)

    Google Scholar 

  13. Cimato, S., De Santis, A., Ferrara, A.L., Masucci, B.: Ideal contrast visual cryptography schemes with reversing. Inf. Process. Lett. 93(4), 199–206 (2005)

    CrossRef  MATH  Google Scholar 

  14. Eisen, P.A., Stinson, D.R.: Threshold visual cryptography with specified whiteness levels of reconstructed pixels. Des. Codes Crypt. 25(1), 15–61 (2002)

    CrossRef  MATH  MathSciNet  Google Scholar 

  15. Tsai, D.S., Chen, T.H., Horng, G.: A cheating prevention scheme for binary visual cryptography with homogeneous secret images. Pattern Recog. 40(8), 2356–2366 (2007)

    CrossRef  MATH  Google Scholar 

  16. Hu, C.M., Tzeng, W.G.: Cheating prevention in visual cryptography. IEEE Trans. Image Process. 16(1), 36–45 (2007)

    CrossRef  MATH  MathSciNet  Google Scholar 

  17. Chen, Y.C., Horng, G., Tsai, D.S.: Comment on ‘cheating prevention in visual cryptography’. IEEE Trans. Image Process. 21(7), 3319–3323 (2012)

    CrossRef  MathSciNet  Google Scholar 

  18. Chen, Y.C., Tsai, D.S., Horng, G.: A new authentication based cheating prevention scheme in Naor-Shamir’s visual cryptography. J. Vis. Commun. Image Represent. 23, 1225–1233 (2012)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations


Corresponding author

Correspondence to Shenchuan Liu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, S., Fujiyoshi, M., Kiya, H. (2014). A Cheat-Prevention Visual Secret Sharing Scheme with Minimum Pixel Expansion. In: Shi, Y., Kim, HJ., Pérez-González, F. (eds) Digital-Forensics and Watermarking. IWDW 2013. Lecture Notes in Computer Science(), vol 8389. Springer, Berlin, Heidelberg.

Download citation

  • DOI:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-43885-5

  • Online ISBN: 978-3-662-43886-2

  • eBook Packages: Computer ScienceComputer Science (R0)