SECURED IMAGE SHARING USING VISUAL CRYPTOGRAPHY

Abstract

Main benefit of this scheme is mathematical computation complexity is reduced to visual
cryptographic(VC) techniques. Each participant holds a transparency. Most of the previous research work
on visual cryptography focuses on two parameters: large pixel expansion and contrast. The number of sub
pixels (m) for converting each secret pixel, referred to as the pixel expansion, is the smaller the enhanced to
reduce the share size. The pixel expansion and relative contrast are the most critical measurements to assess
the effectiveness of a visual cryptography. In this paper, we studied VC in addition to Deterministic Visual
Cryptography (DVCS) can achieve the minimum pixel expansion and the maximal contrast. We develop a
novel and efficient construction for Random Grid and DVCS in this paper.The proposed Visual Cryptograms
of Random Grids model and deterministic model aims at the minimization of the pixel expansion and
maximal contrasts for individual VC. The Experimental results demonstrate the feasibility of our
construction. The pixel expansions and contrasts derived from our scheme are also better than the previous
results.