New Results on Visual Cryptography

DOI10.1007/3-540-68697-5_30zbMath1329.94059OpenAlexW1589946980MaRDI QIDQ3452369

Stefan Droste

Publication date: 11 November 2015

Published in: Advances in Cryptology — CRYPTO ’96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-68697-5_30

zbMATH Keywords

visual cryptographysecret sharing schemesecret sharing problem

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (28)

Efficient visual secret sharing scheme for color images ⋮ Visual cryptography for grey level images ⋮ Constructions and analysis of some efficient \(t\)-\((k,n)^\ast\)-visual cryptographic schemes using linear algebraic techniques ⋮ Optimal \((k, n)\) visual cryptographic schemes for general \(k\) ⋮ Basic properties of the \((t,n)\)-threshold visual secret sharing scheme with perfect reconstruction of black pixels ⋮ Optimal \((2, n )\) visual cryptographic schemes ⋮ Image encryption by random grids ⋮ Visual cryptographic schemes using combined Boolean operations ⋮ Research on a novel construction of probabilistic visual cryptography scheme \((k, n, 0, 1, 1)\)-PVCS for threshold access structures ⋮ A reversible steganography scheme of secret image sharing based on cellular automata and least significant bits construction ⋮ Extended visual cryptography schemes ⋮ Graph access structures with optimal pixel expansion three ⋮ Linear algebraic techniques to construct monochrome visual cryptographic schemes for general access structure and its applications to color images ⋮ A perfect secret sharing scheme for general access structures ⋮ Visual cryptography on graphs ⋮ On \({(k,n)^\ast}\)-visual cryptography scheme ⋮ Visual cryptograms of random grids for threshold access structures ⋮ Construction of a \((k,n)\)-visual cryptography scheme ⋮ Almost-aspect-ratio-invariant visual cryptography without adding extra subpixels ⋮ Bounds for visual cryptography schemes ⋮ New visual cryptographic schemes derived from orthogonal and mixed orthogonal arrays ⋮ On general construction for extended visual cryptography schemes ⋮ A new definition of the contrast of visual cryptography scheme ⋮ The alignment problem of visual cryptography schemes ⋮ Image encryption by multiple random grids ⋮ Contrast-optimal k out of n secret sharing schemes in visual cryptography ⋮ XOR-based visual cryptography schemes ⋮ Extended capabilities for visual cryptography

Cites Work

• Unnamed Item
• Approximate inclusion-exclusion
• Simple Constructions of Almost k-wise Independent Random Variables

This page was built for publication: New Results on Visual Cryptography