Abstract
Secret image sharing will inevitably be threatened by various types of attacks in practical applications, of which cheating behavior is the most prone. In this paper, in order to prevent deceivers from threatening the security of secret image transmission process, a polynomial based cheating detection scheme is proposed. The (k, n) secret image sharing scheme must ensure that any k or more participants can restore the secret image, and less than k participants cannot get any information of the secret image. In our scheme, only one honest shareholder can detect the collusion from other k − 1 deceivers. Furthermore, our scheme reduces the size of shadow images thus saving storage space and transmission time. Theory and experiments show that our scheme is effective and feasible in cheating detection.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)
Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the AFIPS, pp. 313–317 (1979)
Tompa, M., Woll, H.: How to share a secret with cheaters. J. Cryptol. 1(3), 133–138 (1989)
Liu, Y.: Linear (k, n) secret sharing scheme with cheating detection. Secur. Commun. Netw. 9(13), 2115–2121 (2016)
Liu, Y.-X., Sun, Q.-D., Yang, C.-N.: (k,n) secret image sharing scheme capable of cheating detection. EURASIP J. Wirel. Commun. Netw. 2018(1), 1–6 (2018). https://doi.org/10.1186/s13638-018-1084-7
Pieprzyk, J., Zhang, X.-M.: Cheating prevention in linear secret sharing. In: Batten, L., Seberry, J. (eds.) ACISP 2002. LNCS, vol. 2384, pp. 121–135. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45450-0_9
Liu, Y., Yang, C., Wang, Y., et al.: Cheating identifiable secret sharing scheme using symmetric bivariate polynomial. Inf. Sci. 453, 21–29 (2018)
Carpentieri, M.: A perfect threshold secret sharing scheme to identify cheaters. Des. Codes Crypt. 5(3), 183–187 (1995)
Pasailă, D., Alexa, V., Iftene, S.: Cheating detection and cheater identification in CRT-based secret sharing schemes. Int. Sci. J. Comput. 9(2), 107–117 (2010)
Thien, C., Lin, J.: Secret image sharing. Comput. Graph. 26(5), 765–770 (2002)
Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proceeding of the Symposium on theory of Computing, pp. 73–85 (1989)
Zhao, R., Zhao, J., Dai, F., et al.: A new image secret sharing scheme to identify cheaters. Comput. Stand. Interfaces 31(1), 252–257 (2009)
Lin, Y., Wang, R.: Scalable secret image sharing with smaller shadow images. IEEE Signal Process. Lett. 17(3), 316–319 (2010)
Wu, K.-S.: A secret image sharing scheme for light images. EURASIP J. Adv. Signal Process. 2013(1), 1–5 (2013). https://doi.org/10.1186/1687-6180-2013-49
Chen, C., Fu, W.: A geometry-based secret image sharing approach. J. Inf. Sci. Eng. 24(5), 1567–1577 (2008)
Nag, A., Biswas, S., Sarkar, D., et al.: A new (k, n) verifiable secret image sharing scheme (VSISS). Egypt. Inform. J. 15(3), 201–209 (2014)
Acknowledgements
This work was supported in part by the National Natural Science Foundation of China (No. 61602173), Natural Science Foundation of Hebei Province of China (No. F2019502173) and the Fundamental Research Funds for Central Universities (No. 2019MS116).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Ma, J., Yin, L., Li, P. (2020). Cheating Detection in (k, n) Secret Image Sharing Scheme. In: Wang, H., Zhao, X., Shi, Y., Kim, H., Piva, A. (eds) Digital Forensics and Watermarking. IWDW 2019. Lecture Notes in Computer Science(), vol 12022. Springer, Cham. https://doi.org/10.1007/978-3-030-43575-2_34
Download citation
DOI: https://doi.org/10.1007/978-3-030-43575-2_34
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-43574-5
Online ISBN: 978-3-030-43575-2
eBook Packages: Computer ScienceComputer Science (R0)