Ramp Progressive Secret Image Sharing Using Ensemble of Simple Methods
Atieh Mokhtari, Mohammad Taheri · 2024
This paper reviews the limitations of traditional Secret Image Sharing (SIS) methods and recent advancements such as PSIS, RPSIS, and SSIS, and presents an optimized and practical combinatorial method for secret image sharing by ensemble of simple methods. In this approach, a color or grayscale image is divided into n shares, each of which is individually meaningless. The image is reconstructed through XOR operations between corresponding pixels in different shares. The main innovation of this method is the introduction of two thresholds,$\mathrm{k}_{1}$and$\mathrm{k}_{2}$. This scheme is characterized by parameters$(\mathrm{k}_{1},\ \mathrm{k}_{2},\ \mathrm{n})$, where having fewer than$\mathrm{k}_{1}$shares reveals no information about the original image, while between$\mathrm{k}_{1}$and k2 shares, the image quality progressively improves and reaches near-complete reconstruction. Ultimately, with k2 or more shares, the image can be recovered in its full resolution. This method allows for customization of the image quality improvement rate between$\mathrm{k}_1$and k2 and addresses the limitations of previous designs regarding the selection of$\mathrm{k}_{1},\mathrm{k}_{2}$, and n values. Its flexibility in providing suitable models based on specific user needs makes this method appropriate for various applications in secret image sharing.