Bounds for visual cryptography schemes

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

Authors Hossein Hajiabolhassan, Abbas Cheraghi

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)

Recommendations

• On the pixel expansion of hypergraph access structures in visual cryptography schemes
• Visual cryptography schemes with optimal pixel expansion
• scientific article; zbMATH DE number 2102766
• Visual cryptography for general access structures
• Visual cryptography on graphs

Cites work

• scientific article; zbMATH DE number 2076151 (Why is no real title available?)
• scientific article; zbMATH DE number 2117181 (Why is no real title available?)
• scientific article; zbMATH DE number 1445313 (Why is no real title available?)
• A bound on the strong chromatic index of a graph
• A new approach for visual cryptography
• Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes
• Contrast Optimal Threshold Visual Cryptography Schemes
• Contrast-optimal k out of n secret sharing schemes in visual cryptography
• Graph homomorphisms through random walks
• New Results on Visual Cryptography
• On the contrast in visual cryptography schemes
• Visual cryptography for general access structures
• Visual cryptography schemes with optimal pixel expansion

Cited in

(5)

• Graph access structures with optimal pixel expansion three
• Optimal \((2, n )\) visual cryptographic schemes
• On the pixel expansion of hypergraph access structures in visual cryptography schemes
• Visual cryptography scheme on graphs with \(m^*(G)=4\)
• The alignment problem of visual cryptography schemes

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)