Robust Secret Image Sharing Scheme Based on Polynomial k-Consistency

The (k, n)-threshold Secret Image Sharing (SIS) is a naturally fault-tolerant technique for image privacy protection. A secret image is processed through secret sharing to generate n shadow images, which are then distributed to n different recipients. During the recovery phase, the complete secret image can be reconstructed by any k out of n shadow images. Although (k, n)-threshold SIS itself allows for the loss of up to $n-k$ shadow images, if there are pixel errors in the remaining k shadow images, the recovery of the secret image will be declared a failure. Therefore, Robust Secret Image Sharing (RSIS) has been proposed to address the issue. However, the current proposed RSIS schemes only demonstrated limited robustness against noise attacks. This paper presents a novel k-consistency-based RSIS scheme to resist malicious attacks, including noise, JPEG compression, tampering, and cropping. In the sharing phase, a dual-SIS mechanism is first designed to perform two rounds of secret sharing on the secret image. In the recovery phase, high-quality secret image can be reconstructed based on k-consistency after attacking. The experimental results demonstrated that our scheme not only provides comprehensive robustness but also allows for flexible adjustment of shadow images’ sizes, ensuring both security and efficiency during image sharing.