“…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].…”