A Novel XOR-Based Threshold Visual Cryptography with Adjustable Pixel Expansion
TLDR
A pixel expansion adjustable ( k , n ) -XVC scheme, which allows pixel expansion to be changed among 2 k - 1 - 1 different values, which can ensure each pixel being exactly recovered with the same average contrast no matter it takes any pixel expansion value.Abstract:
A ( k , n ) visual cryptography (VC) scheme encodes a secret image into n shadows that are printed on transparencies distributed among a group of n participants secretly, and reveal the secret image by stacking no less than k of them. Its decryption requires no computation and attracts much attention in image security applications. The pixel expansion and contrast are two important characteristics to evaluate the visual quality of the revealed secret image for a ( k , n ) -VC scheme. The ( k , n ) XOR-based VC (XVC) schemes can greatly improve the visual quality including both pixel expansion and contrast. Previous methods require complex computation and result in high pixel expansion when they are used to construct such schemes. In this paper, we propose a pixel expansion adjustable ( k , n ) -XVC scheme, which allows pixel expansion to be changed among 2 k - 1 - 1 different values. It can ensure each pixel being exactly recovered with the same average contrast no matter it takes any pixel expansion value. The least pixel expansion is much smaller than previous schemes. Our scheme can be easily implemented based on any conventional OR-based ( k , n ) -VC (OVC) scheme.read more
Citations
More filters
Journal ArticleDOI
An overview of visual cryptography techniques
TL;DR: Over 40 visual cryptography schemes that have been proposed in the past two decades were analyzed and compared and indicate that existing problems such as pixel expansion, poor quality of recovered image quality, computational and memory complexities still exist and a optimizing the trade-off between these requirements still requires further investigation.
Journal ArticleDOI
An efficient XOR-based visual cryptography scheme with lossless reconfigurable algorithms
TL;DR: An efficient XOR-based visual cryptography scheme with lossless reconfigurable algorithms, which includes an encryption and a decryption schemes for gray-scale and color secret images that can reconstruct the secret images with only a series of XOR operations.
Journal ArticleDOI
Secure Online Voting System using Visual Cryptography
TL;DR: In this paper, a secure online voting system using visual cryptography is proposed, where visual information can be encrypted on the user side, with the information decrypted on the admin side, which can be helpful in allowing participation in voting systems securely and ensuring fast vote counting and monitoring of the voting process.
Proceedings ArticleDOI
A Secured Lossless Visual Secret Sharing for Color Images Using Arnold Transform
Journal ArticleDOI
XOR-Based (n, n) Visual Cryptography Schemes for Grayscale or Color Images with Meaningful Shares
Yu-Hong Chen,Justie Su-Tzu Juan +1 more
TL;DR: A new XOR-based Visual Cryptography Scheme for grayscale or a color secret image that encrypts the secretgrayscale (or color) image into n meaningfulGrayscale shares, which can import n difference cover images and can be completely restored.
References
More filters
Journal Article
Visual authentication and identification
Moni Naor,Benny Pinkas +1 more
TL;DR: In this paper, the authors introduce visual authentication and visual identification methods, which are authentication and identification methods for human users based on visual cryptography and can be implemented using very common low-tech technology.
Journal ArticleDOI
Two secret sharing schemes based on Boolean operations
TL;DR: A probabilistic (2,n) scheme for binary images and a deterministic (n,n), which provides a better contrast and significantly smaller recognized areas than other methods and gives an exact reconstruction.
Journal ArticleDOI
XOR-based Visual Cryptography Schemes
TL;DR: This paper investigates Threshold Visual Secret Sharing schemes associated to XOR-based VC systems, and shows that n out of n schemes with optimal resolution and contrast exist, and that (2,n) schemes are equivalent to binary codes.
Journal ArticleDOI
Step Construction of Visual Cryptography Schemes
Feng Liu,Chuankun Wu,Xi-Jun Lin +2 more
TL;DR: This paper proposes a step construction to construct VCSOR and VCSXOR for general access structure by applying (2,2)-VCS recursively, where a participant may receive multiple share images.
Journal ArticleDOI
Optimum Pixel Expansions for Threshold Visual Secret Sharing Schemes
TL;DR: This paper model the minimization of the pixel expansion in a (k, n)-VCS into an integer linear program to acquire the optimum solution and demonstrates that the program is simple, effective to obtain the optimum Solution and flexible for coping with various types of ( k, n-VCSs.
Related Papers (5)
Visual cryptography schemes with perfect reconstruction of black pixels
Carlo Blundo,Alfredo De Santis +1 more