Verifiable Threshold Changeable Secret Image Sharing scheme based on LWE problem

Abstract

Abstract In threshold secret image sharing (t, n) schemes, each of n shareholders has a share of secret image S. By having at least t shares, the dealer D can retrieve the secret image S. In such traditional secret image sharing schemes, there is no ability to change the threshold. In fact, the security policy of the secret recovery phase may change, and the number of shareholders present at the phase of secret recovery may need to change, in this case, we need secret sharing schemes with a changeable threshold. In this paper, a changeable secret image sharing scheme based on Learning With Error problem is introduced. We also use Bloom Filter for non-interactive verification of participants’ shares.