On \({(k,n)^\ast}\)-visual cryptography scheme

DOI10.1007/S10623-012-9722-2zbMath1323.94097OpenAlexW1976574946MaRDI QIDQ2439750

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

Publication date: 17 March 2014

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

Full work available at URL: https://doi.org/10.1007/s10623-012-9722-2

zbMATH Keywords

pixel expansionrelative contraststrong access structurevisual cryptography scheme

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (4)

Constructions and analysis of some efficient \(t\)-\((k,n)^\ast\)-visual cryptographic schemes using linear algebraic techniques ⋮ Visual cryptographic schemes using combined Boolean operations ⋮ Perfect contrast XOR-based visual cryptography schemes via linear algebra ⋮ Maximal contrast color visual secret sharing schemes

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
• Visual cryptography schemes with optimal pixel expansion
• 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
• New Results on Visual Cryptography
• Progress in Cryptology - INDOCRYPT 2004
• Improved schemes for visual cryptography

This page was built for publication: On \({(k,n)^\ast}\)-visual cryptography scheme