Fault-Tolerant Visual Secret Sharing Schemes without Pixel Expansion
AbstractVisual 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. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Juan, J.S.-T.; Chen, Y.-C.; Guo, S. Fault-Tolerant Visual Secret Sharing Schemes without Pixel Expansion. Appl. Sci. 2016, 6, 18.
Juan JS-T, Chen Y-C, Guo S. Fault-Tolerant Visual Secret Sharing Schemes without Pixel Expansion. Applied Sciences. 2016; 6(1):18.Chicago/Turabian Style
Juan, Justie S.-T.; Chen, Yung-Chang; Guo, Song. 2016. "Fault-Tolerant Visual Secret Sharing Schemes without Pixel Expansion." Appl. Sci. 6, no. 1: 18.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.