Journal ArticleDOI
Friendly progressive visual secret sharing using generalized random grids
Reads0
Chats0
TLDR
Using generalized random grids for visual secret sharing, friendly meaningful transparencies, also called shares, can be generated, and the size of each share is the same with the secret image size.Abstract:
A random grid is a two-dimensional binary array in which entries, 0 or 1, are determined in 50% to 50%. A generalized random grid is also a 2-D binary array in which entries are determined but not necessarily 50% to 50%. Using generalized random grids for visual secret sharing, friendly meaningful transparencies, also called shares, can be generated, and the size of each share is the same with the secret image size. In the decoding phase, stacking at least two friendly meaningful shares together, the content of the secret image can be revealed without any computation, and the more shares stacked, the clearer the result. The proposed method can also be implemented for gray and color images.read more
Citations
More filters
Journal ArticleDOI
Threshold visual secret sharing by random grids
Tzung-Her Chen,Kai-Hsiang Tsao +1 more
TL;DR: A threshold RG-based VSS scheme aiming at providing the wide-use version is presented, and the experimental results and theoretically analysis in visual quality and security show that the proposed scheme performs well.
Journal ArticleDOI
Block-based progressive visual secret sharing
TL;DR: A non-expanded block-based progressive visual secret sharing scheme with noise-like and meaningful shares with several advantages over other related methods, including one that is more suitable for grayscale and color secret images.
Journal ArticleDOI
A discussion on the relationship between probabilistic visual cryptography and random grid
TL;DR: The probabilistic VCS without pixel expansion is used, to study the construction and performance of RG, and it is pointed out that RG and PVCS have no difference other than the terminology, which is a subset of PVCSs.
Journal ArticleDOI
Tagged Visual Cryptography
Ran-Zan Wang,Shuo-Fang Hsu +1 more
TL;DR: This letter presents a method for implementing visual cryptography in which an additional tag is attached to each generated share, which provides users with supplementary information such as augmented message or distinguishable patterns to identify the shares.
Journal ArticleDOI
XOR-based progressive visual secret sharing using generalized random grids
Her-Chang Chao,Tzuo-Yau Fan +1 more
TL;DR: Experimental results reveal that the proposed XOR-based progressive visual secret sharing scheme is superior to existing approaches with respect to performance and practicability.
References
More filters
Visual Cryptography
Moni Naor,Adi Shamir +1 more
TL;DR: In this paper, a new type of cryptographic scheme, which can decode concealed images without any cryptographic computations, is proposed, which is called k-out-of-n secret sharing.
Journal ArticleDOI
New visual secret sharing schemes using probabilistic method
TL;DR: The frequency of white pixels is used to show the contrast of the recovered image and the scheme is nonexpansible and can be easily implemented on a basis of conventional VSS scheme.
Journal ArticleDOI
Image encryption by random grids
TL;DR: This paper designs algorithms by using random grids to accomplish the encryption of the secret gray-level and color images in such a way that neither of the two encrypted shares alone leaks the information of thesecret image, whereas the secret can be seen when these two shares are superimposed.
Journal ArticleDOI
Friendly progressive visual secret sharing
TL;DR: This new method simplifies the management of multi-secret sharing and has all the advantages of traditional visual sharing combined with visual cryptography, namely fast decoding, lossless and prevention of secret disclosure without collecting enough shares.
Journal ArticleDOI
Hiding a picture in two pictures
Ren-Junn Hwang,Chin-Chen Chang +1 more
TL;DR: This picture hiding scheme can be used to construct a human identification scheme, which is particularly appropriate when delicate computer devices or instruments for identification are expensive and can apply to resolve the watermarking problem.