Expansion-Free Grayscale Image Sharing Using Meaningful Share Images

2013 ◽  
Vol 284-287 ◽  
pp. 3413-3417
Author(s):  
Kai Ping Wang ◽  
Chiang Lung Liu ◽  
Der Chyuan Lou

Since Naor and Shamir introduced visual cryptography in 1994, numerous image sharing techniques have been proposed to protect the security of binary, gray, and color images. However, only few of them focus on grayscale image sharing. Because the size of the share images are usually very large, an image sharing method that can create share images with the same size as that of the secret image (expansion free) is more attractive. This study aims to propose a grayscale image sharing method to achieve the purposes of free expansion and meaningful image sharing simultaneously. Experimental results show that two meaningful share images can be effectively created by the proposed share image creation process. Moreover, the original grayscale secret image can be correctly decoded by the proposed secret image retrieval process.

Symmetry ◽  
2020 ◽  
Vol 13 (1) ◽  
pp. 65
Author(s):  
Lu Wang ◽  
Bin Yan ◽  
Hong-Mei Yang ◽  
Jeng-Shyang Pan

Visual cryptography (VC) has found numerous applications in privacy protection, online transaction security, and voting security, etc. To counteract potential cheating attacks, Lin et al. proposed flip visual cryptography in 2010, where a second secret image can be revealed by stacking one share with a flipped version of another share. The second secret image can be designed as an additional verification mechanism. However, Lin’s scheme produces meaningless shares and is only applicable to binary secret images. It is interesting to explore whether it is possible to extend the flip VC to having cover images (i.e., extended VC) and these cover images are color images. This problem is challenging since too many restricting conditions need to be met. In this paper, we designed a flip VC for gray-scale and color cover images based on constraint error diffusion. We show that it is possible to meet all the constraints simultaneously. Compared with existing schemes, our scheme enjoys the following features: Color cover images, no computation needed for decoding, and no interference from cover image on the recovered secret image.


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.


2009 ◽  
Vol 179 (19) ◽  
pp. 3247-3254 ◽  
Author(s):  
Du-Shiau Tsai ◽  
Gwoboa Horng ◽  
Tzung-Her Chen ◽  
Yao-Te Huang

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 113216-113222
Author(s):  
Qinghong Gong ◽  
Yongjie Wang ◽  
Xuehu Yan ◽  
Lintao Liu

2019 ◽  
Vol 8 (4) ◽  
pp. 2797-2800

visual cryptography system proposed a image encryption and decryption method. In the proposed method Red, Green, Blue color images using visual cryptography. In existing system is working for share created, it is encrypted separately by using visual secret share creation (VSS) algorithms. The proposed work is original images share1 and ahare2 created XOR-Based visual cryptography. This proposed schemes share1 encryption and share2 encryption included in RSA algorithm. The share1 and ahare2 decryption process is enable secret image sharing and then stacking. The proposed system is value calculate the PSNR and MSE formula and then image security using NPCR and UACI formula. The visual cryptography existing work to compare the proposed work and better results quality of RGB color images. The color image encryption and decryption using RSA algorithm and matlab coding.


Author(s):  
Rahul Sharma ◽  
Nitesh Kumar Agrawal ◽  
Ayush Khare ◽  
Arup Kumar Pal

In this paper, the authors have presented a (n, n) extended visual cryptography scheme where n numbers of meaningful shares furnish a visually secret message. Initially they have converted a grayscale image into binary image using dithering method. Afterwards, they have incorporated pixel's eight neighboring connectivity property of secret image during formation of meaningful shares. The scheme is able to generate the shares without extending its size. This approach has enhanced the visual quality of the recovered secret image from n numbers of shares. The scheme has been tested with some images and satisfactory results are achieved. The scheme has improved the contrast of the recovered secret image than a related (n, n) extended visual cryptography scheme.


Sign in / Sign up

Export Citation Format

Share Document