Skip to main content
SpringerLink
Log in

Threshold progressive visual cryptography construction with unexpanded shares

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

Abstract

Differently from traditional secret sharing, progressive secret sharing can gain clearer recovered secret image with more shares. However, previous progressive visual secret sharing (PVSS) schemes with unexpanded shares are only for case (2, n) other than general threshold (case), which will restrict the application range. In this paper, a general threshold PVSS construction method from case (2, n) with unexpanded shares is proposed. It has the feature of (k, n) threshold with no pixel expansion, which could be loss-tolerant and control access for a wider application. Based on the proposed construction method, a new threshold PVSS scheme is constructed. Compared with relative approaches, the proposed scheme has improved performances.

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

Similar content being viewed by others

References

  1. Chen S-K (2009) Friendly progressive visual secret sharing using generalized random grids. Optical Eng 48(11):117001-1–117001-7

    Article  Google Scholar 

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

    Article  Google Scholar 

  3. Chen T-H et al (2013) Quality-adaptive visual secret sharing by random grids. J Syst Softw 86(5):1267–1274

    Article  Google Scholar 

  4. Fang W-P, Lin J-C (2006) Progressive viewing and sharing of sensitive images. Pattern Recog Image Analysis 16(4):632–636

    Article  Google Scholar 

  5. Guo T, Liu F, Wu CK (2013) Threshold visual secret sharing by random grids with improved contrast. J Syst Software 86(8):2094–2109

    Article  Google Scholar 

  6. Hou Y-C (2003) Visual cryptography for color images. Pattern Recogn 36(7):1619–1629

    Article  Google Scholar 

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

    Article  Google Scholar 

  8. Hou Y-C, Quan Z-Y, Tsai C-F (2013) Block-based progressive visual secret sharing. Inf Sci 233:290–304

    Article  Google Scholar 

  9. Jin D, Yan W-Q, Mohan S (2005) Kankanhalli, Progressive color visual cryptography. SPIE J Electron Imaging 14(3)

  10. Naor, Moni, and Adi Shamir (1995) Visual cryptography, in Advances in Cryptography, Eurocrypt'94, pp. 1–12

  11. Shyu SJ (2007) Image encryption by random grids. Patt Recog 40.3:1014–1031

    Article  MATH  Google Scholar 

  12. Shyu SJ (2009) Image encryption by multiple random grids. Patt Recog 42:1582–1596

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  14. Wang D, Zhanga L, Ma N, Li X (2007) Two secret sharing schemes based on Boolean operations [J]. Pattern Recogn 40(10):2776–2785

    Article  MATH  Google Scholar 

  15. Weir J, Yan WQ (2010) A comprehensive study of visual cryptography, Transactions on DHMS V. LNCS 6010:70–105

    Google Scholar 

  16. Wu X (2013) Wei Sun, Random grid-based visual secret sharing with abilities of OR and XOR decryptions. J Vis Commun Image R 24:48–62

    Article  Google Scholar 

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

    Article  Google Scholar 

  18. Yan X, Shen W, Abd El-Latif AA, Niu X (2014) A novel perceptual secret sharing scheme. Trans Data Hiding Multimedia Secur IX Lect Notes Comp Sci 8363:68–90

    Article  MATH  Google Scholar 

  19. Yan X, Wang S, El-Latif AAA et al. (2013) Visual secret sharing based on random grids with abilities of AND and XOR lossless recovery[J]. Multimedia Tools and Applications :1–22

  20. Yang C-N (2004) New visual secret sharing schemes using probabilistic method [J]. Pattern Recogn Lett 25(4):481–494

    Article  Google Scholar 

Download references

Acknowledgement

The authors would like to thank the anonymous reviewers for their valuable discussions and comments. This work is supported by the National Natural Science Foundation of China (Grant Number: 61100187, 61301099, 61361166006).

Author information

Authors and Affiliations

  1. Electronic Engineering Institute, 230000, Hefei, China

    Xuehu Yan

  2. School of Computer Science and Technology, Harbin Institute of Technology, 150001, Harbin, China

    Xuehu Yan, Shen Wang & Xiamu Niu

Authors
  1. Xuehu Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shen Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiamu Niu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Xuehu Yan or Shen Wang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yan, X., Wang, S. & Niu, X. Threshold progressive visual cryptography construction with unexpanded shares. Multimed Tools Appl 75, 8657–8674 (2016). https://doi.org/10.1007/s11042-015-2779-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-015-2779-y

Keywords

Search

Navigation