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 A New Bi-Level Encoding and Decoding Scheme for Pixel Expansion Based Visual Cryptography

2019 ◽  
Vol 6 (1) ◽  
pp. 18-42
Author(s):  
Ram Chandra Barik ◽  
Suvamoy Changder ◽  
Sitanshu Sekhar Sahu
Keyword(s):  
Information Security ◽  
Secret Sharing ◽  
Visual Cryptography ◽  
Color Images ◽  
Secret Sharing Scheme ◽  
Normal Vision ◽  
Visual Secret Sharing ◽  
Pixel Expansion ◽  
Host Image ◽  
Sharing Scheme

Mapping of image-based object textures to ASCII characters can be a new modification towards visual cryptography. Naor and Shamir proposed a new dimension of Information security as visual cryptography which is a secret sharing scheme among N number of participants with pixel expansion. Later on, many researchers extended the visual secret sharing scheme with no expansion of pixel regions in binary and color images. By stacking k shares the secret can be decoded using normal vision. In this paper the authors have proposed a modification towards visual cryptography by converting the message in the form of printable ASCII character-based numerical encoding patterns in a binary host image. The encoding of the message is represented as ASCII numeric and a texture of those numeric are arranged to form a binary host image. Then, N numbers of shares are built up but after stacking all the shares the decoding of the message is achieved by converting ASCII numeric to the secret.

scholarly journals (3, 3) Visual Cryptography for Online Certificate Authentication

2020 ◽  
Vol 9 (6) ◽  
pp. 152-156
Keyword(s):  
Academic Achievement ◽  
Secret Sharing ◽  
Visual Cryptography ◽  
Secret Message ◽  
Secret Sharing Scheme ◽  
Visual Secret Sharing ◽  
Job Interview ◽  
Sharing Scheme ◽  
Visual Cryptography Scheme ◽  
Full Proof

Today organizations face a challenge while recruiting candidates, who provide forged mark sheets in order to get a job. To prevent wrong hiring a detailed and thorough approach is needed to verify the authentication of both the candidate and the marks obtained by him/her. There are so many modern cryptographic protocols available which can be used for authenticating individual’s academic achievement certificates. Visual Cryptography is a simple and secure way to allow the secret sharing of images without any cryptographic computations or the use of encryption or decryption keys. The novelty of the visual secret sharing scheme is in its decryption process where human visual system (HVS) is employed for decryption of secret shares. In this paper we have discussed (3, 3) visual cryptography scheme which can be used to generate shares and distributes them among three parties, i.e. the Job Seeker, Certificate Issuance Authority and the Organization conducting Job interview. Secret message can be decrypted only if all the three shares are available. Every certificate carries a unique number which is encrypted using visual cryptography and without handshaking of all the parties it is impossible to decrypt, thus ensuring full proof authentication.

scholarly journals Threshold Secret Sharing Scheme for Compartmented Access Structures

Cryptography ◽  
2020 ◽  
pp. 438-448
Author(s):  
P. Mohamed Fathimal ◽  
P. Arockia Jansi Rani
Keyword(s):  
Secret Sharing ◽  
Visual Cryptography ◽  
Secret Sharing Scheme ◽  
Secret Image ◽  
Access Structures ◽  
Sharing Scheme ◽  
Single Host ◽  
Compartmented Access Structures ◽  
Key Features

In the realm of visual cryptography, secret sharing is the predominant method of transmission and reception of secure data. Most of the (n, n) secret sharing schemes suffer from one common flaw — locking of information when the all- n number of receivers are not available for some reason. This paper proposes a new method of compartmented secret sharing scheme where some threshold number of equally privileged from each compartment can retrieve data. This scheme rules out regeneration of secret image at the single compartment thereby eliminating the danger of misusing secret image. The key features of this scheme are: better visual quality of the recovered image with no pixel expansion; non-requirement of half toning of color images; less computational complexity by reconstructing secret through XORing and simple addition of all share images. This scheme is highly beneficial in applications where data has to be stored securely in a database and in cloud computing to synchronize information passed to different groups or clusters from a single host.

Threshold Secret Sharing Scheme for Compartmented Access Structures

2016 ◽  
Vol 10 (3) ◽  
pp. 1-9
Author(s):  
P. Mohamed Fathimal ◽  
P. Arockia Jansi Rani
Keyword(s):  
Secret Sharing ◽  
Visual Cryptography ◽  
Secret Sharing Scheme ◽  
Secret Image ◽  
Access Structures ◽  
Sharing Scheme ◽  
Single Compartment ◽  
Single Host ◽  
Compartmented Access Structures

