Moni Naor, Adi Shamir  Home/Search
Context Related
| wisdom.weizmann.ac.il/pub/...9414.ps.Z wisdom.weizmann.ac.il/Pape...9414.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: fermivista.math....weizmann.ac.il (more) From: unisa.it/VISUAL/papers (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we consider a new type of cryptographic scheme, which can decode concealed images without any cryptographic computations. The scheme is perfectly secure and very easy to implement. We extend it into a visual variant of the k out of n secret sharing problem, in which a dealer provides a transparency to each one of the n users; any k of them can see the image by stacking their transparencies, but any k - 1 of them gain no information about it. (Update)
Cited by: More
Visual Cryptography Schemes with Optimal Pixel Expansion - Carlo Blundo Stelvio (2006) (Correct)
Secret color images sharing schemes based on XOR operation - Dao-Shun, Lei, Ning.. (2005) (Correct)
Progressive Color Visual Cryptography - Final Version Of (Correct)
Active bibliography (related documents): More All
1.0: Visual Cryptography - Moni Naor (1995) (Correct)
0.0: Splitters and Near-Optimal Derandomization - Naor, Schulman, Srinivasan (1995) (Correct)
0.0: Improved Algorithms via Approximations of Probability.. - Chari, Rohatgi.. (1997) (Correct)
Similar documents based on text: More All
0.3: Pseudo-Random Synthesizers, Functions and Permutations - Reingold (1998) (Correct)
0.3: A polarisation based Visual Crypto System and its.. - Tuyls, Hollmann.. (2002) (Correct)
0.3: Visual Cryptography II: Improving the Contrast Via the Cover Base - Moni Naor (1996) (Correct)
Related documents from co-citation: More All
12: Visual Cryptography for General Access Structures - Ateniese, Blundo et al. - 1996
9: Visual authentication and identification - Naor, Pinkas
6: How to Share a Secret (context) - Shamir - 1979
BibTeX entry: (Update)
Naor M. and Shamir A., Visual cryptography, in Eurocrypt '94, Springer-Verlag LNCS Vol. 950, 1995, 1--12. http://citeseer.ist.psu.edu/naor95visual.html More
@article{ naor95visual,
author = "Moni Naor and Adi Shamir",
title = "Visual Cryptography",
journal = "Lecture Notes in Computer Science",
volume = "950",
pages = "1--12",
year = "1995",
url = "citeseer.ist.psu.edu/naor95visual.html" }
Citations (may not include all citations):957 The probabilistic method (context) - Alon, Spencer - 1992
860 The theory of error correcting codes (context) - MacWilliams, Sloane - 1977
358 Universal classes of hash functions (context) - Carter, Wegman - 1979
191 New hash functions and their use in authentication and set e.. (context) - Wegman, Carter - 1981
138 Small bias probability spaces: efficient constructions and a.. - Naor, Naor - 1993
128 Simple constructions of almost k-wise independent random var.. - Alon, Goldreich et al. - 1992
15 low-rate error-correcting codes through pseudo-random graphs (context) - Alon, Bruck et al. - 1992
2 Approximate inclusion-exlusion (context) - Linial, Nisan - 1990
2 Inclusion-exlusion: exact and approximate (context) - Kahn, Linial et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.wisdom.weizmann.ac.il.html): More
Local Majority Voting, Small Coalitions and Controlling Monopolies .. - Peleg (1996) (Correct)
On Constructing 1-1 One-Way Functions - Goldreich, Levin, Nisan (1995) (Correct)
Infinite Cyclic Impartial Games - Fraenkel, Rahat (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC