Optimal (2, n) visual cryptographic schemes

  title={Optimal (2, n) visual cryptographic schemes},
  author={Mausumi Bose and Rahul Mukerjee},
  journal={Designs, Codes and Cryptography},
  • M. BoseR. Mukerjee
  • Published 1 September 2006
  • Mathematics, Computer Science
  • Designs, Codes and Cryptography
In (2,n) visual cryptographic schemes, a secret image(text or picture) is encrypted into n shares, which are distributed among n participants. The image cannot be decoded from any single share but any two participants can together decode it visually, without using any complex decoding mechanism. In this paper, we introduce three meaningful optimality criteria for evaluating different schemes and show that some classes of combinatorial designs, such as BIB designs, PBIB designs and regular graph… 

Optimal (k, n) visual cryptographic schemes for general k

It is shown how block designs can be used to construct VCS which achieve optimality with respect to the average and minimum relative contrasts but require much smaller pixel expansions than the existing ones.

Results on (2, n) Visual Cryptographic Scheme

A construction on an ideal contrast VCS using combined XOR and OR operations with less amount of transparencies than ideal contrast (2, n) VCS with reversing using OR and NOT operations is proposed.

Number theory based { k , n } Visual Cryptography Scheme For Color Images

The proposed secret sharing scheme ideal for transmitting color images over un-trusted, bandwidth limited communication channels and any subset of k or more participants can perfectly reconstruct the original image using their shares.

Construction of General (k, n) Probabilistic Visual Cryptography Scheme

This paper shows another construction of (k, n)-PVCS by extending the ( k, k-DVCS), which is a secure method that encrypts a secret image by subdividing it into shadow images.

On the Pixel Expansion of Visual Cryptography Scheme

This paper generalizes Ateniese et al.'s method of comparing the optimal pixel expansion of VCSs with two different access structures and derives constructive upper bounds derived by the graph decomposition technique.

A Probabilistic Model of $(t,n)$ Visual Cryptography Scheme With Dynamic Group

The maximal contrasts with t = 2 to 6 are explicitly solved in this paper and an equation derived from the fundamental definitions of the (t, n) VC scheme achieving maximal contrast can be designed by using the derived equation.

K out of K Extended Visual Cryptography Scheme by Random Grids

A Probabilistic Model of Visual Cryptography

An extended VC scheme based on basis matrices and a probabilistic model is proposed, and an equation derived from the fundamental definitions of the VC scheme achieving maximal contrast can be designed by using the derived equation.

On the Equivalence of Two Definitions of Visual Cryptography Scheme

The study shows that the above two definitions of basis matrix (k,n)-VCS are actually equivalent, and generalize the equivalence relation to general access structure basis matrix VCS and generalAccess structure size invariant VCS.



Applications of Partially Balanced Incomplete Block Designs in Developing (2, n) Visual Cryptographic Schemes

The aim of our paper is to show how Partially Balanced Incomplete Block Designs (PBIBD) may be used to construct (2,n) visual cryptographic schemes for black and white images with small pixel

Constructions and Bounds for Visual Cryptography

A visual cryptography scheme for a set P of n participants is a method to encode a secret image SI into n images in such a way that any participant in P receives one image and only qualified subsets

New Results on Visual Cryptography

A new principle of construction for k out of n secret sharing schemes is presented which is easy to apply and in most cases gives much better results than the former principlcs.

On the Contrast in Visual Cryptography Schemes

This paper analyzes the contrast of the reconstructed image in k out of n visual cryptography schemes and gives a complete characterization of schemes having optimal contrast and minimum pixel expansion in terms of certain balanced incomplete block designs.

Visual Cryptography

A new type of cryptographic scheme, which can decode concealed images without any cryptographic computations, is considered, which is perfectly secure and very easy to implement.

Visual cryptography for grey level images

Partially balanced incomplete block designs with two associate classes and two treatments per block

In physical science experimentation the experimental material may divide naturally into groups of two objects (treatments) each . Thus, the experimental arrangement will involve what is known in the

Fractional Factorial Plans

Fractional Plans and Orthogonal Arrays. Symmetric Orthogonal Arrays. Asymmetric Orthogonal Arrays. Some Results on Nonexistence. More on Optimal Fractional Plans and Related Topics. Trend-Free Plans

Experiments: Planning, Analysis, and Parameter Design Optimization

This work discusses the practice of problem solving, testing hypotheses about statistical parameters, calculating and interpreting confidence limits, tolerance limits and prediction limits, and setting up and interpreting control charts.

Theory of block designs

Introduction Some Mathematical and Statistical Results General Properties of Block Designs Balanced Incomplete Block Designs - Properties and Analysis Construction and Existence of Balanced