Skip to main content
SpringerLink
Log in

Essential secret image sharing approach with same size of meaningful shares

  • 1169: Interdisciplinary Forensics: Government, Academia and Industry Interaction
  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

Essential Secret Image Sharing (ESIS) is a method to decompose a secret image into two groups of shares, where one group is essential and the other group is non-essential. In this method, recovery of secret image is possible only if threshold number of shares along with all essential shares will be present. Existing state of art has some limitations such as different share size, complex computation, random pattern (meaningless) share, explicit codebook requirement, pixel expansion and constraint on image type. These limitations restrict the applications of the secret image sharing. In this paper, a novel approach of generating shares of similar size as that of the secret image has been proposed. The proposed “essential secret image sharing approach with same size of meaningful shares” (ESISMS) scheme produces meaningful shares based on bitwise XORing. This proposed approach resolves all the above stated issues and the advantages and applicability of this approach have been demonstrated by the theoretical analysis and experimental results.

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

Similar content being viewed by others

References

  1. Abd El-Latif AA, Yan X, Li L, Wang N, Peng J-L, Niu X (2013) A new meaningful secret sharing scheme based on random grids, error diffusion and chaotic encryption. Opt Laser Technol 54:389–400

    Article  Google Scholar 

  2. Abdulla AA (2015) Exploiting similarities between secret and cover images for improved embedding efficiency and security in digital steganography, PhD thesis, Department of applied computing, The University of Buckingham, United Kingdom

  3. Chang C, Lin C, Lin C, Chen Y (2008) A novel secret image sharing scheme in color images using small shadow images. Inf Sci 178:2433–2447

    Article  Google Scholar 

  4. Chen SK (2016) Essential secret image sharing with increasable shadows. Opt Eng 55

  5. Chen C-C (2018) Essential secret image sharing scheme with equal-sized shadows generation. J Vis Commun Image Represent 52:143–150

    Article  Google Scholar 

  6. Chen CC, Chen SC (2016) Two-layered structure for optimally essential secret image sharing scheme. J Vis Commun Image R 38:595–601

    Article  Google Scholar 

  7. Hsu HC, Chen TS, Lin YH (2004) The ringed shadow image technology of visual cryptography by applying diverse rotating angles to hide the secret sharing. Networking, Sensing and Control 2:996–1001

    Google Scholar 

  8. Hu Y-X, Liu Y-N (2019) A Progressively essential secret image sharing scheme using hierarchy shadow. J Inform Sec Appl 47:371–376

    Google Scholar 

  9. Hung KH, Chang YJ, Lin JC (2008) Progressive sharing of an image. Opt Eng 47:047006

    Article  Google Scholar 

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

    Article  Google Scholar 

  11. Li P, Yang CN, Wu CC, Kong Q, Ma Y (2013) Essential secret image sharing scheme with different importance of shadows. J Vis Commun Image Represent 24(7):1106–1114

    Article  Google Scholar 

  12. Li P, Yang C-N, Zhou Z (2016) Essential secret image sharing scheme with the same size of shadows. Digital Signal Process 50:51–60

    Article  Google Scholar 

  13. Li Li M, Hossain S, Abd El-Latif AA, Alhamid MF (2019) Distortion less secret image sharing scheme for Internet of Things system. Clust Comput 22(1):2293–2307

    Article  Google Scholar 

  14. Ou D, Sun W, Wu X (2015) Non–expansible XOR–based visual cryptography scheme with meaningful shares. Signal Process, pp 604–621

  15. Sardar Md K, Adhikari A (2020) Essential secret image sharing scheme with small and equal sized shadows. Signal processing: Image Communication

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

    Article  MathSciNet  Google Scholar 

  17. Shannon CE (1951) Prediction and entropy of printed english. Bell Syst Tech J 30(1):50–64

    Article  Google Scholar 

  18. Shyu S (2007) Image encryption by random grids. Pattern Recognit 40:1014–1031

    Article  Google Scholar 

  19. Sridhar S, Sudha GF (2020) Quality improved (k, n) priority based progressive visual secret sharing. Multimedia Tools and Applications

  20. Wu X, Sun W (2013) Random grid based visual secret sharing with abilities of OR and XOR decryptions. J Vis Commun Image R, pp 48–62

  21. Wu Z, Liu Y-N, Wang D, Yang C-N (2019) An efficient essential secret image sharing scheme using derivative polynomial. Symmetry 11:69

    Article  Google Scholar 

  22. Yan X, Wang S, Abd El-Latif AA, Niu X (2013) New approaches for efficient information hiding-based secret image sharing schemes. SIViP 9 (3):499–510

    Article  Google Scholar 

  23. Yan X, Wang S, Niu X, Yang C-N (2014) Essential visual cryptographic scheme with different importance of shares. ICONIP, Part III, LNCS 8836:636–643

    Google Scholar 

  24. Yan X, Wang S, Abd El-Latif AA, Niu X (2014) Threshold visual secret sharing with comprehensive properties based on random grids. Signal image and video processing 9(7)

  25. Yan X, Wang S, Abd El-Latif AA, Niu X (2014) Random grids-based visual secret sharing with improved visual quality via error diffusion. Multimed Tools Appl 74(21):9279–9296

    Article  Google Scholar 

  26. Yan X, Wang S, Abd El-Latif AA, Sang J, Niu X (2014) A novel perceptual secret sharing scheme. Transactions on Data Hiding and Multimedia Security IX, pp 68–90

  27. Yan X, Wang S, Abd El-Latif AA, Niu X (2015) Visual secret sharing based on random grids with abilities of AND and XOR lossless recovery. Multimed Tools Appl 74(9):3231–3252

    Article  Google Scholar 

  28. Yang CN, Li P, Wu CC, Cai SR (2015) Reducing shadow size in essential secret image sharing by conjunctive hierarchical approach. Signal Process Image Commun 31:1–9

    Article  Google Scholar 

Download references

Acknowledgements

The authors would like to thank the anonymous reviewers for their valuable suggestions to improve the quality of this paper.

Author information

Authors and Affiliations

  1. Computer Science and Engineering Department, MNNIT Allahabad, Prayagraj, India

    Mainejar Yadav & Ranvijay Singh

  2. Computer Science and Engineering Department, REC Sonbhadra, Churk, India

    Mainejar Yadav

Authors
  1. Mainejar Yadav
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ranvijay Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mainejar Yadav.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yadav, M., Singh, R. Essential secret image sharing approach with same size of meaningful shares. Multimed Tools Appl 81, 22677–22694 (2022). https://doi.org/10.1007/s11042-021-10625-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-021-10625-5

Keywords

Search

Navigation