Verifiable Changeable Threshold Secret Image Sharing Scheme Based on LWE Problem

In common 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 will be able to retrieve the secret. In such traditional schemes, it is not possible to change the threshold value. However, 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 such cases, a secret sharing scheme with changeable threshold can be applied. In this paper, we introduce the first changeable threshold secret image sharing scheme based on Learning With Error problem. It employs Bloom Filter to provide non-interactive verification of participants’ shares.