[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Efficient collusion resistant multi-secret image sharing

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

Abstract

Multi-secret image sharing techniques (MSS) extend the secret image sharing schemes. The paper reports a novel MSS scheme designed to be collusion resistant. It starts with a brief introduction of the concept thereafter discussing the related works in the domain. Security is an implicit requirement for MSS techniques. There should be no possibility of collusion among the shareholders. No less than k shareholders for (k, n) MSS scheme should be having even a slight view of the secret from their shares, n being the total number of shareholders. The paper reviews and highlights the security issues like possibility of collusion, randomness issues or robustness against tampering attack in the state-of-the-art works. It proposes a new (n, n) MSS scheme in order to rectify the issues. The algorithm encrypts N different secret images to generate N noisy share images. It resolves the existing problems in a secure, and time efficient manner. A range of experiments specifically time complexity, noise, tampering, collusion and histogram analysis are performed for rigorous security analysis. The results, thus obtained indicated that the algorithm is efficient and preserves the security requirements in a much better way than the existing MSS schemes.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

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

Similar content being viewed by others

References

  1. Chakraborty S, Jalal AS (2016) High capacity secret image sharing using multilayer image steganography with primary cover predictive error. IJICT 9(3):337–355

    Article  Google Scholar 

  2. Chao HC, Fan TY (2018) Priority visual secret sharing of random grids for threshold access structures. Multimed Tools Appl 77(10):11867–11882

    Article  Google Scholar 

  3. Chen TH, Wu CS (2011) Efficient multi-secret image sharing based on Boolean operations. Signal Process 91(1):90–97

    Article  Google Scholar 

  4. Chen CC, Wu WJ (2014) A secure Boolean-based multi-secret image sharing scheme. J Syst Softw 92:107–114

    Article  Google Scholar 

  5. Chen Y-F, Chan Y-K, Huang C-C, Tsai M-H, Chu Y-P (2007) A multiple-level visual secret-sharing scheme without image size expansion. Inf Sci 177(21):4696–4710

    Article  MathSciNet  Google Scholar 

  6. Chen CC, Wu WJ, Chen JL (2016) Highly efficient and secure multi-secret image sharing scheme. Multimed Tools Appl 75(12):7113–7128

    Article  Google Scholar 

  7. Chen YC, Hung TH, Hsieh SH, Shiu CW (2019) A new reversible data hiding in encrypted image based on multi-secret sharing and lightweight cryptographic algorithms. IEEE Transactions on Information Forensics and Security 14:3332–3343

    Article  Google Scholar 

  8. Cheng T-F, Chang C-C, Liu L (2017) Secret sharing: using meaningful image shadows based on gray code. Multimed Tools Appl 76(7):9337–9362

    Article  Google Scholar 

  9. Deshmukh M, Nain N, Ahmed M (2017) A novel approach of an (n, n) multi-secret image sharing scheme using additive modulo. Proceedings of International Conference on Computer Vision and Image Processing, Springer, Singapore

    Book  Google Scholar 

  10. Deshmukh M, Nain N, Ahmed M (2018) Efficient and secure multi secret sharing schemes based on boolean XOR and arithmetic modulo. Multimed Tools Appl 77(1):89–107

    Article  Google Scholar 

  11. Duanhao O (2015) Wei sun, Xiaotian Wu, non-expansible XOR-based visual cryptography scheme with meaningful shares. Signal Process 108:604–621

    Article  Google Scholar 

  12. Gallagher AC, Chen T (2008, June). Clothing cosegmentation for recognizing people. In 2008 IEEE conference on computer vision and pattern recognition (pp. 1-8). IEEE.

  13. He J, Lan W, Tang S (2016) A secure image sharing scheme with high quality stego-images based on steganography. Multimed Tools Appl 76:7677–7698

    Article  Google Scholar 

  14. Hou YC, Quan ZY (Nov. 2011) Progressive visual cryptography with unexpanded shares. in IEEE Transactions on Circuits and Systems for Video Technology 21(11):1760–1764

    Article  Google Scholar 

  15. Hou Y-C, Quan Z-Y, Tsai C-F (2015) A privilege-based visual secret sharing model. Journal of Visual Communication and Image Representation, Volume 33:358–367 ISSN 1047-3203

    Article  Google Scholar 

  16. Kabirirad S, Eslami Z (2018) A (t, n)-multi secret image sharing scheme based on Boolean operations. J Vis Commun Image Represent 57:39–47

    Article  Google Scholar 

  17. Kabirirad S, Eslami Z (2019) Improvement of (n, n)-multi-secret image sharing schemes based on Boolean operations. Journal of Information Security and Applications 47:16–27

    Article  Google Scholar 

  18. Kang I, Arce GR, Lee HK (Jan. 2011) Color extended visual cryptography using error diffusion. IEEE Trans Image Process 20(1):132–145

    Article  MathSciNet  Google Scholar 

  19. Kumar S, Sharma RK (2014) Threshold visual secret sharing based on Boolean operations. Security Comm Networks 7:653–664. https://doi.org/10.1002/sec.769

    Article  Google Scholar 

  20. Lee KH, Chiu PL (2011) 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 

  21. Meghrajani YK, Mazumdar HS (2016) Universal share for multisecret image sharing scheme based on Boolean operation. IEEE signal processing letters 23(10):1429–1433

    Article  Google Scholar 

  22. Nag A, Singh JP, Singh AK (2019) An efficient Boolean based multi-secret image sharing scheme. Multimedia tools and applications, 1-25.

  23. Naor and Shamir (1995) Visual cryptography. Proceedings of the Advances in Cryptology-Eurocrypt ‘94,Lecture Notes in Computer Science 950:1–12

    Article  MathSciNet  Google Scholar 

  24. Shivani S (2018) Multi secret sharing with unexpanded meaningful shares. Multimed Tools Appl 77(5):6287–6310

    Article  Google Scholar 

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

    Article  Google Scholar 

  26. Shyu SJ, Jiang HW (May 2012) Efficient construction for region incrementing visual cryptography. IEEE Trans Circuits Syst Video Technol 22(5):769–777

    Article  Google Scholar 

  27. Singh P et al (2017) Secure cloud-based image tampering detection and localization using POB number system. ACM Transactions on Multimedia Computing, Communications, and Applications (TOMM) 13(3):23

    Google Scholar 

  28. Wang R-Z, Chin-Hui S (2006) Secret image sharing with smaller shadow images. Pattern Recogn Lett 27:551–555

    Article  Google Scholar 

  29. Wang D, Zhang L, Ma N, Li X (2007) Two secret sharing schemes based on Boolean operations. Pattern Recog 40(10):2776–2785

    Article  Google Scholar 

  30. Wang DS, Song T, Dong L, Yang CN (Dec. 2013) Optimal contrast grayscale visual cryptography schemes with reversing. IEEE Trans Inf Forensics Security 8(12):2059–2072

    Article  Google Scholar 

  31. Yan X, Wang S, El-Latif AAA, Niu X (2015) Threshold visual secret sharing with comprehensive properties based on random grids. SIViP 9(7):1659–1668

    Article  Google Scholar 

  32. Yan X, Wang S, Niu X (2016) Threshold progressive visual cryptography construction with unexpanded shares. Multimed Tools Appl 75(14):8657–8674

    Article  Google Scholar 

  33. Yan X, Liu X, Yang C-N (2018) An enhanced threshold visual secret sharing based on random grids. J Real-Time Image Proc 14(1):61–73

    Article  Google Scholar 

Download references

Acknowledgements

Contribution of Mr. Pruthvi Anvesh (P.G student at IIIT Allahabad) for his inputs and co-operation in this study is hereby acknowledged and highly encouraged. The work is supported by MHRD GATE junior research fellowship scheme of government of India.

Author information

Authors and Affiliations

  1. Department of Information Technology, Indian Institute of Information Technology, Allahabad, Prayagraj, India

    Kapil Mishra, Sannihith Kavala, Satish Kr. Singh & P. Nagabhushan

Authors
  1. Kapil Mishra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sannihith Kavala
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Satish Kr. Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. P. Nagabhushan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kapil Mishra.

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

Mishra, K., Kavala, S., Singh, S.K. et al. Efficient collusion resistant multi-secret image sharing. Multimed Tools Appl 79, 33233–33252 (2020). https://doi.org/10.1007/s11042-020-09619-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-020-09619-6

Keywords

Search

Navigation