scholarly journals Meliorated Multi Layered Key Less Mechanism in Visual Cryptography

2020 ◽  
Vol 9 (5) ◽  
pp. 404-408
Keyword(s):  
Visual Cryptography ◽  
Secret Message ◽  
Receiver Side ◽  
Secret Image ◽  
Bandwidth Requirement ◽  
Lossless Recovery

Visual Cryptography algorithm primarily ensures lossless recovery of the secret image, by breaking the secret message into multiple shares before sending through a channel, which increases the bandwidth requirement of the channel due to increase in the size. The proposed algorithm deals with this problem by using two exclusive locks on the image to be shared which are applied once on the sender side and once on the receiver side. Thereafter sender and receiver open’s their individual locks to finally retrieve the secret image at the receiver end.

An Improved Size Invariant (n, n) Extended Visual Cryptography Scheme

2016 ◽  
Vol 12 (2) ◽  
pp. 80-88 ◽  
Author(s):  
Rahul Sharma ◽  
Nitesh Kumar Agrawal ◽  
Ayush Khare ◽  
Arup Kumar Pal
Keyword(s):  
Visual Cryptography ◽  
Visual Quality ◽  
Binary Image ◽  
Secret Message ◽  
Grayscale Image ◽  
Secret Image ◽  
Meaningful Shares ◽  
Connectivity Property ◽  
Visual Cryptography Scheme

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.

scholarly journals An Improved Size Invariant (n, n) Extended Visual Cryptography Scheme

Cryptography ◽  
2020 ◽  
pp. 449-457
Author(s):  
Rahul Sharma ◽  
Nitesh Kumar Agrawal ◽  
Ayush Khare ◽  
Arup Kumar Pal
Keyword(s):  
Visual Cryptography ◽  
Visual Quality ◽  
Binary Image ◽  
Secret Message ◽  
Grayscale Image ◽  
Secret Image ◽  
Meaningful Shares ◽  
Connectivity Property ◽  
Visual Cryptography Scheme

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.

scholarly journals An Enhance Scheme of Visual Secret Share for Lossless Recovery

2020 ◽  
Vol 9 (3S) ◽  
pp. 52-56
Keyword(s):  
Visual Cryptography ◽  
Secret Image ◽  
Lossless Recovery ◽  
Sharing Scheme ◽  
Bitwise Operations ◽  
Cryptographic Scheme

Algorithms in Visual Cryptography usually uses a sharing scheme where instead of sharing the secret or message directly, it is embedded into multiple shares which are then shared between the intended individuals whereby upon receiving them the decrypting algorithm on the receiving end restores the original secret. A novel cryptographic scheme will not only hide the data, but also will do it in an efficient way which will further ensure that the algorithm is robust to noises and attacks. The proposed algorithm utilizes bitwise operations for efficient hiding of data. Also, it is important that the secret image is losslessly recovered.

scholarly journals Flip Extended Visual Cryptography for Gray-Scale and Color Cover Images

Symmetry ◽  
2020 ◽  
Vol 13 (1) ◽  
pp. 65
Author(s):  
Lu Wang ◽  
Bin Yan ◽  
Hong-Mei Yang ◽  
Jeng-Shyang Pan
Keyword(s):  
Privacy Protection ◽  
Visual Cryptography ◽  
Color Images ◽  
Cover Image ◽  
Error Diffusion ◽  
Gray Scale ◽  
Secret Image ◽  
Transaction Security

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.

scholarly journals VISUAL CRYPTOGRAPHY FOR COLOR IMAGES

2013 ◽  
pp. 147-149
Author(s):  
ASHWATHIMESANGLA AO
Keyword(s):  
Secret Sharing ◽  
Visual Cryptography ◽  
Color Images ◽  
Secret Sharing Scheme ◽  
Secret Image ◽  
Secret Information ◽  
Host Image ◽  
Sharing Scheme ◽  
Visual Cryptography Scheme

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.

scholarly journals Meaningful Secret Image Sharing Scheme with High Visual Quality Based on Natural Steganography

Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1452
Author(s):  
Yuyuan Sun ◽  
Yuliang Lu ◽  
Jinrui Chen ◽  
Weiming Zhang ◽  
Xuehu Yan
Keyword(s):  
Visual Quality ◽  
Secret Image Sharing ◽  
Secret Image ◽  
Image Sharing ◽  
Lossless Recovery ◽  
Sharing Scheme ◽  
Image Protection ◽  
Embedding Rate ◽  
Secret Image Sharing Scheme

The (k,n)-threshold Secret Image Sharing scheme (SISS) is a solution to image protection. However, the shadow images generated by traditional SISS are noise-like, easily arousing deep suspicions, so that it is significant to generate meaningful shadow images. One solution is to embed the shadow images into meaningful natural images and visual quality should be considered first. Limited by embedding rate, the existing schemes have made concessions in size and visual quality of shadow images, and few of them take the ability of anti-steganalysis into consideration. In this paper, a meaningful SISS that is based on Natural Steganography (MSISS-NS) is proposed. The secret image is firstly divided into n small-sized shadow images with Chinese Reminder Theorem, which are then embedded into RAW images to simulate the images with higher ISO parameters with NS. In MSISS-NS, the visual quality of shadow images is improved significantly. Additionally, as the payload of cover images with NS is larger than the size of small-sized shadow images, the scheme performs well not only in visual camouflage, but also in other aspects, like lossless recovery, no pixel expansion, and resisting steganalysis.

scholarly journals A n-out-of-n Sharing Digital Image Scheme by Using Color Palette

Electronics ◽  
2019 ◽  
Vol 8 (7) ◽  
pp. 802
Author(s):  
Ching-Nung Yang ◽  
Qin-Dong Sun ◽  
Yan-Xiao Liu ◽  
Ci-Ming Wu
Keyword(s):  
Digital Image ◽  
Shadow Image ◽  
Cover Image ◽  
Secret Message ◽  
Secret Image Sharing ◽  
Color Palette ◽  
Secret Image ◽  
Image Sharing

A secret image sharing (SIS) scheme inserts a secret message into shadow images in a way that if shadow images are combined in a specific way, the secret image can be recovered. A 2-out-of-2 sharing digital image scheme (SDIS) adopts a color palette to share a digital color secret image into two shadow images, and the secret image can be recovered from two shadow images, while any one shadow image has no information about the secret image. This 2-out-of-2 SDIS may keep the shadow size small because by using a color palette, and thus has advantage of reducing storage. However, the previous works on SDIS are just 2-out-of-2 scheme and have limited functions. In this paper, we take the lead to study a general n-out-of-n SDIS which can be applied on more than two shadow. The proposed SDIS is implemented on the basis of 2-out-of-2 SDIS. Our main contribution has the higher contrast of binary meaningful shadow and the larger region in color shadows revealing cover image when compared with previous 2-out-of-2 SDISs. Meanwhile, our SDIS is resistant to colluder attack.

Sign in / Sign up

Export Citation Format

Share Document