2015Unpublished venueRequires access

Random grid based visual cryptography using a common share

Sruthy K Joseph, R. Ramesh

Open publisher page 10 citations

Abstract

Visual cryptography (VC) is a paradigm of cryptography which prevents a secret from being modified or destructed by using the notions of perfect cipher and the secret can be reconstructed by the human visual system. It is a cryptographic technique which can encrypt visual information, such as images and text; and can decrypt the secret without a computer (stack operation). This visual secret sharing scheme is developed by Moni Naor and Adi Shamir in 1994. Most of the visual cryptography schemes suffer from many drawbacks such as: pixel expansion, share management difficulty, poor quality recovered image etc. So this paper discusses a visual cryptography scheme using random grids, where it uses a common share to transmit n binary secrets. The binary secret image is divided into two share images (random grids) as in (2, 2) visual cryptography scheme. Here we use n+1 share images to transmit n secrets and the extra share is common to all n secrets. Since RG is used it creates shares without pixel expansion. This scheme can be viewed as a modified scheme of (2, 2) random grid based visual cryptography. One share is considered as a common share to all n secrets, so it makes efficient network bandwidth utilization.

About this research paper

What this paper is about

Visual cryptography (VC) is a paradigm of cryptography which prevents a secret from being modified or destructed by using the notions of perfect cipher and the secret can be reconstructed by the human visual system. It is a cryptographic technique which can encrypt visual information, such as images and text; and can decrypt the secret without a computer (stack operation). This visual secret sharing scheme is developed by Moni Naor and Adi Shamir in 1994. Most of the visual cryptography schemes suffer from many drawbacks such as: pixel expansion, share management difficulty, poor quality recovered image etc. So this paper discusses a visual cryptography scheme using random grids, where it uses a common share to transmit n binary secrets. The binary secret image is divided into two share images (random grids) as in (2, 2) visual cryptography scheme. Here we use n+1 share images to transmit n secrets and the extra share is common to all n secrets. Since RG is used it creates shares without pixel expansion. This scheme can be viewed as a modified scheme of (2, 2) random grid based visual cryptography. One share is considered as a common share to all n secrets, so it makes efficient network bandwidth utilization.

Why it matters

OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Visual cryptography (VC) is a paradigm of cryptography which prevents a secret from being modified or destructed by using the notions of perfect cipher and the secret can be reconstructed by the human visual system. It is a cryptographic technique which can encrypt visual information, such as images and text; and can decrypt the secret without a computer (stack operation). This visual secret sharing scheme is developed by Moni Naor and Adi Shamir in 1994. Most of the visual cryptography schemes suffer from many drawbacks such as: pixel expansion, share management difficulty, poor quality recovered image etc. So this paper discusses a visual cryptography scheme using random grids, where it uses a common share to transmit n binary secrets. The binary secret image is divided into two share images (random grids) as in (2, 2) visual cryptography scheme. Here we use n+1 share images to transmit n secrets and the extra share is common to all n secrets. Since RG is used it creates shares without pixel expansion. This scheme can be viewed as a modified scheme of (2, 2) random grid based visual cryptography. One share is considered as a common share to all n secrets, so it makes efficient network bandwidth utilization.

Key concepts: Visual cryptography, Secret sharing, Cryptography, Shared secret, Computer science, Encryption, Neural cryptography, Shamir's Secret Sharing

Related papers

Back to paper searchBrowse research topicsOriginal source
Random grid based visual cryptography using a common share — Research Paper | ScholarLens