Boolean-based Multi Secret Sharing Scheme using Meaningful Shares

A novel scheme for lossless authenticated multiple secret images sharing using polynomials and extended visual cryptography

“…The scheme proposed is compared with schemes in [6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21] with respect to properties such as intelligible shares, authentication for cheating prevention, number of secret images shared, restriction on v and z, and lossless recovery of secret images as shown in Table 3. A number of secret images shared, for schemes in [12,14,18], are written as 'Multiple'.…”

“…The existing schemes briefed so far have the following limitations: (i) identification and management of shares are difficult due to their noisy nature [1,[4][5][6][7][8]10,11,[13][14][15][16][17][18][19]21]; (ii) extra verification shares are generated for authentication which consume extra storage space [14,15,17]; (iii) difficult to find the reference points of rotation for shares carrying multiple secret images data [12]; (iv) shares have to be circumvolved in a specific way to reconstruct each of the multiple secret images [12] [5,[15][16][17]20,21]; (vi) the number of shares to be created is dependent on the number of secret images to be shared [15][16][17]20,21]; and (vii) need of ordered consecutive shares to recover the secret images [15][16][17][19][20][21]. In addition to overcoming the abovementioned limitations, the proposed scheme has other advantages as follows: (i) maximum of m/2 secret images are shared using z shares, m being the pixel expansion, (ii) lossless recovery of all m/2 secret images using at least v shares; (iii) only one-time authentication for the recovering of all m/2 shared secret images; and (iv) resistant to different kinds of cheating and cheaters mentioned in [3].…”

“…The number of secret images that can be shared at a time is v, where v being the threshold in (v, z) -multiple secret image sharing scheme. Kapadiya et al [20] proposed sharing multiple secret images using XOR operation. To share z secret images, z + 1 shares are generated among which one is a universal share, and shares are created in order starting from the universal share.…”

“…Kapadiya et al. [20] proposed sharing multiple secret images using XOR operation. To share z secret images, z + 1 shares are generated among which one is a universal share, and shares are created in order starting from the universal share.…”

“…Schemes for sharing multiple secrets at a time are proposed in by Chang et al [14], Nitharwal and Verma [15], Ovhal et al [16], Deshmukh et al [17], Sasaki and Watanabe [18], Kabirirad and Eslami [19], Kapadiya et al [20], and Prasetyo and Guo [21]. Chang et al [14] proposed sharing multiple secret images using the Chinese Remainder Theorem (CRT) and Lagrange's interpolation.…”