In the realm of visual cryptography, secret sharing is the predominant method of transmission and reception of secure data. Most of the (n, n) secret sharing schemes suffer from one common flaw — locking of information when the all- n number of receivers are not available for some reason. This paper proposes a new method of compartmented secret sharing scheme where some threshold number of equally privileged from each compartment can retrieve data. This scheme rules out regeneration of secret image at the single compartment thereby eliminating the danger of misusing secret image. The key features of this scheme are: better visual quality of the recovered image with no pixel expansion; non-requirement of half toning of color images; less computational complexity by reconstructing secret through XORing and simple addition of all share images. This scheme is highly beneficial in applications where data has to be stored securely in a database and in cloud computing to synchronize information passed to different groups or clusters from a single host.

Improved Extended Progressive Visual Cryptography Scheme Using Pixel Harmonization

2021 ◽  
Vol 15 (2) ◽  
pp. 196-216
Author(s):  
Suhas Bhagate ◽  
Prakash J. Kulkarni
Keyword(s):  
Secret Sharing ◽  
Visual Cryptography ◽  
Secret Sharing Schemes ◽  
Pixel Expansion ◽  
Secret Image ◽  
Secret Information ◽  
Meaningful Shares ◽  
Visual Cryptography Scheme

Security of information is of much concern in the modern internet era. Secret sharing schemes provide mechanism of encrypting secret information to prevent illicit usage. Visual cryptography is a secret sharing technique that facilitates encryption of a secret image. Visual cryptography allows us to effectively and efficiently share secrets among a number of trusted parties by hiding secrets within images. These images are encoded into multiple shares as per the rules indicated in basis matrices and later decoded by stacking required number of shares. Progressive visual cryptography has a specialty of recovering secret image as soon as more than one shares received gradually. Existing progressive visual cryptography schemes have severe limitations like data disclose on shares and higher pixel expansion. Improved progressive visual cryptography scheme deals with these limitations. Improved extended progressive visual cryptography scheme solves the issue of management of noise like meaningless shares by creating meaningful shares without any pixel expansion efficiently.

scholarly journals A High-Quality Authenticatable Visual Secret Sharing Scheme Using SGX

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Denghui Zhang ◽  
Zhaoquan Gu
Keyword(s):  
Secret Sharing ◽  
Visual Cryptography ◽  
Third Party ◽  
Secret Sharing Scheme ◽  
High Quality ◽  
Secret Image ◽  
Digital Devices ◽  
Sharing Scheme ◽  
Main Components

Visual cryptography scheme (VCS) is a secret-sharing scheme which encrypts images as shares and can decrypt shares without digital devices. Although a participant can reveal the secret image by merely stacking a sufficient number of shares, the visual quality of recovered images is reduced, and malicious adversaries can cheat participants by giving faked shares. The paper presents a novel VCS called T-VCS (trusted VCS) which consists of two main components: a high-quality VCS and an enhanced verification scheme of shares based on the emerging Intel Software Guard eXtensions (SGX). While providing high-quality recovery, T-VCS keeps the size of the shares the same as the original secret image. We use SGX to act as a trusted third party (TTP) to verify the validity of the shares in an attested enclave without degrading the image quality. The experimental results show that T-VCS can achieve a balance among contrast, share size, and verification efficiency.

scholarly journals An Antiquity to the contemporary of Secret Sharing Scheme

2020 ◽  
Vol 2 (1) ◽  
pp. 1-13 ◽  
Author(s):  
Ms. CHITRA K. ◽  
Dr. V. PRASANNA VENKATESAN
Keyword(s):  
Secret Sharing ◽  
Visual Cryptography ◽  
Secret Sharing Scheme ◽  
Generation Process ◽  
Boolean Operation ◽  
Secret Image ◽  
Sharing Scheme ◽  
Reconstruction Image ◽  
Secret Reconstruction ◽  
Sharing Patterns

Secret Sharing (SS) scheme divides a secret image into shadow images (referred to as shares) in a way that requires the shadows in a certain privileged coalition for the secret reconstruction. However, the secret image cannot be revealed if they are not combined in a prescribed way. In this paper, the evolution of the traditional secret sharing scheme to the contemporary of secret sharing scheme has been presented based on its technology adoption. The basic comparison between the traditional secret sharing scheme and Visual cryptography is presented. The image-based share generation process has been explained in the context of pixel sharing patterns and its process. The reconstruction image is obtained by the XOR /OR Boolean operation. The threshold-based share generation schemes are explained mathematically and the comparative analysis of these schemes also presented.

Sign in / Sign up

Export Citation Format

Share Document