Multi secret sharing with unexpanded meaningful shares

Article

Abstract

Traditional Visual Cryptography (VC) facilitates a technique to protect only one secret image using single set of shares. Recent researches enhance the capabilities of traditional VC by providing the feature of Multi Secret Sharing (MSS), where more than one secret image can be protected at a time. In MSS different secret images are revealed by the stacking of same set of shares at different angles. Most of the existing state of art researches on MSS have common problem of pixel expansion and random pattern of the shares. Due to pixel expansion, there is wastage of the storage space and transmission time, moreover random pattern of the shares increases the vulnerability for cryptanalysis. In this paper a novel Multi Secret Sharing scheme with unexpanded as well as meaningful shares has been proposed to protect two secret images at a time. In the proposed approach the recovery probability of black pixels of the secret images in the decoded images is always 1 while that of white pixels, it is 0.25. Therefore the contrast of the decoded images is obtained as 25 % which is same as in most of the earlier researches with pixel expansion & random shares. Experiments confirm that all meaningful shares fulfill the contrast and security conditions. Secret images can be easily decoded by only human visual system without any computation at receiver end.

Keywords

Visual cryptography Multi secret sharing Meaningful share Unexpanded share 

References

  1. 1.
    Ateniese G, Blundo C, De Santis A, Stinson DR (1996) Visual cryptography for general access structures. Inf Comput 129(2):86–106MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Ateniese G, Blundo C, De Santis A, Stinson DR (2001) Extended capabilities for visual cryptography. In: Theor. comput. sci., vol 250, pp 143–161Google Scholar
  3. 3.
    Feng JB, Wu HC, Tsai CS, Chang YF, Chu YP (2008) Visual secret sharing for multiple secrets. Pattern Recogn 41:3572–3581CrossRefMATHGoogle Scholar
  4. 4.
    Fu MS, Au OC (2004) Joint visual cryptography and watermarking. In: Proc. IEEE Int. conf. multimedia and expo. TaipeiGoogle Scholar
  5. 5.
    Gu B, Sheng VS (2016) A robust regularization path algorithm for -support vector classification. IEEE Trans Neural Netw Learn SystGoogle Scholar
  6. 6.
    Haiping L (2004) Distance-reciprocal distortion measure for binary document images. IEEE Signal Process Lett 11(2)Google Scholar
  7. 7.
    Hsu H-C, Chen T-S, Lin Y-H (2004) The ring shadow image technology of visual cryptography by applying diverse rotating angles to hide the secret sharing. In: Proceedings of the IEEE international conference on networking, sensing and control. TaipeiGoogle Scholar
  8. 8.
    Ji S, Yao Z, Ha YY, He WC (2014) Multi-secret sharing visual cryptography scheme based on XOR algorithm. Mach Tool Technol Mechatron Inf Eng 644:2108–2111Google Scholar
  9. 9.
    Liao X, Li K, Yin (2016) Separable data hiding in encrypted image based on compressive sensing and discrete fourier transform. Multimed Tools ApplGoogle Scholar
  10. 10.
    Liaoa X, Shu C (2015) Reversible data hiding in encrypted images based on absolute mean difference of multiple neighboring pixels. J Vis Commun Image Represent 28:21–27CrossRefGoogle Scholar
  11. 11.
    MacPherson LA (2002) Grey level visual cryptography for general access structures. M.S. thesis, University of Waterloo, Ontario, CanadaGoogle Scholar
  12. 12.
    Myodo E, Sakazawa S, Takishima Y (2006) Visual cryptography based on void-and-cluster halftoning technique. In: Proc. IEEE ICIP. AtlantaGoogle Scholar
  13. 13.
    Nakajima M, Yamaguchi Y (2002) Extended visual cryptography for natural images. J WSCG 10(2):303–310Google Scholar
  14. 14.
    Naor M, Shamir A (1995) Visual cryptography. In: Advances in cryptograhy: EUROCRYPT’94, LNCS, vol 950, pp 1–12Google Scholar
  15. 15.
    Naor M, Pinkas B (1997) Visual authentication and identification. In: Crypto97, LNCS, vol 1294, pp 322–340Google Scholar
  16. 16.
    Reddy S, Prasad L, Munaga VNK (2015) Extended visual cryptography scheme for multi-secret sharing. In: 3rd International conference on advanced computing, networking and informatics: ICACNI 2015, vol 2. Springer, pp 249–257Google Scholar
  17. 17.
    Shyu SJ (2007) Image encryption by random grids. Patt Recog 40(3):1014–1031CrossRefMATHGoogle Scholar
  18. 18.
    Shyu SJ, Huang S-Y, Lee Y-K, Wang R-Z, Chen K (2007) Sharing multiple secrets in visual cryptography. Pattern Recogn 40:3633–3651CrossRefMATHGoogle Scholar
  19. 19.
    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–343Google Scholar
  20. 20.
    Wang Z, Bovik AC, Sheikh HR, Simoncelli EP (2004) Image quality assessment: from error visibility to structural similarity. IEEE Trans Image Process 13 (4)Google Scholar
  21. 21.
    Wang Z, Arce GR, Crescenzo GD (2009) Halftone visual cryptography via error diffusion. IEEE Trans Inf Forensics Secur 4(3):383–396CrossRefGoogle Scholar
  22. 22.
    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.Google Scholar
  23. 23.
    Wu H-C, Chang C-C (2005) Sharing visual multi-secrets using circle shares. Comput Stand Interf 134(28):123–135CrossRefGoogle Scholar
  24. 24.
    Yang C-N, Chen T-S (2007) Extended visual secret sharing schemes: improving the shadow image quality. In: Int. J. patt. recogn. artif. intell, vol 21, pp 879Google Scholar
  25. 25.
    Young DP, Ferryman JM (2005) PETS metrics: on-line performance evaluation service. In: Proceedings 2nd Joint IEEE international workshop on VSPETS. BeijingGoogle Scholar
  26. 26.
    Yuhui Z, Byeungwoo J, Danhua X, Wu QMJ, Zhang H (2015) Image segmentation by generalized hierarchical fuzzy C-means algorithm. J Intell Fuzzy Syst 28(2):961–973Google Scholar
  27. 27.
    Zhou Z, Arce GR, Di Crescenzo G (2453) Halftone visual cryptography. IEEE Trans Image Process 15(8):2441CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2017

Authors and Affiliations

  1. 1.Thapar UniversityPatialaIndia

Personalised recommendations