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

DOI10.1007/S10623-009-9327-6zbMATH Open1197.94179OpenAlexW2040990631MaRDI QIDQ2380397FDOQ2380397

Authors: Mausumi Bose, Rahul Mukerjee 

Publication date: 26 March 2010

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

Full work available at URL: https://doi.org/10.1007/s10623-009-9327-6

Recommendations

• Contrast Optimal Threshold Visual Cryptography Schemes
• On the contrast in visual cryptography schemes
• Contrast-optimal k out of n secret sharing schemes in visual cryptography
• Improved schemes for visual cryptography
• Optimal \((2, n )\) visual cryptographic schemes

zbMATH Keywords

block designpixel expansionrelative contrastKronecker algebra\(L_1\) normprogressive optimalityunbalanced visual cryptographic scheme

Mathematics Subject Classification ID

Cryptography (94A60) Combinatorial aspects of block designs (05B05) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Title not available (Why is that?)
• A modern theory of factorial designs.
• Title not available (Why is that?)
• On the contrast in visual cryptography schemes
• Visual cryptography for grey level images
• New Results on Visual Cryptography
• Title not available (Why is that?)
• Contrast Optimal Threshold Visual Cryptography Schemes
• Title not available (Why is that?)
• Statistical data analysis based on the \(L_1\)-norm and related methods. With the technical assistance of Giuseppe Melfi. Papers of the 4th international conference on statistical analysis on the \(L_1\)-norm and related methods, Neuchâtel, Switzerland, August 4--9, 2002
• Contrast-optimal k out of n secret sharing schemes in visual cryptography
• Basic properties of the \((t,n)\)-threshold visual secret sharing scheme with perfect reconstruction of black pixels
• Optimal \((2, n )\) visual cryptographic schemes
• A Table of Difference Sets Generating Balanced Incomplete Block Designs

Cited In (14)

• Multi-pixel encryption visual cryptography
• On the construction of \((n,k)\)-schemes of visual cryptography using a class of linear hash functions over a binary field
• Almost-aspect-ratio-invariant visual cryptography without adding extra subpixels
• Constructions and analysis of some efficient \(t\)-\((k,n)^\ast\)-visual cryptographic schemes using linear algebraic techniques
• Linear algebraic techniques to construct monochrome visual cryptographic schemes for general access structure and its applications to color images
• Contrast optimal XOR based visual cryptographic schemes
• On the equivalence of two definitions of visual cryptography scheme
• Measure-independent characterization of contrast optimal visual cryptography schemes
• On \((k,n)\) visual cryptography scheme with\( t\) essential parties
• Title not available (Why is that?)
• Title not available (Why is that?)
• On \({(k,n)^\ast}\)-visual cryptography scheme
• Construction of a \((k,n)\)-visual cryptography scheme
• Optimal \((2, n )\) visual cryptographic schemes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380397)