Simulating BPP using a general weak random source
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Some improved bounds on the information rate of perfect secret sharing schemes
Journal of Cryptology
Visual cryptography for general access structures
Information and Computation
Randomness in distribution protocols
Information and Computation
Constructions and Properties of k out of nVisual Secret Sharing Schemes
Designs, Codes and Cryptography
Communications of the ACM
Cryptography: Theory and Practice
Cryptography: Theory and Practice
Improved Schemes for Visual Cryptography
Designs, Codes and Cryptography
Contrast Optimal Threshold Visual Cryptography Schemes
SIAM Journal on Discrete Mathematics
Constructions and Bounds for Visual Cryptography
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography
COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
Generalized Secret Sharing and Monotone Functions
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Secret Sharing and Visual Cryptography Schemes
IFIP/Sec '01 Proceedings of the IFIP TC11 Sixteenth Annual Working Conference on Information Security: Trusted Information: The New Decade Challenge
Ideal contrast visual cryptography schemes with reversing
Information Processing Letters
A visual cryptography based system for sharing multiple secret images
ISCGAV'07 Proceedings of the 7th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision
Ideal contrast visual cryptography schemes with reversing
Information Processing Letters
Journal of Visual Communication and Image Representation
On converting secret sharing scheme to visual secret sharing scheme
EURASIP Journal on Advances in Signal Processing - Special issue on advanced image processing for defense and security applications
Compatible ideal contrast visual cryptography schemes with reversing
ISC'05 Proceedings of the 8th international conference on Information Security
Real perfect contrast visual secret sharing schemes with reversing
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
| Hi-index | 5.23 |
Secret sharing schemes allow a secret to be shared among a group of participants so that only qualified subsets of participants can recover the secret. A visual cryptography scheme (VCS) is a special kind of secret sharing scheme in which the secret to share consists of an image and the shares consist of xeroxed transparencies which are stacked to recover the shared image.In this paper, we analyze the relationship between secret sharing schemes and VCSs, focusing our attention on the amount of randomness required to generate the shares. We prove that secret sharing schemes for a set of secrets of size two (BSSs) and VCSs are "equivalent" with respect to the randomness. Indeed, we show how to transform a BSS for a given access structure into a VCS for the same access structure while preserving the randomness of the original scheme. We provide both upper and lower bounds on the randomness of BSSs.All VCSs presented in this paper allow a perfect reconstruction of black pixels.