Last update: Sun Mar 31 02:13:37 MDT 2019
@Article{Cimato:2006:PVC,
author = "S. Cimato and R. {De Prisco} and A. {De Santis}",
title = "Probabilistic Visual Cryptography Schemes",
journal = j-COMP-J,
volume = "49",
number = "1",
pages = "97--107",
month = jan,
year = "2006",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxh152",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Dec 21 17:38:55 MST 2005",
bibsource = "http://comjnl.oxfordjournals.org/content/vol49/issue1/index.dtl;
http://www.math.utah.edu/pub/tex/bib/compj2000.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/content/abstract/49/1/97;
http://comjnl.oxfordjournals.org/cgi/content/full/49/1/97;
http://comjnl.oxfordjournals.org/cgi/reprint/49/1/97",
abstract = "Visual cryptography schemes allow the encoding of a
secret image, consisting of black or white pixels, into
$n$ shares which are distributed to the participants.
The shares are such that only qualified subsets of
participants can `visually' recover the secret image.
The secret pixels are shared with techniques that
subdivide each secret pixel into a certain number $m$,
$m \geq 2$ of subpixels. Such a parameter $m$ is called
pixel expansion. Recently Yang introduced a
probabilistic model. In such a model the pixel
expansion $m$ is $1$, that is, there is no pixel
expansion. The reconstruction of the image however is
probabilistic, meaning that a secret pixel will be
correctly reconstructed only with a certain
probability. In this paper we propose a generalization
of the model proposed by Yang. In our model we fix the
pixel expansion $m \geq 1$ that can be tolerated and we
consider probabilistic schemes attaining such a pixel
expansion. For $m = 1$ our model reduces to the one of
Yang. For big enough values of $m$, for which a
deterministic scheme exists, our model reduces to the
classical deterministic model. We show that between
these two extremes one can trade the probability factor
of the scheme with the pixel expansion. Moreover, we
prove that there is a one-to-one mapping between
deterministic schemes and probabilistic schemes with no
pixel expansion, where contrast is traded for the
probability factor.",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}