Randomness in visual cryptography

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1770, Issue , 2000, Pages 626-638

  de Bonis, Annalisa ^a   de Santis, Alfredo ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

Cryptography; Randomness; Secret sharing; Visual cryptography

Indexed keywords

RANDOM PROCESSES; TRANSPARENCY;

CRYPTOGRAPHIC COMPUTATIONS; LOWER AND UPPER BOUNDS; RANDOMNESS; SECRET IMAGES; SECRET SHARING; SHADOW IMAGES; VISUAL CRYPTOGRAPHY; VISUAL CRYPTOGRAPHY SCHEMES;

CRYPTOGRAPHY;

EID: 84944046626     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46541-3_52     Document Type: Conference Paper

References (18)

1. G. Ateniese, C. Blundo, A. De Santis, and D. R. Stinson, Visual Cryptography for General Access Structures. Information and Computation 129-122, 86-106 (1996).
2. G. Ateniese, C. Blundo, A. De Santis, and D. R. Stinson, Constructions and Bounds for Visual Cryptography. ICALP 1996, LNCS 1099, 416-428.
3. M. Atici, S. S. Magliveras, D. R. Stinson, and W.-D. Wei, Some Recursive Con-structions for Perfect Hash Families. Journal of Comb. Design, 4, 352-363 (1996).
4. A. Beimel and B. Chor, Universally ideal secret sharing schemes. IEEE Trans. Inform. Theory, 40(3), 786-794 (1994).
5. C. Blundo, P. D'Arco, A. De Santis, and D. R. Stinson, Contrast Optimal Thresh-old Visual Cryptography Schemes. Submitted for publication (1998).
6. C. Blundo and A. De Bonis, New Constructions for Visual Cryptography. Proc. ICTCS '98, P. Degano, U. Vaccaro, G. Pirillo, (Eds.), 290-303, World Scientific.
7. C. Blundo, A. De Santis, and D. R. Stinson, On the Contrast in Visual Cryptog-raphy Schemes. To appear on Journal of Cryptology. Available also at Theory of Cryptography Library as ftp://theory.lcs.mit.edu/pub/tcryptol/96-13.ps.
8. C. Blundo, A. De Santis, and U. Vaccaro, Randomness in Distribution Protocols. Information and Computation, 131, 111-139 (1996).
9. A. De Bonis and A. De Santis, Visual and Non-Visual Secret Sharing Schemes. Submitted for publication.
10. M. L. Fredman and J. Komlfios, On the Size of Separating System and Families of Perfect Hash Functions. SIAM J. Alg. Disc. Math., 5(1), 1984.
11. T. Hofmeister, M. Krause, and H. U. Simon, Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography. COCOON '97, LNCS 1276, 176-185.
12. R. Impagliazzo and D. Zuckerman, How to Recycle Random Bits. Proc. 21st An-nual ACM Symp. on Theory of Computing, 248-255 (1989).
13. M. Mehlhorn, On the Program Size of Perfect and Universal Hash Functions. Proc. 23rd IEEE Symp. on Foundations of Comp. Science, 170-175 (1982).
14. M. Naor and A. Shamir, Visual Cryptography. LNCS 950, 1-12 (1995).
15. D. R. Stinson, An Introduction to Visual Cryptography. Presented at Pub-lic Key Solutions '97, Toronto, Canada, April 28-30 (1997). Available ashttp://bibd.unl.edu/stinson/VKS-PKS.ps.
16. D. R. Stinson and R. Wei, New Constructions for Perfect Hash Families and Related Structures using Combinatorial Designs and Codes. Preprint.
17. G. J. Simmons, W.-A. Jackson, and K. Martin, Decomposition Constructions for Secret Sharing Schemes. Bulletin of the ICA, 1:72-88 (1991).
18. D. Zuckerman, Simulating BPP Using a General Weak Random Source. Proc. 32nd IEEE Symp. on Foundations of Comp. Science, 79-89 (1991).