Advertisement

A Lossless Polynomial-Based Secret Image Sharing Scheme Utilizing the Filtering Operation

  • Lintao LiuEmail author
  • Yuliang Lu
  • Xuehu Yan
  • Wanmeng Ding
  • Qitian Xuan
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 895)

Abstract

As a basic method, Shamir’s polynomial-based secret sharing (PSS) is utilized to achieve polynomial-based secret image sharing schemes (PSISSs) with other better performances, such as meaningful shares, two-in-one property and et al. Since the modulus of the sharing polynomial must be a prime, e.g., 251 for PSISSs, Shamir’s PSS cannot deal with pixel values more than 250 well. On account of the importance of precise recovery in the image encryption field, there exist several solutions to achieve precise recovery for PSISSs, which have natural drawbacks, such as large computational costs, random shape changes and extra division for sharing. In this paper, we utilize a simple filtering operation to achieve the proposed lossless PSISS, namely LPSISS, without any side effects. We choose 257 rather than 251 as the sharing modulus, and filter sets of shared values to abandon sets with pixel value more than 255. This solution to lossless recovery is simple but effective, which is valuable as a basic technique to achieve better performances. Experimental results are conducted to prove the effectiveness of the proposed scheme.

Keywords

Secret image sharing Polynomial-based secret sharing Filtering Precise recovery 

Notes

Acknowledgment

This work is supported by the National Natural Science Foundation of China (Grant Number: 61602491).

References

  1. 1.
    Attasena, V., Darmont, J., Harbi, N.: Secret sharing for cloud data security: a survey. VLDB J. 2, 1–25 (2017)Google Scholar
  2. 2.
    Ding, W., Liu, K., Yan, X., Liu, L.: Polynomial-based secret image sharing scheme with fully lossless recovery. Int. J. Digital Crime Forensics 10, 120–136 (2018)CrossRefGoogle Scholar
  3. 3.
    Dingledine, R., Freedman, M.J., Molnar, D.: The free haven project: distributed anonymous storage service. In: International Workshop on Designing Privacy Enhancing Technologies: Design Issues in Anonymity and Unobservability, pp. 67–95 (2001)Google Scholar
  4. 4.
    Guo, C., Chang, C.C., Qin, C.: A hierarchical threshold secret image sharing. Pattern Recogn. Lett. 33(1), 83–91 (2012)CrossRefGoogle Scholar
  5. 5.
    Hadavi, M.A., Jalili, R., Damiani, E., Cimato, S.: Security and searchability in secret sharing-based data outsourcing. Int. J. Inf. Secur. 14(6), 1–17 (2015)CrossRefGoogle Scholar
  6. 6.
    He, J., Lan, W., Tang, S.: A secure image sharing scheme with high quality stego-images based on steganography. Multimedia Tools Appl. 76(6), 7677–7698 (2017)CrossRefGoogle Scholar
  7. 7.
    Jin, D., Yan, W.Q., Kankanhalli, M.S.: Progressive color visual cryptography. J. Electron. Imaging 14(3), 033019 (2005)CrossRefGoogle Scholar
  8. 8.
    Li, P., Ma, P.J., Su, X.H., Yang, C.N.: Improvements of a two-in-one image secret sharing scheme based on gray mixing model. J. Vis. Commun. Image Represent. 23(3), 441–453 (2012)CrossRefGoogle Scholar
  9. 9.
    Li, P., Yang, C.N., Kong, Q., Ma, Y., Liu, Z.: Sharing more information in gray visual cryptography scheme. J. Vis. Commun. Image Represent. 24(8), 1380–1393 (2013)CrossRefGoogle Scholar
  10. 10.
    Li, P., Yang, C.N., Wu, C.C., Kong, Q., Ma, Y.: Essential secret image sharing scheme with different importance of shadows. J. Vis. Commun. Image Represent. 24(7), 1106–1114 (2013)CrossRefGoogle Scholar
  11. 11.
    Lin, P.Y., Chan, C.S.: Invertible secret image sharing with steganography. Pattern Recogn. Lett. 31(13), 1–7 (2010).  https://doi.org/10.1016/j.patrec.2010.01.019CrossRefGoogle Scholar
  12. 12.
    Lin, S.J., Lin, J.C.: VCPSS: a two-in-one two-decoding-options image sharing method combining visual cryptography (VC) and polynomial-style sharing (PSS) approaches. Pattern Recogn. 40(12), 3652–3666 (2007)CrossRefGoogle Scholar
  13. 13.
    Liu, Y., Zhao, Q.: E-voting scheme using secret sharing and k-anonymity. World Wide Web Internet Web Inf. Syst. pp. 1–11 (2018)Google Scholar
  14. 14.
    Rabin, M.O.: Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM (JACM) 36(2), 335–348 (1989)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Singh, P., Agarwal, N., Raman, B.: Secure data deduplication using secretsharing schemes over cloud. Future Gener. Comput. Syst. 88, 156–167 (2018)CrossRefGoogle Scholar
  17. 17.
    Thien, C.C., Lin, J.C.: Secret image sharing. Comput. Graph. 26(5), 765–770 (2002)CrossRefGoogle Scholar
  18. 18.
    Ulutas, G., Nabiyev, V.V., Ulutas, M.: Polynomial approach in a secret image sharing using quadratic residue. In: International Symposium on Computer and Information Sciences, pp. 586–591 (2009)Google Scholar
  19. 19.
    Yang, C.N., Chen, T.S., Yu, K.H., Wang, C.C.: Improvements of image sharing with steganography and authentication. J. Syst. Softw. 80(7), 1070–1076 (2007)CrossRefGoogle Scholar
  20. 20.
    Yang, C.N., Ciou, C.B.: Image secret sharing method with two-decoding-options: lossless recovery and previewing capability. Image Vis. Comput. 28(12), 1600–1610 (2010)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Lintao Liu
    • 1
    Email author
  • Yuliang Lu
    • 1
  • Xuehu Yan
    • 1
  • Wanmeng Ding
    • 1
  • Qitian Xuan
    • 1
  1. 1.National University of Defense TechnologyHefeiChina

Personalised recommendations