LWE‐based verifiable essential secret image sharing scheme ((t,s,k,n)$( {t,s,k,n} )$ ‐ VESIS)

Abstract

In traditional secret image sharing schemes, shareholders have similar situations, and to recover the secret image, they must be present as many as the threshold. However, in scenarios where the shareholders occupy different positions, essential and non‐essential, the use of essential secret image sharing schemes becomes necessary. This article presents a novel verifiable essential secret image sharing scheme based on LWEs that incorporates Bloom filters and hash functions for verification purposes. The proposed scheme for a secret image does not require any pre‐processing. The shadow images of both essential and non‐essential shareholders are of the same size, eliminating the need for concatenating sub‐shadows. Furthermore, shadow images for essential and non‐essential shareholders are produced simultaneously in a single step. The scheme is also quantum safe thanks to the use of quantum‐resistant primitives. The experimental results confirm the security and efficiency of the proposed scheme.