Visual cryptography on graphs

DOI10.1007/S10878-009-9241-XMaRDI QIDQ626454zbMATH OpenOpenAlexFDO

Authors Steve Lu, Daniel Manchala, Rafail Ostrovsky

Publication date 18 February 2011

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1007/s10878-009-9241-x

zbMATH Keywords

graph decompositionmulti-secret sharing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Recommendations

• Visual Cryptography on Graphs
• Visual cryptography for general access structures
• scientific article; zbMATH DE number 2102766
• New Results on Visual Cryptography
• Visual cryptography schemes with optimal pixel expansion

Cites work

• scientific article; zbMATH DE number 4179276 (Why is no real title available?)
• scientific article; zbMATH DE number 512874 (Why is no real title available?)
• scientific article; zbMATH DE number 2102766 (Why is no real title available?)
• scientific article; zbMATH DE number 1406777 (Why is no real title available?)
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• Decomposition constructions for secret-sharing schemes
• Extended capabilities for visual cryptography
• Extended visual cryptography schemes
• Graph decompositions and secret sharing schemes
• How to share a secret
• Multi secret image color visual cryptography schemes for general access structures\(^{*}\)
• New Results on Visual Cryptography
• Sharing one secret vs. sharing many secrets.
• Tight bounds on the information rate of secret sharing schemes
• Visual cryptography for general access structures
• Visual cryptography schemes with optimal pixel expansion

Cited in

(7)

• scientific article; zbMATH DE number 7539937 (Why is no real title available?)
• Shift visual cryptography scheme of two secret images.
• Bounds for visual cryptography schemes
• Visual Cryptography on Graphs
• Measure-independent characterization of contrast optimal visual cryptography schemes
• Visual cryptography scheme on graphs with \(m^*(G)=4\)
• LEXICOGRAPHIC LABELED GRAPHS IN CRYPTOGRAPHY

This page was built for publication: Visual cryptography on graphs

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