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

DOI10.1007/S10623-009-9327-6MaRDI QIDQ2380397zbMATHOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 1088898 (Why is no real title available?)
• scientific article; zbMATH DE number 3453625 (Why is no real title available?)
• scientific article; zbMATH DE number 2102766 (Why is no real title available?)
• scientific article; zbMATH DE number 3352656 (Why is no real title available?)
• A Table of Difference Sets Generating Balanced Incomplete Block Designs
• A modern theory of factorial designs.
• Basic properties of the \((t,n)\)-threshold visual secret sharing scheme with perfect reconstruction of black pixels
• Contrast Optimal Threshold Visual Cryptography Schemes
• Contrast-optimal k out of n secret sharing schemes in visual cryptography
• New Results on Visual Cryptography
• On the contrast in visual cryptography schemes
• Optimal \((2, n )\) visual cryptographic schemes
• 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
• Visual cryptography for grey level images

Cited in

(14)

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

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)