Skip to main content

New Aspect Ratio Invariant Visual Secret Sharing Schemes Using Square Block-Wise Operation

  • Conference paper
Image Analysis and Recognition (ICIAR 2005)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 3656))

Included in the following conference series:

Abstract

An aspect ratio invariant visual secret sharing (ARIVSS) scheme is a perfectly secure method for sharing secret images, by expanding a secret pixel to m sub pixels in shadow images, with m being the pixel expansion; meantime the aspect ratio of the recovered secret image is fixed. The advantage of ARIVSS is that there is no loss of information when the shape of the secret image is our information; for example, a secret image of a circle is compromised to an ellipse, if m does not have a square value. Two ARIVSS schemes, based on processing one and four pixel blocks, respectively, were previously proposed. In this paper, we have generalized the square block-wise approach, to further reduce pixel expansion.

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

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. Yang, C.N., Chen, T.-S.: Aspect ratio invariant visual secret sharing schemes with minimum pixel expansion. Pattern Recognition Letters 26(2), 193–206 (2005)

    Article  Google Scholar 

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

    Article  Google Scholar 

  4. Ito, R., Kuwakado, H., Tanaka, H.: Image size invariant visual cryptography. IEICE Trans. Fundamentals E82-A(10), 2172–2177 (1999)

    Google Scholar 

  5. Lukac, R., Plataniotis, K.N.: Bit-Level based secret sharing for image encryption. Pattern Recognition 38(5), 767–772 (2005)

    Article  MATH  Google Scholar 

  6. Lukac, R., Plataniotis, K.N.: Image Representation Based Secret Sharing. Communications of the CCISA (Chinese Cryptology & Information Security Association), Special Issue on Image Secret Sharing and Quantum Cryptography 11(2), 103–114 (2005)

    Google Scholar 

  7. Lukac, R., Plataniotis, K.N.: Colour Image Secret Sharing. IEE Electronics Letters 40(9), 529–530 (2004)

    Article  Google Scholar 

  8. Kim, C.H., Seong, S.M., Lee, J.A., Kim, L.S.: Winscale: an image-scaling algorithm using an area pixel model. IEEE Trans. on Circuits and Systems for Video Technology 13(6), 549–553 (2003)

    Article  Google Scholar 

  9. Gonzalez, R.C., Woods, R.E.: Digital Image Processing, 2nd edn. International Edition. Prentice Hall, Englewood Cliffs (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, CN., Chen, TS. (2005). New Aspect Ratio Invariant Visual Secret Sharing Schemes Using Square Block-Wise Operation. In: Kamel, M., Campilho, A. (eds) Image Analysis and Recognition. ICIAR 2005. Lecture Notes in Computer Science, vol 3656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11559573_141

Download citation

  • DOI: https://doi.org/10.1007/11559573_141

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29069-8

  • Online ISBN: 978-3-540-31938-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics