WCSE 2017
ISBN: 978-981-11-3671-9 DOI: 10.18178/wcse.2017.06.089

Fault-Tolerant Visual 2-Secrets Sharing Scheme

Jen-Yu Lin, Justie Su-Tzu Juan

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.

Index Terms— visual cryptography (VC), tolerant, multi-secret, pixel expansion

Jen-Yu Lin, Justie Su-Tzu Juan
National Chi Nan University, TAIWAN


Cite: Jen-Yu Lin, Justie Su-Tzu Juan, "Fault-Tolerant Visual 2-Secrets Sharing Scheme," Proceedings of 2017 the 7th International Workshop on Computer Science and Engineering, pp. 517-525, Beijing, 25-27 June, 2017.