Cheating Detection in (k, n) Secret Image Sharing Scheme
- 72 Downloads
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.
KeywordsSecret image sharing Cheating detection Shadow image Secret sharing
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).
- 2.Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the AFIPS, pp. 313–317 (1979)Google Scholar
- 4.Liu, Y.: Linear (k, n) secret sharing scheme with cheating detection. Secur. Commun. Netw. 9(13), 2115–2121 (2016)Google Scholar
- 9.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)Google Scholar
- 11.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)Google Scholar