Downloads: 115 | Views: 178

Research Paper | Mathematics | India | Volume 3 Issue 5, May 2014 | Rating: 6.4 / 10

Rate This Article!

Study of (2; n) ? Threshold Visual Cryptography Scheme using Different Techniques

Maneesh Kumar ^[6]

Abstract: A visual cryptography scheme (VCS) for a set of n participants is a method to encode a secret image; consisting of black and white pixels; into n transparencies; one for each participant. Certain qualied subsets of participants can visually recover the secret image by stacking their transparencies; whereas; other; forbidden; subsets of participants; cannot gain any information about the secret image. Visual cryptography is a cryptographic paradigm introduced by Naor and Shamir. Some predened set of participants can decode a secret message (a black and white image) without any knowledge of cryptography and without performing any cryptographic computation: Their visual system will decode the message. In this paper; we define and analyze (2; n) visual cryptography schemes using different models.

Keywords: Visual Cryptography schemes, 2, n schemes, black and white images, encoding, optimal relative contrast

Edition: Volume 3 Issue 5, May 2014,

Pages: 1437 - 1442