Skip to main content

Region-in-Region Incrementing Visual Cryptography Scheme

  • Conference paper
Book cover The International Workshop on Digital Forensics and Watermarking 2012 (IWDW 2012)

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

Included in the following conference series:

Abstract

Recently, some region incrementing VCSs (RIVCSs) were proposed, which can gradually reconstruct secrets in a single image. In RIVCS, the secret image is subdivided into multiple secrecy level regions, in such a way that more shadows can be used to reveal the more secrecy level regions. The incrementing region property provides an attractive feature, which enables progressive decoding. However, the secret level regions of all previous RIVCSs are disjointed, which any two secrecy level regions do not have the same overlapping areas. In this paper, we discuss a (k, n) region-in-region incrementing VCS (RiRIVCS). Our (k, n)-RiRIVCS has (n(k+1) secrecy level regions, which the next secrecy level region is in the preceding secrecy level region. Such region allocations in our RiRIVCS have more areas to hide the secret than the non-overlapping regions in the previous RIVCS.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Chapter  Google Scholar 

  2. Ito, R., Kuwakado, H., Tanaka, H.: Image size invariant visual cryptography. IEICE Trans. on Fund. of Elect. Comm. and Comp. Sci. E82-A, 2172–2177 (1999)

    Google Scholar 

  3. Yang, C.N.: New visual secret sharing schemes using probabilistic method. Pattern Recognition Letters 25, 481–494 (2004)

    Article  Google Scholar 

  4. Cimato, S., De Prisco, R., De Santis, A.: Probabilistic visual cryptography schemes. The Computer Journal 49, 97–107 (2006)

    Article  Google Scholar 

  5. Wang, D., Yi, F., Li, X.: Probabilistic visual secret sharing schemes for grey-scale images and color images. Information Sciences 181, 2189–2208 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  6. Shyu, S.J., Huang, S.Y., Lee, Y.K., Wang, R.Z., Chen, K.: Sharing multiple secrets in visual cryptography. Pattern Recognition 40, 3633–3651 (2007)

    Article  MATH  Google Scholar 

  7. Feng, J.B., Wu, H.C., Tsai, C.S., Chang, Y.F., Chu, Y.P.: Visual Secret sharing for multiple secrets. Pattern Recognition 41, 3572–3581 (2008)

    Article  MATH  Google Scholar 

  8. Yang, C.N., Chung, T.H.: A general multi-secret visual cryptography scheme. Optics Communications 283, 4949–4962 (2010)

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  10. Yang, C.N., Peng, A.G., Chen, T.S.: MTVSS (M)isalignment (T)olerant (V)isual (S)ecret (S)haring on resolving alignment difficulty. Signal Processing 89, 1602–1624 (2009)

    Article  MATH  Google Scholar 

  11. Liu, F., Wu, C.K., Lin, X.J.: The alignment problem of visual cryptography schemes. Designs, Codes and Cryptography 50, 215–227 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  12. Cimato, S., De Santis, A., Ferrara, A.L., Masucci, B.: Ideal contrast visual cryptography schemes withreversing. Information Processing Letters 93, 199–206 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  13. Verheul, E.R., Van Tilborg, H.C.A.: Constructions and properties of k out of n visual secret sharing scheme. Designs, Codes and Cryptography 1, 179–196 (1997)

    Article  MATH  Google Scholar 

  14. Yang, C.N., Chen, T.S.: Colored visual cryptography scheme based on additive color mixing. Pattern Recognition 41, 3114–3129 (2008)

    Article  MATH  Google Scholar 

  15. Cimato, S., Yang, C.N.: Visual cryptography and secret image sharing. CRC Press, Taylor & Francis (2011)

    Google Scholar 

  16. Wang, R.Z.: Region incrementing visual cryptography. IEEE Signal Processing Letters 16, 659–662 (2009)

    Article  Google Scholar 

  17. Shyu, S.J., Jiang, H.W.: Efficient Construction for Region Incrementing Visual Cryptography. IEEE Transactions on Circuits and Systems for Video Technology 22, 769–777 (2012)

    Article  Google Scholar 

  18. Yang, C.N., Shih, H.W., Wu, C.C., Harn, L.: k out of n Region Incrementing Scheme in Visual Cryptography. IEEE Transactions on Circuits and Systems for Video Technology 22, 799–810 (2012)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, CN., Lin, YC., Wu, CC. (2013). Region-in-Region Incrementing Visual Cryptography Scheme. In: Shi, Y.Q., Kim, HJ., Pérez-González, F. (eds) The International Workshop on Digital Forensics and Watermarking 2012. IWDW 2012. Lecture Notes in Computer Science, vol 7809. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40099-5_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40099-5_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40098-8

  • Online ISBN: 978-3-642-40099-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics