R. Canetti, U. Feige, O. Goldreich, and M. Naor. Adaptively Secure Computation. 28th ACM Symposium on Theory of Computing (STOC), ACM, pp. 639--648,  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Cryptography 2000 ± 10 - Maurer (Correct)
....investigations, the random oracle model was proposed informally in [31] and more formally in [5] A random oracle is a random function from D = f0; 1g to R = f0; 1g k , an idealized concept that does not exist in reality. Many system have been proved secure in the random oracle model, but in [16] it was shown that this methodology is inherently problematic: a signature scheme was demonstrated which is secure in the random oracle model but insecure for every implementation of the random oracle by a class of hash functions. There have been some impressive successes in the cryptanalysis of ....
R. Canetti, O. Goldreich, and S. Halevi, The random oracle methodology, revisited, Proc. 30th ACM Symposium on the Theory of Computing (STOC), pp. 209--218, 1998.
Adaptively-Secure, Non-Interactive Public-Key Encryption - Canetti, Halevi, Katz (2004) Self-citation (Canetti) (Correct)
No context found.
R. Canetti, U. Feige, O. Goldreich, and M. Naor. Adaptively Secure Computation. 28th ACM Symposium on Theory of Computing (STOC), ACM, pp. 639--648,
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