Fault-Tolerant Visual 2-Secrets Sharing Scheme

Abstract

In 1994, Noar and Shamir proposed the basic visual secret sharing scheme (also called visual cryptography) to solve a part of the security problem. Visual cryptography is to encrypt a secret image into two meaningless random images, called shares, such that it can be decrypted by stacking these two shares without any calculations. In practice, there would be problems in alignment when staking these two shares by hand. Besides, share two secret images in the same time will enhance the functionality of the scheme. Therefore, this study proposed a new visual secret sharing scheme which encrypt two secret images into two shares in the same time, and it is not necessary to align the shares precisely. Both theoretical analysis and simulation results demonstrate the effectiveness and practicality of the proposed scheme.

Advanced fault-tolerant visual multi-secret sharing scheme

“…With respect to RG, Lin and Juan [25] proposed a visual two-secret sharing scheme with no pixel expansion; the scheme has fault-tolerant mechanisms and combines the advantages of Juan et al ' s scheme [22] and Chang and Juan' s scheme [14] . The encryption phase is divided into three parts, namely scale down, encryption, and tolerance.…”

“…In our scheme, we set 𝑢 = 7 and adopt the well-established design patterns in Juan and Chen' s scheme [23] to ensure misalignment tolerance. Since the transmittance of stacking results in Juan and Chen' s scheme [23] is better than those in Juan et al 's scheme [22] , we believe that using the patterns in Juan and Chen' s scheme [23] to design our algorithm will yield better results than Lin and Juan' s [25] .…”

“…On the basis of the ideas presented in Chang et al ' s scheme [15] , and Juan and Chen' s scheme [23] , we propose a more advanced scheme than Lin and Juan' s scheme [25] . Specifically, our proposed scheme uses design patterns [23] to ensure fault tolerance and encrypts multiple secret images by shifting the RG.…”

“…Encoding more than one image simultaneously is efficient with respect to time and space costs. Several studies have proposed and discussed schemes for encoding multiple images simultaneously [10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26][27] . The scheme proposed by Shyu [10] in 2009 is an extension of that proposed by Shyu [3] in 2007, which can encode two images simultaneously.…”

“…Although no pixel expansion occurred, they did not discuss a security analysis of their scheme. In 2016, Lin and Juan used the ideas described by Chang and Juan [14] in 2012, and Juan et al [22] in 2016 to propose an advanced scheme [25] that can encode two images into two shares, and the images can be reconstructed by stacking two imperfectly aligned shares. In the present paper, we combine the ideas presented by Chang et al [15] in 2018, and Juan and Chen [23] in 2018 and propose a faulttolerant multi-SSS that encodes more than two secret images into two shares simultaneously without pixel expansion.…”