Secure Channel Less Verifiable Cryptography Scheme
The first visual cryptography scheme was proposed by Naor and Shamir. In which the secret can only be recover
by the qualified group of participants. This scheme can easily corrupted by malicious participants. Xiaoqing and Qiong have
proposed the Verifiable Visual Cryptography Scheme in which we can verify cheaters with the help of digital watermarking.
Hence each participant can verify the shares of other users. Now, the scheme proposed by Xiaoqing and Qiong needs a
proper secure channel which is used to transfer some data (verifying shares). Hence the requirement of this channel makes
the algorithm quite improper. In this paper we have proposed an algorithm which overcomes the requirement of the
algorithm proposed by Xiaoqing and Qiong hence the security is improved as compare to their algorithm.