Skip to main content
Log in

Threshold changeable secret image sharing scheme based on interpolation polynomial

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

Abstract

In previous (k,n) secret image sharing scheme, the threshold k is decided by dealer according to the security requirement, and this threshold value is fixed without considering the dynamic secure environment in future. In this work, we propose a novel threshold changeable secret image sharing scheme where the threshold value can be changed according to the changeable security requirement. In our scheme, each participant only needs to keep one initial shadow. When reconstructing image, the dealer decides the threshold according to security level. If the threshold is unchanged, any k or more initial shadows can recover the image; else if the threshold is increased or decreased, dealer publishes additional information, each participant update their shadows accordingly such that the threshold of updated shadows is changed correspondingly. The contribution of our work is that the threshold of shadows can be changed flexibly to satisfy the dynamic secure environment, and each participant only need to keep one initial shadows. The feature of threshold changeable makes our scheme more practical than previous secret image sharing in some complicated applications.

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

Similar content being viewed by others

References

  1. Blundo C, Cresti A, Santis A, Vaccaro U (1994) Fully dynamic secret sharing schemes. In: Advances in cryptology CRYPTO’92: proceedings of the 13th annual international cryptology conference, London, pp 110–125

  2. Chao H, Fan TY (2017) Random-grid based progressive visual secret sharing scheme with adaptive priority. Digital Signal Process 68:69–80

    Article  Google Scholar 

  3. Chao K, Lin JC (2009) Secret image sharing: a Boolean-operations-based approach combining benefits of polynomial-based and fast Approaches. Int J Pattern Recognit Artif Intell 23:263–285

    Article  Google Scholar 

  4. Gong X, Hu P, Shum K, Sung CW (2018) A Zigzag-Decodable ramp secret sharing scheme. IEEE Trans Inf Forensics Secur 13(8):1906–1916

    Article  Google Scholar 

  5. Harn L, Hsu CF (2015) Dynamic threshold secret reconstruction and its application to the threshold cryptography. Inf Process Lett 115(11):851–857

    Article  MathSciNet  MATH  Google Scholar 

  6. Li P, Yang C, Wu, 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 

  7. Liu Y, Nie L, Han L, Zhang L, Rosenblum DS (2015) Action2activity: recognizing complex activities from sensor data. In: Proceedings of the twenty-fourth international joint conference of artificial intelligence (IJCAI), pp 1617–1623

  8. Liu Y, Nie L, Liu L, Rosenblum DS (2016) From action to activity: Sensor-based activity recognition. Neurocomputing 181:108–115

    Article  Google Scholar 

  9. Liu Y, Yang C, Wu S, Chou YS (2018) Progressive (k,n) secret image sharing schemes based on Boolean operations and covering codes. Signal Process Image Commun 66:77–86

    Article  Google Scholar 

  10. Liu Y, Yang C, Yeh PH (2014) Reducing shadow size in smooth scalable secret image sharing. Security and Communication Networks 7(12):2237–2244

    Article  Google Scholar 

  11. Liu Y, Yang CN (2017) Scalable secret image sharing scheme with essential shadows. Signal Process Image Commun 58:49–55

    Article  Google Scholar 

  12. Naor M, Shamir A (1995) Visual cryptography. Proc Eurocrypt94, LNCS 950:1–12

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  14. Steinfeld R, Pieprzyk J, Wang HX (2006) Lattice-based threshold-changeability for standard crt secret- sharing schemes. Finite Fields Appl 12(4):653–680

    Article  MathSciNet  MATH  Google Scholar 

  15. Steinfeld R, Pieprzyk J, Wang HX (2007) Lattice-based threshold changeability for standard shamir secret-sharing schemes. IEEE Trans Inf Theory 53(7):2542–2559

    Article  MathSciNet  MATH  Google Scholar 

  16. Thien, Lin JC (2002) Secret image sharing. Comput Graph 26(5):765–770

    Article  Google Scholar 

  17. Wang H, Wong DS (2008) On secret reconstruction in secret sharing schemes. IEEE Trans Inf Theory 54(1):473–480

    Article  MathSciNet  MATH  Google Scholar 

  18. Wang R, Shyu SJ (2007) Scalable secret image sharing. Signal Process Image Commun 22(4):363–373

    Article  Google Scholar 

  19. Wang RZ (2009) Region incrementing visual cryptography. IEEE Signal Process Lett 16(8):659–662

    Article  Google Scholar 

  20. Wang Z, Di Y, Li, Chang, Liu H (2016) Progressive secret image sharing scheme using meaningful shadows. Security and Communication Networks 9 (17):4075–4088

    Article  Google Scholar 

  21. Xiao H, Wang H, Wang B (2016) Quantum ramp secret sharing scheme and quantum operations. Int J Theor Phys 55(9):3807–3815

    Article  MathSciNet  MATH  Google Scholar 

  22. Yan X, Wang S, Niu XM (2016) Threshold progressive visual cryptography construction with unexpanded shares. Mutimedia Tools and Applications 75(14):8657–8674

    Article  Google Scholar 

  23. Yang C, Chu YY (2011) A general (k,n) scalable secret image sharing scheme with the smooth scalability. J Syst Softw 84 (10):1726–1733

    Article  Google Scholar 

  24. Yang C, Huang SM (2010) Constructions and properties of k out of n scalable secret image sharing. Opt Commun 283(9):1750–1762

    Article  Google Scholar 

  25. Yang C, Ouyang J, Harn L (2012) Steganography and authentication in image sharing without parity bits. Opt Commun 285(7):1725–1735

    Article  Google Scholar 

  26. Yang C, Shih H, Wu, Harn L (2012) K out of n region incrementing scheme in visual cryptography. IEEE Trans Circuits Syst Video Technol 22(5):799–809

    Article  Google Scholar 

  27. Yuan L, Li M, Guo C, Choo K.-K., Ren Y (2016) Novel threshold changeable secret sharing schemes based on polynomial interpolation. PloS One 11 (10):1–19

    Google Scholar 

  28. Yuan L, Li M, Guo C, Hu W, Luo XJ (2016) Secret image sharing scheme with threshold changeable capability. Math Probl Eng 2016:1–11

    MathSciNet  MATH  Google Scholar 

  29. Zhang Z, Chee Y, Ling S, Liu M, Wang H (2012) Threshold changeable secret sharing schemes revisited. Theor Comput Sci 418:106–115

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The research presented in this paper is supported in part by the China National Natural Science Foundation (No.: 61502384, 61571360, 61872289), Shaanxi Science and Technology Co-ordination and Innovation Project (No.: 2016KTZDGY05-09), and the Innovation Project of Shaanxi Provincial Department of Education (No.: 17JF023). This research was supported in part by Ministry of Science and Technology (MOST), under Grant 107-2221-E-259-007.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yan-Xiao Liu.

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

Liu, YX., Yang, CN., Wu, CM. et al. Threshold changeable secret image sharing scheme based on interpolation polynomial. Multimed Tools Appl 78, 18653–18667 (2019). https://doi.org/10.1007/s11042-019-7205-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-019-7205-4

Keywords

Navigation