Multi secret sharing scheme using iterative method

Abstract

Multi secret sharing is used to hide more than one secret information. In this approach secret information is divided in many parts and distributed among participants. Secret information may be in form of images also. Initially, Visual Cryptography (VC) applied for single secret images. After encryption process of VC, encrypted meaningless images are generated known as shares. Nowadays, multiple secret images may be secured by VC also. However, multi secret sharing schemes provide security to multiple images. Obtaining multiple images by using minimum number of shares is really an existing problem. Existing algorithms are limited to fix number of secret images with minimum number of shares. In this paper, we proposed an (2, n, m) multi secret sharing scheme in which exactly n share are generated to encode m secret images. If set of shares taken from qualified set then secret images revealed on the other hand set of shares taken from forbidden set than no information revealed. Minimum two shares are required to obtain one secret images and n or m+1 shares are used to obtain m multi secret images. Perfect alignment of shares between shares is not required to obtain secret image in the proposed technique.