B. Schneier, Applied Cryptograpy: Protocols, Algorithms, and Source Code in C, 2nd ed. New York: John Wiley and Sons, 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....novel way to separate the detection and authentication steps in the watermarking process, resulting in a watermark which is public enough to be detectable by others, yet private enough to be difficult to remove. 2 Zero Knowledge Protocols A discussion of zero knowledge protocols can be found in [11], and we summarize the concepts here. A zero knowledge proof is a method by which one can prove knowledge of a fact without revealing that knowledge to another party. The set of possible uses for such an idea is impossible to fathom, but one can instantly see its potential for solving our ....

....of her identifying information. The general idea is illustrated here with two specific protocols, one relying on the hardness of the graph isomorphism problem, one relying on the hardness of discrete log. 2. 2 Two Zero Knowledge Proof Methods Both of these protocols, and more, can be found in [11]. For a more in depth discussion, see [10] Protocol 1 A zero knowledge proof based on graph isomorphism. In this protocol, Alice possesses as secret information the isomorphism between two graphs. She can construct a graph H 1 , scramble it to produce a graph H 2 , and then publish both graphs, ....

B. Schneier, Applied Cryptograpy: Protocols, Algorithms, and Source Code in C, 2nd ed. New York: John Wiley and Sons, 1996.

No context found.

B. Schneier, Applied Cryptograpy: Protocols, Algorithms, and Source Code in C, 2nd ed. New York: John Wiley and Sons, 1996.

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