Construction of a \((k,n)\)-visual cryptography scheme

DOI10.1007/s10623-016-0181-zzbMath1370.94523OpenAlexW2275257283MaRDI QIDQ510417

S. Arumugam, R. Lakshmanan

Publication date: 17 February 2017

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-016-0181-z

zbMATH Keywords

pixel expansionrelative contrastvisual cryptography scheme

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

On the Construction of (n, k)-schemes of Visual Cryptography Using a Class of Linear Hash Functions Over a Binary Field

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Basic properties of the \((t,n)\)-threshold visual secret sharing scheme with perfect reconstruction of black pixels
• Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes
• Contrast-optimal k out of n secret sharing schemes in visual cryptography
• On the contrast in visual cryptography schemes
• Optimal \((k, n)\) visual cryptographic schemes for general \(k\)
• Visual cryptography for general access structures
• A Course in Enumeration
• New Results on Visual Cryptography
• Contrast Optimal Threshold Visual Cryptography Schemes
• Progress in Cryptology - INDOCRYPT 2004
• Threshold visual cryptography schemes with specified whiteness levels of reconstructed pixels
• Improved schemes for visual cryptography

This page was built for publication: Construction of a \((k,n)\)-visual cryptography scheme