Verifiable Essential Secret Image Sharing with Multiple Decryptions
Mainejar Yadav1, Ranvijay2 

1Mainejar Yadav, CSED, MNNIT ALLAHABAD, Prayagraj, India.
2Ranvijay, CSED, MNNIT ALLAHABAD, Prayagraj, India.

Manuscript received on 19 March 2019 | Revised Manuscript received on 24 March 2019 | Manuscript published on 30 July 2019 | PP: 2211-2220 | Volume-8 Issue-2, July 2019 | Retrieval Number: B2424078219/19©BEIESP | DOI: 10.35940/ijrte.B2424.078219
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: We know that the essential secret image sharing (ESIS) scheme differs from traditional visual secret sharing with respect to the essentiality of the shares. In ESIS, to reconstruct the secret image, threshold number of the shares are required which includes all the essential shares. All the shares are very sensitive because it carries the secret information. Hence, reliability and authenticity of the shares before the decoding of the secret image are required which prevents a participant from intentionally or unintentionally to provide invalid shares. Proposed method is a novel verifiable essential secret image sharing (VESIS) with multiple decryption. Multiple decryption means that the decoding and verification process is done by human visual system as well as by EX-ORing the shares. Apart from this, proposed scheme also eliminates unnecessary encryption constraints of VSS like pixel expansion, explicit codebook and the number of the participants and it is also required simple computation and O(k) complexity for the decoding process.
Index Terms: Collusion Attack, Cheating Prevention, Essential Secret Image Sharing, Random Grids.

Scope of the Article: Image Security