Skip to main content

Essential Visual Cryptographic Scheme with Different Importance of Shares

  • Conference paper
Neural Information Processing (ICONIP 2014)

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

Included in the following conference series:

Abstract

Essential secret image sharing scheme allows some participants own special privileges with different importance of shares. The beauty of visual cryptographic scheme (VCS) is that its decoding is based on stacking and human visual system (HVS) without cryptographic computation. In this paper, for the first time essential and non-essential VCS (ENVCS) is introduced based on pre-existed (k,n) VCS. In the proposed (k 0,n 0,k,n) ENVCS, we generate the secret image into n shares which are classified into n 0 essential shares and nā€‰āˆ’ā€‰n 0 non-essential shares. In the decoding phase, in order to reveal secret we should collect at least k shares, among which there are at least k 0 essential shares. Experiments are conducted to evaluate the security and efficiency of the proposed scheme.

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. Shamir, A.: How to share a secret. Communications of the ACMĀ 22(11), 612ā€“613 (1979)

    ArticleĀ  MathSciNetĀ  MATHĀ  Google ScholarĀ 

  2. Thien, C.C., Lin, J.C.: Secret image sharing. Computers & GraphicsĀ 26(5), 765ā€“770 (2002)

    ArticleĀ  Google ScholarĀ 

  3. Lin, S.J., Lin, J.C.: Vcpss: A two-in-one two-decoding-options image sharing method combining visual cryptography (vc) and polynomial-style sharing (pss) approaches. Pattern RecognitionĀ 40(12), 3652ā€“3666 (2007)

    ArticleĀ  MATHĀ  Google ScholarĀ 

  4. Yang, C.N., Ciou, C.B.: Image secret sharing method with two-decoding-options: Lossless recovery and previewing capability. Image and Vision ComputingĀ 28(12), 1600ā€“1610 (2010)

    ArticleĀ  Google ScholarĀ 

  5. Li, P., Yang, C.N., Wu, C.C., Kong, Q., Ma, Y.: Essential secret image sharing scheme with different importance of shadows. Journal of Visual Communication and Image RepresentationĀ 24(7), 1106ā€“1114 (2013)

    ArticleĀ  Google ScholarĀ 

  6. Wang, Z., Arce, G.R., Di Crescenzo, G.: Halftone visual cryptography via error diffusion. IEEE Trans. Inf. Forensics SecurityĀ 4(3), 383ā€“396 (2009)

    ArticleĀ  Google ScholarĀ 

  7. 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Ā 

  8. Yan, X., Wang, S., Niu, X.: Threshold construction from specific cases in visual cryptography without the pixel expansion. Signal Processing (2014), doi:10.1016/j.sigpro.2014.06.011

    Google ScholarĀ 

  9. Weir, J., Yan, W.: A comprehensive study of visual cryptography. In: Shi, Y.Q. (ed.) Transactions on DHMS V. LNCS, vol.Ā 6010, pp. 70ā€“105. Springer, Heidelberg (2010)

    ChapterĀ  Google ScholarĀ 

  10. Kuwakado, H., Tanaka, H.: Image size invariant visual cryptography. IEICE Transactions on Fundamentals of Electronics, Communications and Computer SciencesĀ 82(10), 2172ā€“2177 (1999)

    Google ScholarĀ 

  11. Yang, C.N.: New visual secret sharing schemes using probabilistic method. Pattern Recognit. Lett.Ā 25(4), 481ā€“494 (2004)

    ArticleĀ  Google ScholarĀ 

  12. Cimato, S., De Prisco, R., De Santis, A.: Probabilistic visual cryptography schemes. The Computer JournalĀ 49(1), 97ā€“107 (2006)

    ArticleĀ  Google ScholarĀ 

  13. Kafri, O., Keren, E.: Encryption of pictures and shapes by random grids. Optics LettersĀ 12(6), 377ā€“379 (1987)

    ArticleĀ  Google ScholarĀ 

  14. Wu, X., Sun, W.: Improving the visual quality of random grid-based visual secret sharing. Signal ProcessingĀ 93(5), 977ā€“995 (2013)

    ArticleĀ  Google ScholarĀ 

  15. Guo, T., Liu, F., Wu, C.: Threshold visual secret sharing by random grids with improved contrast. Journal of Systems and SoftwareĀ 86(8), 2094ā€“2109 (2013)

    ArticleĀ  Google ScholarĀ 

  16. Shyu, S.J.: Image encryption by random grids. Pattern RecognitionĀ 40(3), 1014ā€“1031 (2007)

    ArticleĀ  MATHĀ  Google ScholarĀ 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

Ā© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Yan, X., Wang, S., Niu, X., Yang, CN. (2014). Essential Visual Cryptographic Scheme with Different Importance of Shares. In: Loo, C.K., Yap, K.S., Wong, K.W., Beng Jin, A.T., Huang, K. (eds) Neural Information Processing. ICONIP 2014. Lecture Notes in Computer Science, vol 8836. Springer, Cham. https://doi.org/10.1007/978-3-319-12643-2_77

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-12643-2_77

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-12642-5

  • Online ISBN: 978-3-319-12643-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics