Multiple-secret visual cryptography scheme (MVCS) and fully incrementing visual cryptography scheme (FIVCS) have the same functionality that different secrets are gradually revealed by stacking different numbers of shadows. In essence,… Click to show full abstract
Multiple-secret visual cryptography scheme (MVCS) and fully incrementing visual cryptography scheme (FIVCS) have the same functionality that different secrets are gradually revealed by stacking different numbers of shadows. In essence, MVCS and FIVCS are the same. However, both of the two schemes suffer from large pixel expansion and deteriorated reconstructed image quality. In addition, MVCS and FIVCS require intensive computations to create base matrices. In this research, we exploit the capacity of sharing multiple secrets in XOR-based VCS (XVCS). First of all, three efficient base matrix constructions are proposed for realizing the
               
Click one of the above tabs to view related content.