Bounds for visual cryptography schemes

DOI10.1016/J.DAM.2009.12.005zbMATH Open1185.94078OpenAlexW2123824408MaRDI QIDQ968192FDOQ968192

Abbas Cheraghi, Hossein Hajiabolhassan

Publication date: 5 May 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.12.005

zbMATH Keywords

contrasthypergraphpixel expansionvisual cryptographysecret sharing schemebasis matrices

Mathematics Subject Classification ID

Cryptography (94A60) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Graph homomorphisms through random walks
• Title not available (Why is that?)
• A bound on the strong chromatic index of a graph
• Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes
• On the contrast in visual cryptography schemes
• Visual cryptography for general access structures
• New Results on Visual Cryptography
• Contrast Optimal Threshold Visual Cryptography Schemes
• Contrast-optimal k out of n secret sharing schemes in visual cryptography
• Title not available (Why is that?)
• Visual cryptography schemes with optimal pixel expansion
• A new approach for visual cryptography
• Title not available (Why is that?)

Cited In (3)

• Visual cryptography scheme on graphs with $m^{*}(G)=4$
• The alignment problem of visual cryptography schemes
• Optimal \((2, n )\) visual cryptographic schemes

   Recommendations

• Title not available (Why is that?) 👍 👎
• Visual cryptography schemes with optimal pixel expansion 👍 👎
• Title not available (Why is that?) 👍 👎
• Visual cryptography for general access structures 👍 👎
• Visual cryptography on graphs 👍 👎

This page was built for publication: Bounds for visual cryptography schemes

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