Skip to main content

Advertisement

SpringerLink
Log in

Novel basis matrix creation and preprocessing algorithms for friendly progressive visual secret sharing with space-efficient shares

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

Abstract

The traditional k out of n Visual Secret Sharing (VSS) scheme encodes a secret binary image into n shares of random pattern. If the shares are printed onto transparencies, the secret image can be visually revealed only when a subset of k or more transparencies are stacked together otherwise nothing will be revealed. Progressive Visual Secret Sharing (PVSS) also allows the decryption of secret image by stacking of physical transparencies but clarity and contrast of the decoded secret image will be increased progressively with the number of stacked shares. Most of the existing researches on PVSS suffer with the common problems like space-inefficiency(pixel expansion) and noise-like shares. This paper proposes a novel PVSS scheme with four or more number of space-efficient as well as meaningful shares. To achieve this, an efficient preprocessing approach and a basis matrix creation algorithm have also been proposed. This paper also addresses many avoidable encryption limitations like explicit requirement of codebook, restriction on number of shares etc. Experiments show that the contrast of reconstructed secret image is 50% and can be easily decrypted by only human visual system without any cryptographic computation.

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
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17

Similar content being viewed by others

References

  1. Askari N, Heys HM, Moloney CR (2013) An Extended Visual Cryptography Scheme Without Pixel Expansion for Halftone Images. In: 26th Annual IEEE Canadian Conference on Electrical and Computer Engineering (CCECE)

  2. Ateniese G, Blundo C, De Santis A, Stinson DR (1996) Visual cryptography for general access structures. In: Inf. Comput., vol 129, pp 86–106

  3. Ateniese G, Blundo C, De Santis A, Stinson DR (2001) Extended capabilities for visual cryptography. In: Theor. Comput. Sci., vol 250, pp 143–161

  4. Chen SK, Lin JC (2005) Fault-tolerant and progressive transmission of images. In: Patt. Recog., vol 38, pp 2466–2471

  5. Chen TH, Tsao KH (2009) Visual secret sharing by random grids revisited. In: Pattern recognition., vol 42, pp 2203–2217

  6. Chou CL (2002) A watermarking technique based on nonexpansible visual cryptography. Thesis department of information management. National University, Taiwan

    Google Scholar 

  7. Fang WP, Lin JC (2006) Progressive viewing and sharing of sensitive images. In: Patt. Recog. Image Anal., vol 16, pp 638–642

  8. Fang WP (2007) Multilayer progressive secret image sharing. In: Proc. 7th WSEAS, pp 112–116

  9. Fang WP (2008) Friendly progressive visual secret sharing. In: Pattern recognition., vol 41, pp 1410–1414

  10. Fu MS, Au OC (2004) Joint visual cryptography and watermarking. In: Proc. IEEE Int. Conf Multimedia and Expo, Taipei, Taiwan

  11. Haiping L (2004) Distance-Reciprocal Distortion measure for binary document images IEEE signal processing letters, vol 11

  12. Hou Y-C, Quan Z-Y (2011) Progressive visual cryptography with unexpanded shares. In: IEEE Transaction on circuits and system for video technology, vol 21

  13. Hou Y-C, Quan Z-Y, Tsai C-F, Tseng A-Y (2013) Block-based progressive visual secret sharing. In: Elsevier, Information Sciences, vol 233, pp 290–304

  14. Hou Y-C, Wei S-C, Lin C-Y (2014) Random-Grid-Based Visual Cryptography Schemes. In: IEEE Transaction on circuits and system for video technology, vol 24

  15. MacPherson LA (2002) Grey level visual cryptography for general access structures. M.S. thesis. University of Waterloo, Ontario

    Google Scholar 

  16. Myodo E, Sakazawa S, Takishima Y (2006) Visual cryptography based on void-and-cluster halftoning technique. In: Proc. IEEE ICIP, Atlanta, GA

  17. Nakajima M, Yamaguchi Y (2002) Extended visual cryptography for natural images. In: J. WSCG, vol 10, pp 303–310

  18. Naor M, Shamir A (1995) Visual cryptography. In: Advances in Cryptograhy: EUROCRYPT94, LNCS, vol 950, pp 1–12

  19. Naor M, Pinkas B (1997) Visual authentication and identification. In: Crypto97, LNCS, vol 1294, pp 322–340

  20. Shyu SJ (2007) Image encryption by random grids. In: Patt. Recog., vol 40, pp 1014–1031

  21. Thien CC, Lin JC (2002) Secret image sharing. In: Comput. Graphics, vol 26, pp 765 – 77

  22. Ulichney RA (1996) The void-and-cluster method for dither array generation. In: Proc. SPIE, Human Vision, Visual Process., Digital Displays, vol 1913, pp 332–343

  23. Wang Z, Arce GR, Crescenzo GD (2009) Halftone visual cryptography via error diffusion. In: IEEE Trans. Inf. Forensics Security, vol 4, pp 383–396

  24. Wang Z, Bovik AC, Sheikh HR, Simoncelli EP (2004) Image Quality Assessment: From Error Visibility to Structural Similarity. In: IEEE Transactions on Image Processing, vol 13

  25. Young DP, Ferryman JM (2005) PETS Metrics: On-Line Performance Evaluation Service. In: Proceedings 2nd Joint IEEE International Workshop on VSPETS, Beijing, October 15 - 16

  26. Zhou Z, Arce GR, Crescenzo GD (2006) Halftone visual cryptography. In: IEEE Trans. Image process., vol 15, pp 2441–2453

Download references

Author information

Authors and Affiliations

  1. National Institute of Technology Allahabad, Allahabad, India

    Shivendra Shivani & Suneeta Agarwal

Authors
  1. Shivendra Shivani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Suneeta Agarwal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shivendra Shivani.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shivani, S., Agarwal, S. Novel basis matrix creation and preprocessing algorithms for friendly progressive visual secret sharing with space-efficient shares. Multimed Tools Appl 76, 8711–8744 (2017). https://doi.org/10.1007/s11042-016-3484-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-016-3484-1

Keywords

Search

Navigation