A Construction of a Visual Secret Sharing Scheme for Plural Secret Images and its Basic Properties

In this paper we discuss construction of the visual secret sharing scheme for plural secret images. We first consider generation of n shares for given two secret image SI(1) and SI(2). For i = 1,2, while no information of SI(i) is revealed from any less than n - 2 + i shaxes, SI(i) is visually recovered by the superimposition of arbitrary n - 2 + i shares. We define a new class of basis matrices used for generation of the n shares and give a simple construction of such basis matrices. In addition, a fundamental bound on the contrasts of SI(1) and SI(2) is established. These results axe extended to the case where we have more than two secret images.