Optimal \((2, n )\) visual cryptographic schemes

DOI10.1007/S10623-006-0011-9zbMath1202.94175OpenAlexW2015427393MaRDI QIDQ851754

Mausumi Bose, Rahul Mukerjee

Publication date: 22 November 2006

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

Full work available at URL: https://doi.org/10.1007/s10623-006-0011-9

zbMATH Keywords

Pixel expansionRegular graph designRelative contrastShare

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Cryptography (94A60)

Related Items (1)

Optimal \((k, n)\) visual cryptographic schemes for general \(k\)

Cites Work

• Unnamed Item
• Visual cryptography for grey level images
• On the contrast in visual cryptography schemes
• New Results on Visual Cryptography

This page was built for publication: Optimal \((2, n )\) visual cryptographic schemes