Optimal (k, n) visual cryptographic schemes for general k
- 27 September 2009
- journal article
- Published by Springer Science and Business Media LLC in Designs, Codes and Cryptography
- Vol. 55 (1), 19-35
- https://doi.org/10.1007/s10623-009-9327-6
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Weakly secure visual secret sharing schemesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2008
- Applications of Partially Balanced Incomplete Block Designs in Developing (2,n) Visual Cryptographic SchemesIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2007
- Optimal (2, n) visual cryptographic schemesDesigns, Codes and Cryptography, 2006
- Proposal of an Asymptotically Contrast-Ideal (t, n)- Threshold Visual Secret Sharing SchemePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Contrast Optimal Threshold Visual Cryptography SchemesSIAM Journal on Discrete Mathematics, 2003
- Statistical Data Analysis Based on the L1-Norm and Related MethodsPublished by Springer Science and Business Media LLC ,2002
- Visual cryptography for grey level imagesInformation Processing Letters, 2000
- Contrast-optimal k out of n secret sharing schemes in visual cryptographyTheoretical Computer Science, 2000
- On the Contrast in Visual Cryptography SchemesJournal of Cryptology, 1999
- New Results on Visual CryptographyLecture Notes in Computer Science, 1996