Fault-Tolerant Visual Secret Sharing Schemes without Pixel Expansion

Applied Sciences

Justie Su-Tzu Juan¹  Yung-Chang Chen¹  Song Guo² 

[1] Department of Computer Science and Information Engineering, National Chi Nan University, Nantou 54561, Taiwan;School of Computer Science and Engineering, The University of Aizu, Fukushima 965-8580, Japan;

关键词: visual cryptography;    visual secret sharing;    random grid;    tolerance;    pixel expansion;   

DOI  :  10.3390/app6010018

来源: mdpi

【 摘 要 】

Visual cryptography encrypts a secret image into two meaningless random images, called shares, such that it can be decrypted by human vision without any calculations. However, there would be problems in alignment when these two shares are staked by hand in practice. Therefore, this paper presents the fault-tolerant schemes of stacking two shares that are acquired from secret image encryption without pixel expansion. The main idea of these schemes is to combine several pixels as a unit and then to encrypt each unit into a specific combination of pixels. Both theoretical analysis and simulation results demonstrate the effectiveness and practicality of the proposed schemes.

【 授权许可】

CC BY   
© 2016 by the authors; licensee MDPI, Basel, Switzerland.