Skip to main content
SpringerLink
Log in

Improving the Visual Quality of (2, n) Random Grid Based Visual Secret Sharing Schemes

  • Conference paper
  • First Online:
Proceedings of 3rd International Conference on Advanced Computing, Networking and Informatics

Part of the book series: Smart Innovation, Systems and Technologies ((SIST,volume 44))

  • 898 Accesses

Abstract

Visual secret sharing scheme (VSS) based on the concept of random grid (RG) that suffers from low visual quality of the decrypted secret. In this work a (2, n) RG based VSS has been proposed to improve the contrast. The proposed scheme supports the traditional stacking decryption method. To improve the visual quality further a decryption algorithm is proposed. The experimental result and comparison of visual quality with related methods has shown that the proposed schemes perform well.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Naor, M., Shamir, A.: Visual cryptography, in: Advances in Cryptology EURO—CRYPT’94, Springer, pp. 1–12 (1995)

    Google Scholar 

  2. Blundo, C., De Santis, A.: Visual cryptography schemes with perfect reconstruction of black pixels. Comput. Graphics 22(4), 449–455 (1998)

    Article  Google Scholar 

  3. Koga, H., Ueda, E.: Basic properties of the (t, n)-threshold visual secret sharing scheme with perfect reconstruction of black pixels. Des. Codes Crypt. 40(1), 81–102 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Lin, C.-C., Tsai, W.-H.: Visual cryptography for gray-level images by dithering techniques. Pattern Recogn. Lett. 24(1), 349–358 (2003)

    Article  Google Scholar 

  5. Krause, M., Simon, H.U.: Determining the optimal contrast for secret sharing schemes in visual cryptography. Comb. Probab. Comput. 12(03), 285–299 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. Yang, C.-N., Peng, A.-G., Chen, T.-S.: Mtvss:(m) isalignment (t) olerant (v) isual (s) ecret (s) haring on resolving alignment difficulty. Sig. Process. 89(8), 1602–1624 (2009)

    Article  MATH  Google Scholar 

  7. Kafri, O., Keren, E.: Encryption of pictures and shapes by random grids. Opt. Lett. 12(6), 377–379 (1987)

    Article  Google Scholar 

  8. Shyu, S.J.: Image encryption by random grids. Pattern Recogn. 40(3), 1014–1031 (2007)

    Article  MATH  Google Scholar 

  9. Chen, T.-H., Tsao, K.-H.: Visual secret sharing by random grids revisited. Pattern Recogn. 42(9), 2203–2217 (2009)

    Article  MATH  Google Scholar 

  10. Chen, T.-H., Tsao, K.-H.: Threshold visual secret sharing by random grids. J. Syst. Softw. 84(7), 1197–1208 (2011)

    Article  Google Scholar 

  11. Guo, T., Liu, F., Wu, C.: Threshold visual secret sharing by random grids with improved contrast. J. Syst. Softw. 86(8), 2094–2109 (1996)

    Article  Google Scholar 

  12. Ateniese, G., Blundo, C., De Santis, A., Stinson, D.R.: Visual cryptography for general access structures. Inf. Comput. 129(2), 86–106 (1999)

    Article  Google Scholar 

  13. Kuwakado, H., Tanaka, H.: Image size invariant visual cryptography. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 82(10), 2172–2177 (1999)

    Google Scholar 

  14. Yang, C.-N., Laih, C.-S.: New colored visual secret sharing schemes. Des. Codes Crypt. 20(3), 325–336 (2000)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  16. Sullivan, J., Miller, R., Pios, G.: Image halftoning using a visual model in error di_usion. JOSA A 10(8), 1714–1723 (1993)

    Article  Google Scholar 

  17. Ulichney, R.A.: Review of halftoning techniques. In: Electronic Imaging, International Society for Optics and Photonics, pp. 378–391 (1999)

    Google Scholar 

  18. Chen, T.-H., Lee, Y.-S., Huang, W.-L., Juan, J.S.-T., Chen, Y.-Y., Li, M.-J.: Quality adaptive visual secret sharing by random grids. J. Syst. Softw. 86(5), 1267–1274 (2013)

    Article  Google Scholar 

  19. Chen, S.-K., Lin, S.-J.: Optimal (2, n) and (2, infinity) visual secret sharing by generalized random grids. J. Vis. Commun. Image Represent. 23(4), 677–684 (2012)

    Article  Google Scholar 

  20. Wu, X., Sun, W.: Improving the visual quality of random grid-based visual secret sharing. Sig. Process. 93(5), 977–995 (2013)

    Article  Google Scholar 

  21. Wu, X., Sun, W.: Random grid-based visual secret sharing with abilities of or and xor decryptions. J. Vis. Commun. Image Represent. 24(1), 48–62 (2013)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Development and Research in Banking Technology, Hyderabad, 500057, India

    Lingaraj Meher

  2. School of Computer and Information Sciences, University of Hyderabad, Hyderabad, 500046, India

    Munaga V. N. K. Prasad

Authors
  1. Lingaraj Meher
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Munaga V. N. K. Prasad
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lingaraj Meher .

Editor information

Editors and Affiliations

  1. Department of Computer Science, Liverpool Hope University, Liverpool, United Kingdom

    Atulya Nagar

  2. Department of Computer Science and Engineering, National Institute of Technology Rourkela, Rourkela, India

    Durga Prasad Mohapatra

  3. Computer Science & Engineering, University of Calcutta, Kolkata, West Bengal, India

    Nabendu Chaki

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer India

About this paper

Cite this paper

Meher, L., Prasad, M.V.N.K. (2016). Improving the Visual Quality of (2, n) Random Grid Based Visual Secret Sharing Schemes. In: Nagar, A., Mohapatra, D., Chaki, N. (eds) Proceedings of 3rd International Conference on Advanced Computing, Networking and Informatics. Smart Innovation, Systems and Technologies, vol 44. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2529-4_28

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-2529-4_28

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-2528-7

  • Online ISBN: 978-81-322-2529-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation