Skip to main content
SpringerLink
Log in

New Size-Reduced Visual Secret Sharing Schemes with Half Reduction of Shadow Size

  • Conference paper
Computational Science and Its Applications – ICCSA 2005 (ICCSA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3480))

Included in the following conference series:

Abstract

Visual Secret Sharing (VSS) scheme proposed by Naor and Shamir is a perfect secure scheme to share the secret image. By using m subpixels to represent one pixel, the secret image is divided into several shadow images whose size is m times than the secret image. The value of m is known as the pixel expansion. In this paper, we propose the new size-reduced VSS schemes and dramatically decrease the pixel expansion to a half and meantime the contrast is not compromised.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.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. Ateniese, G., Blundo, C., De Santis, A., Stinson, D.R.: Visual cryptography for general access structures. In: ECCC, Electronic Colloquium on Computational Complexity, TR96- 012 (1996)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  4. Eisen, P.A., Stinson, D.R.: Threshold visual cryptography schemes with specified whiteness. Designs, Codes and Cryptography 25(1), 15–61 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  5. Lukac, R., Plataniotis, K.N.: Colour image secret sharing. IEE Electronics Letters 40(9), 529–530 (2004)

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  7. Lukac, R., Plataniotis, K.N.: A color image secret sharing scheme satisfying the perfect reconstruction property. In: Proceedings of MMS 2004, Italy, September 29 - October 1, pp. 351–354 (2004)

    Google Scholar 

  8. Kuwakado, H., Tanaka, H.: Size-Reduced Visual Secret Sharing Scheme. IEICE trans. Fundamentals E87-A(5), 1193–1197 (2004)

    Google Scholar 

  9. Ulichney, R.: Digital Halftoning. MIT Press, Cambridge (1987)

    Google Scholar 

  10. Zhang, Y.: Space-filling curve ordered dither. Computers and Graphics 22(4), 559–563 (1998)

    Article  Google Scholar 

  11. Lin, C.C., Tsai, W.H.: Visual cryptography for gray-level images by dithering techniques. Pattern Recognition Letters 24, 349–358 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Dong Hwa University, #1, Da Hsueh Rd, Sec. 2, Hualien, 974-01, Taiwan

    Ching-Nung Yang & Tse-Shih Chen

Authors
  1. Ching-Nung Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tse-Shih Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W, T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, P.O. Box, I-06123, Perugia, Italy

    Antonio Laganà

  5. Institute of High Performance Computing, IHCP, 1 Science Park Road, 01-01 The Capricorn, Singapore Science Park II, 117528, Singapore

    Heow Pueh Lee

  6. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  7. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  8. OptimaNumerics Ltd, P.O. Box, Belfast, United Kingdom

    Chih Jeng Kenneth Tan

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 Size-Reduced Visual Secret Sharing Schemes with Half Reduction of Shadow Size. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424758_3

Download citation

  • DOI: https://doi.org/10.1007/11424758_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25860-5

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation