Skip to main content
Log in

Multi-secret visual cryptography with deterministic contrast

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

Abstract

The multi-secret visual cryptography scheme (MVCS) allows for the encryption of multiple secret images into a given image area. The previous works on MVCS with probabilistic contrast can not guarantee that every original pixel will be reconstructed correctly. However, MVCS with deterministic contrast can reconstruct every original pixel with simple computation for high-end applications, but they are all simple 2-out-of-2 cases. These drawbacks limit the applicability of MVCSs existed. Based on ringed shares, MVCS with deterministic contrast has been defined in this paper. Furthermore, an (k, n)-MVCS with deterministic contrast, which makes the number of secret images not restricted, is proposed on the basis of the share rotation algorithm and the basis matrices of single secret sharing visual cryptography. Experimental results show that our scheme is the first (k, n)-MVCS with deterministic contrast, which can be applied on any k and n.

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

Access this article

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

Similar content being viewed by others

References

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

    Article  MATH  Google Scholar 

  2. Blakley GR (1979) Safeguarding cryptographic keys. In Proc. National Comput. Conf. pp 313–317

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

    Article  MATH  Google Scholar 

  4. Cimato S, DeSantis A, Ferrara AL, Masucci B (2005) Ideal contrast visual cryptography schemes with reversing. Inf Process Lett 93(4):199–206

    Article  MATH  MathSciNet  Google Scholar 

  5. Droste S (1996) New results on visual cryptography. Proc Adv Cryptogr LNCS 1109:401–415

    MathSciNet  Google Scholar 

  6. Feng JB, Wu HC, Tsai CS, Chang YF, Chu YP (2008) Visual secret sharing for multiple secrets. Pattern Recognit 41(12):3572–3581

    Article  MATH  Google Scholar 

  7. Fu ZX, Yu B, Fang LG (2010) The multi-secret visual cryptography based on ring shares. J Electron Inf Technol 32(4):880–883

    Article  Google Scholar 

  8. Hofmeister T, Krause M, Simon HU (2000) Contrast-optimal k out of n secret sharing schemes in visual cryptography. Theor Comput Sci 240(2):471–485

    Article  MATH  MathSciNet  Google Scholar 

  9. Hou YC (2003) Visual cryptography for color images. Pattern Recognit 36(7):1619–1629

    Article  Google Scholar 

  10. Hsu HC, Chen TS, Lin YH (2004) The ring shadow image technology of visual cryptography by applying diverse rotating angles to hide the secret sharing. In Proceedings of the 2004 IEEE International Conference on Networking, Sensing & Control, pp 996–1001

  11. Lee KH, Chiu PL (2010) A high contrast and capacity efficient visual cryptography scheme for the encryption of multiple secret images. Opt Commun 284(12):2730–2741

    Article  Google Scholar 

  12. Lin SJ, Chen SK, Lin JC (2010) Flip visual cryptography (FVC) with perfect security, conditionally-optimal contrast and no expansion. J Vis Commun Image Represent 21(8):900–916

    Article  Google Scholar 

  13. Liu F, Wu CK, Lin XJ (2008) Color visual cryptography schemes. IET Inf Secur 2(4):151–165

    Article  Google Scholar 

  14. MacPherson LA (2002) Grey level visual cryptography for general access structures. Master Thesis, University of Waterloo, Waterloo, ON, Canada

  15. Naor M, Shamir A (1995) Visual cryptography. Proc EUROCRYPT 94:1–12

    MathSciNet  Google Scholar 

  16. Shamir A (1979) How to share a secret. Commun ACM 22(11):612–613

    Article  MATH  MathSciNet  Google Scholar 

  17. Shyu SJ, Chen MC (2011) Optimum pixel expansions for threshold visual secret sharing schemes. IEEE Trans Inf Forensics Secur 6(3):960–969

    Article  Google Scholar 

  18. Shyu SJ, Chen K (2011) Visual multiple secret sharing based upon turning and flipping. Inform Sci 181(15):3246–3266

    Article  MATH  MathSciNet  Google Scholar 

  19. Shyu SJ, Huang SY, Lee YK, Wang RZ, Chen K (2007) Sharing multiple secrets in visual cryptography. Pattern Recognit 40(12):3633–3651

    Article  MATH  Google Scholar 

  20. Wu HC, Chang CC (2005) Sharing visual multi-secrets using circle shares. Comput Stand Interfaces 134(28):123–135

    Article  Google Scholar 

  21. Wu CC, Chen LH (1998) A study on visual cryptography, Master Thesis. PhD thesis, Institute of Computer and Information Science, National Chiao Tung University, Taiwan, R.O.C

  22. Yang CN (2004) New visual secret sharing schemes using probabilistic method. Pattern Recogn Lett 25(4):481–494

    Article  Google Scholar 

  23. Yang CN, Chung TH (2010) A general multi-secret visual cryptography scheme. Opt Commun 283(24):4949–4962

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gang Shen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yu, B., Shen, G. Multi-secret visual cryptography with deterministic contrast. Multimed Tools Appl 72, 1867–1886 (2014). https://doi.org/10.1007/s11042-013-1479-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-013-1479-8

Keywords

Navigation