期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2014
卷号：14
期号：6
页码：41-46
出版社：International Journal of Computer Science and Network Security
摘要：The (t, n) visual cryptography (VC) is a secret stacking of t-1 any out of transparencies reveals the sharing scheme where a secret image is encoded into transparencies, and the secret image. The stacking of or fewer transparencies is unable to extract any information about the secret. We discuss the additions and deletions of users in a dynamic user group. To reduce the overhead of generating and distributing transparencies in user changes, this paper proposes a (t,n) VC scheme with unlimited based on the probabilistic model. The proposed scheme 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. An equation is derived from the fundamental definitions of the (t,n) VC scheme, and then the VC scheme achieving maximal contrast can be designed by using the derived equation. The maximal contrasts with t=2 to 6 are explicitly solved in this paper.
关键词：Visual Cryptography(VC); Random Grids(RGs); Secret Sharing
; Contrast
