Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology

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

Volumn 2951, Issue , 2004, Pages 21-39

  Maurer, Ueli ^a   Renner, Renato ^a   Holenstein, Clemens ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

HASH FUNCTIONS;

FUNDAMENTAL CONCEPTS; IMPOSSIBILITY RESULTS; INDIFFERENTIABILITY; INDISTINGUISHABILITY; INTERNAL STATE; IRREDUCIBILITY RESULTS; RANDOM ORACLE METHODOLOGY; RANDOM ORACLE MODEL;

CRYPTOGRAPHY;

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

References (17)

1. M. Bellare, A. Boldyreva, and A. Palacio. An un-instantiable random-oracle-model scheme for a hybrid-encryption problem. ePrint archive: http://eprint.iacr.org/2003/077/, 2003.
2. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In V. Ashby, editor, 1st ACM Conference on Computer and Communications Security, pages 62-73. ACM Press, 1993.
3. M. Bellare and P. Rogaway. The exact security of digital signatures: How to sign with RSA and Rabin. In Advances in Cryptology - EUROCRYPT'96, volume 1070 of Lecture Notes in Computer Science, pages 399-416. Springer-Verlag, 1996.
4. R. Canetti. Security and composition of multi-party cryptographic protocols. Journal of Cryptology, 13(1):143-202, 2000.
5. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proc. 42nd IEEE Symposium on Foundations of Computer Science (FOCS), pages 136-145, 2001.
6. R. Canetti, O. Goldreich, and S. Halevi. The random oracle methodology, revisited. In Proceedings of the 30th Annual ACM Symposium on the Theory of Computing, pages 209-218. ACM Press, 1998.
7. R. Canetti, O. Goldreich, and S. Halevi. On the random-oracle methodology as applied to length-restricted signature schemes. ePrint archive: http://eprint.iacr.org/2003/150/, 2003.
8. A. Fiat and A. Shamir. How to prove yourself. Practical solutions to identification and signature problems. In Advances in Cryptology - CRYPTO'86, volume 263 of Lecture Notes in Computer Science, pages 186-189. Springer-Verlag, 1986.
9. L. Guillou and J. Quisquater. A practical zero-knowledge protocol fitted to security microprocessors minimizing both transmission and memory. In Advances in Cryptology - EUROCRYPT'88, volume 330 of Lecture Notes in Computer Science, pages 123-128. Springer-Verlag, 1988.
10. U. Maurer. Indistinguishability of random systems. In Advances in Cryptology - EUROCRYPT '02, volume 2332 of Lecture Notes in Computer Science, pages 110-132. Springer-Verlag, 2002.
11. S. Micali. CS proofs. In Proc. 35th Annual Symposium on Foundations of Computer Science (FOCS), pages 436-453. IEEE, 1994.
12. J. B. Nielsen. Separating random oracle proofs from complexity theoretic proofs: the non-committing encryption case. In Advances in Cryptology - CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 111-126. Springer-Verlag, 2002.
13. T. Okamoto. Provably secure and practical identification scheme and corresponding signature scheme. In Advances in Cryptology - CRYPTO'92, volume 740 of Lecture Notes in Computer Science, pages 31-53. Springer-Verlag, 1992.
14. B. Pfitzmann and M. Waidner. Composition and integrity preservation of secure reactive systems. In 7th ACM Conference on Computer and Communications Security, pages 245-254. ACM Press, 2000.
15. B. Pfitzmann and M. Waidner. A model for asynchronous reactive systems and its application to secure message transmission. In IEEE Symposium on Security and Privacy, pages 184-200. IEEE Computer Society Press, 2001.
16. D. Pointcheval and J. Stern. Security proofs for signature schemes. In Advances in Cryptology - EUROCRYPT'96, volume 1070 of Lecture Notes in Computer Science, pages 387-398. Springer-Verlag, 1996.
17. C. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4(3):161-174, 1991.