Graph access structures with optimal pixel expansion three

DOI10.1016/J.IC.2013.07.002MaRDI QIDQ391637zbMATH OpenOpenAlexFDO

Authors S. Arumugam, Atulya K. Nagar, R. Lakshmanan

Publication date 10 January 2014

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2013.07.002

zbMATH Keywords

pixel expansionrelative contraststrong access structurevisual cryptography scheme

Mathematics Subject Classification ID

Applications of graph theory (05C90) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• On the pixel expansion of hypergraph access structures in visual cryptography schemes
• Visual cryptography scheme on graphs with \(m^*(G)=4\)
• Visual cryptography scheme for the mindom access structure of a graph
• Bounds for visual cryptography schemes
• Visual Cryptography on Graphs

Cites work

• scientific article; zbMATH DE number 2131198 (Why is no real title available?)
• scientific article; zbMATH DE number 1088898 (Why is no real title available?)
• scientific article; zbMATH DE number 2102766 (Why is no real title available?)
• New Results on Visual Cryptography
• Visual cryptography for general access structures
• Visual cryptography scheme for the mindom access structure of a graph

Cited in

(4)

• On the pixel expansion of hypergraph access structures in visual cryptography schemes
• Visual cryptography scheme on graph access structures with optimal pixel expansion four
• Visual cryptography scheme for the mindom access structure of a graph
• Visual cryptography scheme on graphs with \(m^*(G)=4\)

This page was built for publication: Graph access structures with optimal pixel expansion three

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