A Probabilistic Essential Visual Cryptographic Scheme for Plural Secret Images

Abstract

In order to reduce the pixel expansion of visual cryptography scheme (VCS), many probabilistic schemes were proposed. Let P = {P 1,P 2,P 3,...,P n} be the set of participants. The minimal qualified set for essential VCS is given by Γ0={A: A ⊆ P, P 1 ∈ A and {pipe}A{pipe} = k}. In this paper we propose a construction of probabilistic essential VCS for sharing plural secret images simultaneously. © Springer International Publishing Switzerland 2014.