Visual Cryptography for General Access Structures

Information and Computation

Volumn 129, Issue 2, 1996, Pages 86-106

  Ateniese, Giuseppe ^a   Blundo, Carlo ^b   De Santis, Alfredo ^b   Stinson, Douglas R ^c  

^a UNIVERSITY OF GENOA   (Italy)

^b UNIVERSITY OF SALERNO   (Italy)

^c UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002015048     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0076     Document Type: Article

References (14)

1. Ateniese, G., Blundo, C., De Santis, A., and Stinson, D. R. (1996), Constructions and bounds for visual cryptography, in "23rd International Colloquium on Automata, Languages and Programming" (ICALP '96), (F. M. auf der Heide and B. Monien, Eds.), Lecture Notes in Computer Science, Vol. 1099, pp. 416-428, Springer-Verlag, Berlin.
2. Blundo, C., De Santis, A., and Stinson, D. R. (1996), On the contrast in visual cryptography schemes, preprint.
3. Ateniese, G., Blundo, C., De Santis, A., and Stinson, D. R. (1995), Extended schemes for visual cryptography, preprint.
4. Atici, M., Magliveras, S. S., and Stinson, D. R., and Wei, W.-D. Wei, Some recursive constructions for perfect fash families, in J. Combin. Designs, to appear.
5. Bludno, C., De Santis, A., Stinson, D. R., and Vaccaro, U. (1995), Graph decomposition and secret sharing schemes, J. Cryptol. 8, 39-64.
6. Brickell, E. F., and Stinson, D. R. (1992), Some improved bounds on the information rate of perfect secret sharing schemes, J. Cryptol. 5, 153-166.
7. Erdös, P., Frankl, P., and Füredi, Z. (1985), Families of finite sets in which no set is covered by the union r others, Israel J. Math. 51, 79-89.
8. Fredman, M. L., and J. Komlós, (1984), On the size of separating system and famolies of perfect hash functions, SIAM J. Algebraic Discrete Methods 5, No. 1.
9. van Lint, J. H., and Wilson, R. M., (1992), Cambridge Univ. Press, Cambridge, UK.
10. Mehlhorn, K. (1982), On the program size of perfect and universal hash functions, in "Proceedings of 23rd Annual IEEE Symposium on Foundation of Computer Science, 1982," pp. 170-175.
11. Naor, M., and Shamir, A. (1995), Visual cryptography, in "Advances in Cryptogoly - Eurocrypt '94" (A. De Santis, Ed.), Lecture Notes in Computer Science, Vol. 950, pp. 1-12, Springer-Verlag, Berlin.
12. Elias, P. (1988), Zero error capacity under list decoding, IEEE Trans. Inform. Theory, 34, No. 5, 1070-1074.
13. Simmons, G. J., Jackson, W., and Martin, K. (1991), The geometry of shared secret schemes, Bull. ICA, 1, 71-88.
14. Stinson, D. R. (1994), Decomposition constructions for secret sharing schemes, IEEE Trans. Inform. Theory, 40, No. 1, 118-125.