Constructions and bounds for visual cryptography

DOI10.1007/3-540-61440-0_147MaRDI QIDQ4818854zbMATH OpenFDO

Authors Giuseppe Ateniese, Carlo Blundo, Alfredo De Santis, D. R. Stinson

Publication date 24 September 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61440-0_147

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Visual cryptography for general access structures
• Improved schemes for visual cryptography
• Visual cryptography schemes with optimal pixel expansion
• On the contrast in visual cryptography schemes
• Optimal colored threshold visual cryptography schemes

Cited in

(34)

• 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
• Extended capabilities for visual cryptography
• Randomness in secret sharing and visual cryptography schemes
• Optimal (k, n) visual cryptographic schemes for general k
• Maximal contrast color visual secret sharing schemes
• On \({(k,n)^\ast}\)-visual cryptography scheme
• Visual cryptography for general access structures
• Research on a novel construction of probabilistic visual cryptography scheme \((k, n, 0, 1, 1)\)-PVCS for threshold access structures
• Visual cryptography scheme for the mindom access structure of a graph
• On the pixel expansion of hypergraph access structures in visual cryptography schemes
• Measure-independent characterization of contrast optimal visual cryptography schemes
• Visual cryptography for grey level images
• Constructions and analysis of some efficient \(t\)-\((k,n)^\ast\)-visual cryptographic schemes using linear algebraic techniques
• Visual Cryptography on Graphs
• 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
• Visual cryptograms of random grids for threshold access structures
• Construction of a \((k,n)\)-visual cryptography scheme
• Visual cryptography scheme on graphs with \(m^*(G)=4\)
• On the construction of \((n,k)\)-schemes of visual cryptography using a class of linear hash functions over a binary field
• scientific article; zbMATH DE number 6741951 (Why is no real title available?)
• Comment on “Cheating Prevention in Visual Cryptography”
• Information and Communications Security
• A new approach to image sharing with high-security threshold structure
• Progress in Cryptology - INDOCRYPT 2004
• Topics in Cryptology – CT-RSA 2004
• The use of mathematical linguistic methods in creating secret sharing threshold algorithms
• Quantum meaningful visual cryptography
• Visual cryptography on graphs
• Optimal \((2, n )\) visual cryptographic schemes
• Extended visual cryptography schemes
• Bounds for visual cryptography schemes

This page was built for publication: Constructions and bounds for visual cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4818854)