Skip to main content
SpringerLink
Log in

Meaningful visual secret sharing based on error diffusion and random grids

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

Random grid (RG) is an efficient method of eliminating the drawback of pixel expansion problem in visual secret sharing (VSS). Error diffusion (ED) technique is a brilliant method that improves the diffusion performance in an image by reducing the pattern noise and removing boundary and ’blackhole’ effects. In this paper, a novel meaningful RG-ED-based VSS, which encodes the (k, n) threshold into meaningful shadow images, is proposed at the price of not-clear recovered images. In addition, the novel scheme realizes the (k, n) threshold, avoids the design of complex codebook and averts the pixel expansion problem. Furthermore, the proposed RG-ED-based VSS inherits conventional benefits of VSS without the need of cryptographic efforts to decode the secret. Compared with other schemes reported in the literature, the present scheme has the benefits mentioned above, at the price of possible degrading of recovered images’ quality.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  1. Ateniese G, Blundo C, Santis AD, Stinson DR (2001) Extended capabilities for visual cryptography. Theor Comput Sci 250(1):143–161

    Article  MathSciNet  MATH  Google Scholar 

  2. Chao K-Y, Lin J-C (2009) Secret image sharing: a Boolean-operations-based approach combining benefits of polynomial-based and fast approaches. Int J Pattern Recogn Artif Intell 23(02):263–285

    Article  Google Scholar 

  3. Chen TH, Tsao KH (2008) Image encryption by (n, n) random grids, Proceedings of 18th Information Security Conference. Hualien

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

    Article  MATH  Google Scholar 

  5. Chen TH, Tsao KH (2011) User-friendly random-grid-based visual secret sharing. IEEE Trans Circ Syst Video Tech 21(11):1693–1703

    Article  Google Scholar 

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

    Article  Google Scholar 

  7. Chen T-H, Tsao K-H, Yang Y-T (2009) Friendly color visual secret sharing by random grids. Fundamenta Inform 96(1):61–70

    MathSciNet  Google Scholar 

  8. Dong L, Wang D, Li S, Dai Y (2012) (2, n) secret sharing scheme for gray and color images based on Boolean operation. Sci China Inf Sci 55(5):1151–1161

    Article  MathSciNet  MATH  Google Scholar 

  9. Floyd R W (1976) An adaptive algorithm for spatial gray-scale. Proc Soc Inf Disp 17:75–77

    MathSciNet  Google Scholar 

  10. Gonzalez R C, Richard E W (2002) Digital image processing. Prentice Hall Press. ISBN 0-201-18075-8

  11. Hou Y-C, Quan Z-Y (2011) Progressive visual cryptography with unexpanded shares. IEEE Trans Circ Syst Video Tech 21(11):1760–1764

    Article  Google Scholar 

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

    Article  Google Scholar 

  13. Kang I, Arce GR, Lee H-K (2011) Heung-Kyu,Color extended visual cryptography using error diffusion. IEEE Trans Image Process 20(1):132–145

    Article  MathSciNet  Google Scholar 

  14. Lau DL, Arce GR (2011) Modern digital halftoning. CRC Press

  15. Myodo E, Sakazawa S, higeyuki T (2006) IEEE International Conference on Image Processing, pp 97–100

  16. Myodo E, Takagi K, Miyaji S, Takishima Y (2007) IEEE International Conference on Multimedia and Expo, pp 2114–2117

  17. Naor M, Shamir A (1995) Advances in Cryptology EUROCRYPT’94. Springer, pp 1–12

  18. Otsu Nobuyuki (1975) A threshold selection method from gray-level histograms. Automatica 11(23–27):285–296

    Google Scholar 

  19. Shyu S J (2009) Image encryption by multiple random grids. Pattern Recogn 42:1582–1596

    Article  MATH  Google Scholar 

  20. Shyu SJ (2007) Image encryption by random grids. Pattern Recogn 40(3):1014–1031

    Article  MATH  Google Scholar 

  21. Tsai DS, Chen T, Horng G (2008) On generating meaningful shares in visual secret sharing scheme. Imaging Sci J 56:49–55

    Article  Google Scholar 

  22. Wang Z, Arce GR (2006) IEEE International Conference on Image Processing, pp 109–112

  23. Weir J, Yan W (2010) A comprehensive study of visual cryptography. Springer, pp 70–105

  24. Wang D, Zhang L, Ma N, Li X (2007) Two secret sharing schemese based on Boolean operations. PatternRecognit 40(10):2776–2785

    MATH  Google Scholar 

  25. Wang Z, Arce GR, Di Crescenzo G (2009) Halftone visual cryptography via error diffusion. IEEE Trans Inf Forensics Security 4(3):383–396

    Article  Google Scholar 

  26. Wu H-C, Chang C-C (2005) Sharing visual multi-secrets using circle shares. Comput Stand Interfaces 28(1):123–135

    Article  Google Scholar 

  27. Wu X, Sun W (2011) Image sharing scheme based on error diffusion. J Comput Appl 31(1):74–81

    Google Scholar 

  28. Wu X, Sun W (2012) Random grid-based visual secret sharing with abilities of OR and XOR decryptions. J Vis Commun Image R

  29. Yan X, Wang S, Li L, El-Latif AAA, Wei Z, Niu X (2013) A New Assessment Measure of Shadow Image Quality Based on Error Diffusion Techniques. J Inf Hiding Multimed Signal Process (JIHMSP) 4(2):118–126

    Google Scholar 

  30. Yip Shu-Kei, Au OO, Wong H-M, et al. (2005) PI-preserve data hiding for halftone image. Proceedings of 2005 international symposium on IEEE Intelligent Signal Processing and Communication Systems, ISPACS 2005, pp 125–128

  31. Yi F, Wang D, Li S, Dai Y (2008) Probabilistic visual cryptography scheme with reversing. J Tsinghua Univ Sci Tech 1:121–123

    Google Scholar 

  32. Yang C-N (2004) New visual secret sharing schemes using probabilistic method. Pattern Recognit Lett 25(4):481–494

    Article  Google Scholar 

  33. Zhou Z, Arce GR, Di Crescenzo G (2006) Halftone visual cryptography. IEEE Trans Image Process 15(8):2441–2453

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Harbin Institute of Technology, Harbin, China

    Shen Wang, Xuehu Yan, Jianzhi Sang & Xiamu Niu

Authors
  1. Shen Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xuehu Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jianzhi Sang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xiamu Niu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shen Wang.

Additional information

This work is supported by the National Natural Science Foundation of China (61301099, 61100187, 11201100)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, S., Yan, X., Sang, J. et al. Meaningful visual secret sharing based on error diffusion and random grids. Multimed Tools Appl 75, 3353–3373 (2016). https://doi.org/10.1007/s11042-014-2438-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-014-2438-8

Keywords

Search

Navigation