On the random-oracle methodology as applied to length-restricted signature schemes

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

Volumn 2951, Issue , 2004, Pages 40-57

  Canetti, Ran ^a   Goldreich, Oded ^b   Halevi, Shai ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

INTERACTIVE PROOF SYSTEM; MEMORYLESS; RANDOM ORACLE METHODOLOGY; RANDOM ORACLE MODEL; SECURE IMPLEMENTATION; SIGNATURE GENERATION; SIGNATURE SCHEME; SIGNING KEY;

AUTHENTICATION;

EID: 35048875340     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24638-1_3     Document Type: Article

References (17)

1. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In 1st Conference on Computer and Communications Security, pages 62-73. ACM, 1993.
2. M. Blum, W. S. Evans, P. Gemmell, S. Kannan and M. Naor, Checking the Correctness of Memories, Algorithmica, 12(2/3), pages 225-244, 1994. Preliminary version in 32nd FOCS, 1991.
3. G. Brassard, D. Chaum and G. Crépeau. Minimum Disclosure Proofs of Knowledge. JCSS, Vol. 37, No. 2, pages 156-189, 1988.
4. Preliminary version by Brassard and Crépeau in 27th FOCS, 1986.
5. O. Goldreich and J. Håstad. On the complexity of interactive proofs with bounded communication. Information Processing Letters, 67(4):205-214, 1998.
6. R. Canetti, O. Goldreich and S. Halevi. The Random Oracle Methodology, Revisited. Preliminary version in Proceedings of the 30th Annual ACM Symposium on the Theory of Computing, Dallas, TX, May 1998. ACM. TR version(s) available on-line from http://eprint.iacr.org/1998/011 and http://xxx.lanl.gov/abs/cs.CR/ 0010019.
7. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33(4):210-217, 1986.
8. O. Goldreich and R. Ostrovsky. Software Protection and Simulation on Oblivious RAMs. JACM, Vol. 43, 1996, pages 431-473.
9. O. Goldreich, S. Vadhan and A. Wigderson. On interactive proofs with a laconic provers. In Proc. of the 28th ICALP, Springer's LNCS 2076, pages 334-345, 2001.
10. S. Goldwasser, S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. SICOMP, Vol. 18, pages 186-208, 1989.
11. Preliminary version in 17th STOC, 1985.
12. C. Holenstein, U. Maurer, and R. Renner. Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology. Appears in these proceedings. Also available at http://eprint.iacr.org/2003/161/
13. J. Kilian. A Note on Efficient Zero-Knowledge Proofs and Arguments. In 24th STOC, pages 723-732, 1992.
14. R.C. Merkle. A certified digital signature. Advances in cryptology-CRYPTO '89, Vol. 435 of Lecture Notes in Computer Science, pages 218-238, Springer, New York, 1990.
15. S. Micali. Computationally Sound Proofs. SICOMP, Vol. 30 (4), pages 1253-1298, 2000.
16. Preliminary version in 35th FOCS, 1994.
17. M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 33-43, 1989.