A novel approach of visual cryptography (T,N) scheme with dynamic group

Visual cryptography (VC) Scheme is a secret sharing scheme where a secret image is encoded into transparencies, and the stacking of any out of transparencies reveals the secret image. The stacking of or fewer transparencies is unable to extract any information about the secret data. We discuss the additions and deletions of users in a dynamic group. To reduce overhead of generating and distributing transparencies in user change, this paper proposes a VC scheme with unlimited based on the probabilistic model. The proposed model allows to change dynamically in order to include new transparencies without regenerating and redistributing the original transparencies. Specifically, an extended VC scheme based on basis matrices and a probabilistic model is proposed in the system. An equation is derived from the fundamental definitions of the VC scheme, and then the VC scheme achieving maximal contrast can be designed by using the derived equation. The maximal contrasts are explicitly solved in this developed paper.