A high contrast and capacity efficient visual cryptography scheme for the encryption of multiple secret images

2011 ◽  
Vol 284 (12) ◽  
pp. 2730-2741 ◽  
Author(s):  
Kai-Hui Lee ◽  
Pei-Ling Chiu
2014 ◽  
Vol 644-650 ◽  
pp. 2108-2111 ◽  
Author(s):  
Yan Yan Ha ◽  
Shuai Ji ◽  
Wen Cai He ◽  
Yao Zhang

XOR algorithm can be used to improve the recovery effects of visual cryptography scheme. In this paper, we present a multi-secret visual cryptography scheme by using the matrices of the (k, k)-VCS. We can reveal multiple secret images perfectly by the XOR algorithm and shifting operation on the shares. The visual qualities of recovered images are ideal without any pixel expansion.


2012 ◽  
Vol 6-7 ◽  
pp. 343-349
Author(s):  
Zheng Xin Fu ◽  
Bin Yu

A visual cryptography scheme encoding multiple secret images into two ring shares is proposed in this paper. In the secret sharing process, two shares are produced by the marked areas and the basis matrices of (2, 2)-VCS. Using ring shift right function, the secret images are recovered by stacking two shares. The security and contrast properties of the scheme have been proved. Compared with the previous ones, the scheme makes the number of secret images unlimited. Furthermore, the pixel expansion and the relative difference are improved greatly.


Author(s):  
Ekta Y

As IT sector is ruling the world now,confidentiality and security of information has become the most important inseparable aspect in information communication system. Keeping in view the same, a new approach called Visual Cryptography (VC) has been suggested by many researchers but there are some limitations with this scheme and cheating is one of the main problem among them. This paper intends to show the basis of cheating in VC in terms of cheating process, its detection methods and its prevention methods suggested by various researchers along with their merits and demerits. Finally, a good Cheating Immune Visual Cryptography Scheme (CIVCS) has been discussed which states the properties to be adopted by every Visual Cryptography scheme to make it immune to cheating attacks.


2003 ◽  
Vol 13 (6) ◽  
pp. 457-463
Author(s):  
Daoshun Wang ◽  
Ping Luo ◽  
Lu Yang ◽  
Dongxu Qi ◽  
Yiqi Dai

Author(s):  
ASHWATHIMESANGLA AO

Visual cryptography is a secret sharing scheme for encrypting a secret image, it is a perfectly secure way that allows secret sharing without any cryptographic computation, which is termed as Visual Cryptography Scheme (VCS). In this paper secret image is divided into shares (printed on transparencies), and each share holds some information. At the receiver this shares are merged to obtain the secret information which is revealed without any complex computation. The proposed algorithm is for color host image, divided into three color planes Red, Green, Blue and merged with secret image which is binarized and divided into shares. The decoding requires aligning the result obtained by merging color host image and shares, so as to obtain the secret image.


Sign in / Sign up

Export Citation Format

Share Document