MATEC Web Conf.
Volume 71, 2016The International Conference on Computing and Precision Engineering (ICCPE 2015)
|Number of page(s)||4|
|Section||Computational and Mathematical Sciences|
|Published online||02 August 2016|
Towards Shift Tolerant Visual Secret Sharing Schemes without Pixel Expansion
1 Department of Computer Science & Information Engineering, National Chi Nan University, 54561 Nantou, Taiwan
2 School of Computer Science and Engineering, The University of Aizu, 965-8580 Fukushima, Japan
a Corresponding author: firstname.lastname@example.org
Naor and Shamir proposed the visual cryptography in 1995, they encrypted secret image into two meaningless random images, called shares, and 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 practical. Therefore, this paper presents the fault-tolerant schemes of stacking two shares which are acquired from secret image encryption without pixel expansion. The main idea of these schemes is combining several pixels to be a unit, then encrypting every unit into a specific combination of pixels. It makes visual secret sharing scheme more practical.
© The Authors, published by EDP Sciences, 2016
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.