Optimal (2,n) and (2,infinity) visual secret sharing by generalized random grids

Authors:
Shang-Kuan Chen;Sian-Jheng Lin
Affiliations:
Department of Computer Science and Information Engineering, Yuanpei University, Hsinchu, Taiwan;Research Center for Information Technology Innovation, Academia Sinica, Taipei, Taiwan
Venue:
Journal of Visual Communication and Image Representation
Year:
2012

Citing 10
Cited 1

Visual cryptography for general access structures

Information and Computation
Extended capabilities for visual cryptography

Theoretical Computer Science
Contrast-optimal k out of n secret sharing schemes in visual cryptography

Theoretical Computer Science - computing and combinatorics
New visual secret sharing schemes using probabilistic method

Pattern Recognition Letters
Aspect ratio invariant visual secret sharing schemes with minimum pixel expansion

Pattern Recognition Letters
Probabilistic Visual Cryptography Schemes

The Computer Journal
Image encryption by random grids

Pattern Recognition
Image encryption by multiple random grids

Pattern Recognition
Visual secret sharing by random grids revisited

Pattern Recognition
Probabilistic visual secret sharing schemes for grey-scale images and color images

Information Sciences: an International Journal

Random grid-based visual secret sharing with abilities of OR and XOR decryptions

Journal of Visual Communication and Image Representation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on generalized random grids, this paper proposes two visual cryptography methods denoted as (2,n) GRG and (2,infinity) GRG. The (2,n) GRG is suitable for the pre-decided number of shares, and the (2,infinity) method is suitable for the adjustable number of shares. The proposed (2,n) GRG achieves better contrast on the stacking result, and the proposed (2,infinity) GRG enables extending the number of shares anytime. Based on the definition of contrast in Shyu's work in 2007, we also demonstrate that the stacking result of (2,n) GRG is close to the theoretical bound of the contrast, and the stacking result of (2,infinity) GRG achieves the theoretical bound of the contrast.