M. Blum, P. Feldman, and S. Micali. Proving security against chosen cyphertext attacks. pages 256--268. Springer-Verlag, 1988. Lecture Notes in Computer Science No. 403. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
National Identification Systems - Nguyen (2000) (Correct)
....if it does not provide more information than what is to be proven. In our age example, a zero knowledge proof will leave the veri er with the conviction that the prover is over age while not having any clue to his her exact age. In 1988, Manuel Blum and Paul Feldman and Silvio Micali [38] rst showed that a zeroknowledge proof need not be interactive, basing their proof on a non standard assumption. Later that same year, Alfredo De Santis and Silvio Micali and Giuseppe Persiano [143] prove the same result using a weaker and well known assumption (the hardness of quadratic ....
Manuel Blum, Paul Feldman, and Silvio Micali. Proving security against chosen cyphertext attacks. In S. Goldwasser, editor, Proc. CRYPTO 88, pages 256-268. Springer-Verlag, 1988. Lecture Notes in Computer Science No. 403.
Plaintext-Simulatability - Fujisaki (2004) (Correct)
No context found.
M. Blum, P. Feldman, and S. Micali. Proving security against chosen cyphertext attacks. pages 256--268. Springer-Verlag, 1988. Lecture Notes in Computer Science No. 403.
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