2015Unpublished venueRequires access

A partition based visual secret sharing schemes for large images

Abhishek Mishra, Ashutosh Gupta

Open publisher page 1 citations

Abstract

In last one decade, the secret sharing schemes get utmost importance because of their possibility to use in variety of applications. Visual secret sharing also known as visual cryptography (VC) is an extension of secret sharing scheme. Visual cryptography has many uses if secret is to revealed through human eyes, as it is not always possible to use electronic device for decoding the secrets. In this paper, we propose a partition based visual cryptography scheme scheme which is useful for those images which are large in size and making the transparencies for the shares are practically infeasible. The proposed scheme uses a method of partitioning where input image is divided into independent segments and each segment undergoes to visual cryptography encoding. The experimental results shows the efficacy of proposed system.

About this research paper

What this paper is about

In last one decade, the secret sharing schemes get utmost importance because of their possibility to use in variety of applications. Visual secret sharing also known as visual cryptography (VC) is an extension of secret sharing scheme. Visual cryptography has many uses if secret is to revealed through human eyes, as it is not always possible to use electronic device for decoding the secrets. In this paper, we propose a partition based visual cryptography scheme scheme which is useful for those images which are large in size and making the transparencies for the shares are practically infeasible. The proposed scheme uses a method of partitioning where input image is divided into independent segments and each segment undergoes to visual cryptography encoding. The experimental results shows the efficacy of proposed system.

Why it matters

OpenAlex reports 1 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

In last one decade, the secret sharing schemes get utmost importance because of their possibility to use in variety of applications. Visual secret sharing also known as visual cryptography (VC) is an extension of secret sharing scheme. Visual cryptography has many uses if secret is to revealed through human eyes, as it is not always possible to use electronic device for decoding the secrets. In this paper, we propose a partition based visual cryptography scheme scheme which is useful for those images which are large in size and making the transparencies for the shares are practically infeasible. The proposed scheme uses a method of partitioning where input image is divided into independent segments and each segment undergoes to visual cryptography encoding. The experimental results shows the efficacy of proposed system.

Key concepts: Visual cryptography, Secret sharing, Computer science, Cryptography, Decoding methods, Scheme (mathematics), Homomorphic secret sharing, Partition (number theory)

Related papers

Back to paper searchBrowse research topicsOriginal source
A partition based visual secret sharing schemes for large images — Research Paper | ScholarLens