Graph access structures with optimal pixel expansion three

DOI10.1016/J.IC.2013.07.002zbMath1433.94099OpenAlexW2071786639MaRDI QIDQ391637

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

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)

Related Items (1)

Visual cryptography scheme on graphs with $m^{*}(G)=4$

Cites Work

• Visual cryptography for general access structures
• New Results on Visual Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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