Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes

DOI10.1023/A:1008280705142zbMath0878.94049MaRDI QIDQ1358676

Henk C. A. van Tilborg, Eric R. Verheul

Publication date: 18 December 1997

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

arcsMDS codesvisual cryptographysecret sharing schemes

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (41)

Efficient visual secret sharing scheme for color images ⋮ Ideal contrast visual cryptography schemes with reversing ⋮ Visual cryptography for grey level images ⋮ Constructions and analysis of some efficient \(t\)-\((k,n)^\ast\)-visual cryptographic schemes using linear algebraic techniques ⋮ Two secret sharing schemes based on Boolean operations ⋮ Boolean Composition of Visual Secret Sharing Schemes ⋮ Basic properties of the \((t,n)\)-threshold visual secret sharing scheme with perfect reconstruction of black pixels ⋮ Image encryption by random grids ⋮ Perfect contrast XOR-based visual cryptography schemes via linear algebra ⋮ Color visual cryptography schemes for black and white secret images ⋮ Measure-Independent Characterization of Contrast Optimal Visual Cryptography Schemes ⋮ Maximal contrast color visual secret sharing schemes ⋮ Linear algebraic techniques to construct monochrome visual cryptographic schemes for general access structure and its applications to color images ⋮ Extended color visual cryptography for black and white secret image ⋮ On \({(k,n)^\ast}\)-visual cryptography scheme ⋮ Meaningful share generation for increased number of secrets in visual secret-sharing scheme ⋮ Coloured visual cryptography using fixed size meaningful share ⋮ Visual cryptograms of random grids for threshold access structures ⋮ Colored visual cryptography scheme based on additive color mixing ⋮ Visual secret sharing for multiple secrets ⋮ A discussion on the relationship between probabilistic visual cryptography and random grid ⋮ Construction of a \((k,n)\)-visual cryptography scheme ⋮ Bounds for visual cryptography schemes ⋮ Optimal colored threshold visual cryptography schemes ⋮ Probabilistic visual secret sharing schemes for grey-scale images and color images ⋮ Visual multiple secret sharing based upon turning and flipping ⋮ A secure scheme to share secret color images ⋮ Reduce shadow size in aspect ratio invariant visual secret sharing schemes using a square block-wise operation ⋮ On general construction for extended visual cryptography schemes ⋮ A general method for construction of \((t, n)\)-threshold visual secret sharing schemes for color images ⋮ Probabilistic (n, n) Visual Secret Sharing Scheme for Grayscale Images ⋮ A new definition of the contrast of visual cryptography scheme ⋮ New extended visual cryptography schemes with clearer shadow images ⋮ Sharing multiple secrets in visual cryptography ⋮ Visual cryptography scheme on graphs with $m^{*}(G)=4$ ⋮ Image encryption by multiple random grids ⋮ Colored visual cryptography without color darkening ⋮ MTVSS: (M)isalignment (T)olerant (V)isual (S)ecret (S)haring on resolving alignment difficulty ⋮ Randomness in secret sharing and visual cryptography schemes ⋮ XOR-based visual cryptography schemes ⋮ Extended capabilities for visual cryptography

This page was built for publication: Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes