Visual cryptography

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

Volumn 950, Issue , 1995, Pages 1-12

  Naor, Moni ^a   Shamir, Adi ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

TRANSPARENCY;

CRYPTOGRAPHIC COMPUTATIONS; CRYPTOGRAPHIC SCHEMES; K-OUT-OF-N; SECRET SHARING; VISUAL CRYPTOGRAPHY;

CRYPTOGRAPHY;

EID: 84926193517     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0053419     Document Type: Conference Paper

References (9)

1. N. Alon, J. Bruck, J. Naor, M. Naor and R. Roth, Construction of asymptotically good, low-rate error-correcting codes through pseudo-random graphs, IEEE Transactions on Information Theory, 38 (1992), 509-516.
2. N. Alon, O. Goldreich, J. Hastad and R. Peralta, Simple constructions of almost k-wise independent random variables, Random Structures and Algorithms 3 (1992), 289-304.
3. N. Alon and J. Spencer, The probabilistic method, Wiley, 1992.
4. J. L. Carter and M. N. Wegman, Universal classes of hash functions, Journal of Computer and System Sciences 18 (1979), pp. 143-154.
5. J. Kahn, N. Linial and A. Samorodnitsky, Inclusion-exlusion: exact and approximate, manuscript.
6. N. Linial and N. Nisan, Approximate inclusion-exlusion, Combinatorica 10, 1990, pp. 349-365.
7. F. J. MacWilliams and N. J. A. Sloane, The theory of error correcting codes, North Holland, Amsterdam, 1977.
8. J. Naor and M. Naor, Small bias probability spaces: efficient constructions and applications, SIAM J. on Computing, vol 22, 1993, pp. 838-856.
9. M. N. Wegman and J. L. Carter, New hash functions and their use in authentication and set equality, Journal of Computer and System Sciences 22, pp. 265-279 (1981).