An Approach for Secret Sharing Using Randomised Visual Secret Sharing
S. P. Dixit, Deepak Kumar Jain, Ankita Saxena
Abstract
S. P. Dixit, Deepak Kumar Jain, Ankita Saxena
Abstract
Visual secret sharing is the technique that divide the secret image into n multiple shares. Each share constitutes some information and when k shares out of n stack together the secret will reveal. However, less than k shares are not work. Sharing is the idea from secret sharing scheme that was presented in 1975 by Adi Shamir. The beauty of the visual secret sharing scheme is its decryption process i.e. To decrypt the secret using Human Visual System (HVS) without any computation. Visual cryptography is presented by Noar and Shamir in 1995 including also visual secret sharing. The resultant secret recover through this scheme is double in size of the original secret [17]. We have proposed the new algorithms for the (2, 2) visual cryptography and (3, 3) visual secret sharing. Our proposed schemes are for gray scale image and by stacking the shares, the resultant image achieved in same size with original secret image and Its shadow Image. We used randomization and pixel reversal approach in all methods.
OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Visual secret sharing is the technique that divide the secret image into n multiple shares. Each share constitutes some information and when k shares out of n stack together the secret will reveal. However, less than k shares are not work. Sharing is the idea from secret sharing scheme that was presented in 1975 by Adi Shamir. The beauty of the visual secret sharing scheme is its decryption process i.e. To decrypt the secret using Human Visual System (HVS) without any computation. Visual cryptography is presented by Noar and Shamir in 1995 including also visual secret sharing. The resultant secret recover through this scheme is double in size of the original secret [17]. We have proposed the new algorithms for the (2, 2) visual cryptography and (3, 3) visual secret sharing. Our proposed schemes are for gray scale image and by stacking the shares, the resultant image achieved in same size with original secret image and Its shadow Image. We used randomization and pixel reversal approach in all methods.
Key concepts: Secret sharing, Visual cryptography, Homomorphic secret sharing, Shamir's Secret Sharing, Secure multi-party computation, Shared secret, Computer science, Image sharing