Optimal \((2, n )\) visual cryptographic schemes
type: Item
instance of: scholarly article
title: Optimal \((2, n )\) visual cryptographic schemes
zbMATH Open document ID: 1202.94175
author: Mausumi Bose
author: Rahul Mukerjee
published in: Designs, Codes and Cryptography
publication date: 2006-11-22T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 05B05
zbMATH DE Number: 5075349
zbMATH Keywords: Pixel expansion
zbMATH Keywords: Regular graph design
zbMATH Keywords: Relative contrast
zbMATH Keywords: Share
MaRDI profile type: Publication
full work available at URL: s10623-006-0011-9
OpenAlex ID: W2015427393
cites work: On the contrast in visual cryptography schemes
cites work: Visual cryptography for grey level images
cites work: New Results on Visual Cryptography
cites work: Q4365722
DOI: 10.1007/S10623-006-0011-9
Recommended article: Optimal \((k, n)\) visual cryptographic schemes for general \(k\)
Recommended article: Construction of a \((k,n)\)-visual cryptography scheme
Recommended article: On \({(k,n)^\ast}\)-visual cryptography scheme
Recommended article: Q4818854
Recommended article: Bounds for visual cryptography schemes
Recommended article: Optimal colored threshold visual cryptography schemes
Recommended article: On the Equivalence of Two Definitions of Visual Cryptography Scheme
Recommended article: Contrast-optimal k out of n secret sharing schemes in visual cryptography
Recommended article: Visual cryptography schemes with optimal pixel expansion
Recommended article: On the contrast in visual cryptography schemes
description: scientific article; zbMATH DE number 5075349