Binary Image Random Grid (2, n)-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.

Download Full-text

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

Cryptography ◽

10.4018/978-1-7998-1763-5.ch027 ◽

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.

Download Full-text

Random grid based color visual cryptography scheme for black and white secret images with general access structures

Signal Processing Image Communication ◽

10.1016/j.image.2019.03.017 ◽

2019 ◽

Vol 75 ◽

pp. 100-110 ◽

Cited By ~ 5

Author(s):

Xiaotian Wu ◽

Zhao-Rong Lai

Keyword(s):

Visual Cryptography ◽

Black And White ◽

Access Structures ◽

Random Grid ◽

Visual Cryptography Scheme ◽

Grid Based

Download Full-text

Secret sharing scheme Circular Visual Cryptography for Color Images

International Journal of Scientific Research in Computer Science Engineering and Information Technology ◽

10.32628/cseit11953131 ◽

2019 ◽

pp. 1316-1323 ◽

Cited By ~ 1

Author(s):

Sudhir Parmar ◽

Sheshang D. Degadwala

Keyword(s):

Data Security ◽

Visual Cryptography ◽

Industry Association ◽

Sharing Scheme ◽

Points Of Interest ◽

Random Grid ◽

Complex Calculation ◽

Innovative Work ◽

Visual Cryptography Scheme ◽

Territory Government

Data security is the most significant part of the innovative work territory, government, industry, association, and so forth. As of late, cybercrime or related hacking issue increments to an ever-increasing extent. So high security is required to verify the data as well as the picture. Visual Cryptography Scheme (VCS) is one of the procedures to verify the data utilizing straightforward calculation while in some other security method complex calculation was utilized. VCS has a straightforward encryption calculation which is secure data changing over into the various offers and for the unscrambling procedure don't require any kind of gadgets or any mind-boggling decoding calculation. The unscrambling procedure is finished utilizing the Human Visual Scheme (HVS). Round Random Grid offers are superior to the rectangular offers since usefulness is expanded by secure various data in the roundabout irregular network to give the secrecy. In the proposed plan, mystery sharing plan is that mystery data is separated into different importance full and negligible offers and is additionally recouped by superimposing handling and it is seen by HVS. In this Research, we depict each technique for VCS and introduced its relative investigation utilizing points of interest and hindrances.

Download Full-text

Secret Image Sharing using 2-Pixel Visual Cryptography Encryption

International Journal of Recent Technology and Engineering - 2 ◽

10.35940/ijrte.c4307.118419 ◽

2019 ◽

Vol 8 (4) ◽

pp. 1612-1614

Keyword(s):

Visual Cryptography ◽

Binary Image ◽

Encryption Algorithm ◽

Original Image ◽

Secret Image Sharing ◽

Digital Text ◽

Written Text ◽

Image Sharing ◽

Visual Cryptography Scheme ◽

Automated Tool

Visual Cryptography Scheme (Vcs) Is A Procedure For Encrypting Visual Data Such As Hand-Written Text, Image, Digital Text, Captured Image Etc. In This Scheme, The Shares Are Generated By Scrambling The Pixels Of The Original Image. Further, These Shares Are Sent To Receiver For Decryption At The Receiver End. In this paper, we have proposed an automated tool that takes the binary image as an input, and generates initial shares with one pixel encryption algorithm. Further, these initial shares are encrypted using 2-pixel encryption algorithm. The encrypted shares are then sent to the receiver for decryption to obtain the initial shares. The receiver then stacks the shares to get the original image. The proposed work which is presented in the methodology is the extension of VCS algorithm

Download Full-text

Security Concern and Countermeasures for Cheating in Visual Cryptography

International Journal of Emerging Research in Management and Technology ◽

10.23956/ijermt.v6i8.152 ◽

2018 ◽

Vol 6 (8) ◽

pp. 277

Author(s):

Ekta Y

Keyword(s):

Communication System ◽

Visual Cryptography ◽

Detection Methods ◽

Information Communication ◽

New Approach ◽

The World ◽

Visual Cryptography Scheme ◽

Prevention Methods ◽

Security Concern

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.

Download Full-text