The equivalence of the random oracle model and the ideal cipher model, revisited

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2011, Pages 89-98

  Holenstein, Thomas ^a   Künzler, Robin ^a   Tessaro, Stefano ^b  

^a ETH ZURICH   (Switzerland)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

cryptography; feistel construction; ideal cipher model; indifferentiability; random oracle model

Indexed keywords

COMPUTATION THEORY;

CRYPTOGRAPHIC PROBLEMS; DISTINGUISHING ATTACKS; FEISTEL CONSTRUCTIONS; IDEAL-CIPHER MODEL; INDIFFERENTIABILITY; RANDOM ORACLE MODEL; RANDOM PERMUTATIONS; SYMMETRIC CRYPTOGRAPHY;

CRYPTOGRAPHY;

EID: 79959705876     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993636.1993650     Document Type: Conference Paper

References (25)

1. M. Bellare and T. Kohno. A theoretical treatment of related-key attacks: RKA-PRPs, RKA-PRFs, and applications. In Advances in Cryptology - EUROCRYPT 2003, volume 2656 of Lecture Notes in Computer Science, pages 491-506, 2003.
2. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In CCS '93: Proceedings of the 1st ACM conference on Computer and communications security, pages 62-73, New York, NY, USA, 1993. ACM.
3. M. Bellare and P. Rogaway. Optimal asymmetric encryption. In Advances in Cryptology - EUROCRYPT '94, Lecture Notes in Computer Science, pages 92-111, 1994.
4. M. Bellare and P. Rogaway. The exact security of digital signatures - How to sign with RSA and Rabin. In Advances in Cryptology - EUROCRYPT '96, Lecture Notes in Computer Science, pages 399-416, 1996.
5. M. Bellare and P. Rogaway. The security of triple encryption and a framework for code-based game-playing proofs. In Advances in Cryptology - EUROCRYPT 2006, volume 4004 of Lecture Notes in Computer Science, pages 409-426, 2006.
6. J. Black, P. Rogaway, and T. Shrimpton. Black-box analysis of the block-cipher-based hash-function constructions from pgv. In Advances in Cryptology - CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 320-335, 2002.
7. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In FOCS '01: Proceedings of the 42nd IEEE Annual Symposium on Foundations of Computer Science, pages 136-145, 2001.
8. R. Canetti, O. Goldreich, and S. Halevi. The random oracle methodology, revisited. J. ACM, 51(4):557-594, 2004.
9. J.-S. Coron, Y. Dodis, C. Malinaud, and P. Puniya. Merkle-Damgård revisited: How to construct a hash function. Lecture Notes in Computer Science, pages 430-448, 2005.
10. J.-S. Coron, J. Patarin, and Y. Seurin. The random oracle model and the ideal cipher model are equivalent. In D. Wagner, editor, CRYPTO, volume 5157 of Lecture Notes in Computer Science, pages 1-20. Springer, 2008.
11. J.-S. Coron, J. Patarin, and Y. Seurin. The random oracle model and the ideal cipher model are equivalent. Cryptology ePrint Archive, Report 2008/246, May 2008. Version: 20080603:012059, http://eprint.iacr.org/.
12. J.-S. Coron, J. Patarin, and Y. Seurin. The random oracle model and the ideal cipher model are equivalent. Cryptology ePrint Archive, Report 2008/246, August 2008. Version: 20080816:121712, http://eprint.iacr.org/, Extended Abstract at CRYPTO 2008.
13. I. B. Damgård. A design principle for hash functions. In Advances in Cryptology - CRYPTO '89, volume 435 of Lecture Notes in Computer Science, pages 416-427, 1989.
14. Y. Dodis and P. Puniya. On the relation between the ideal cipher and the random oracle models. In Theory of Cryptography - TCC 2006, volume 3876 of Lecture Notes in Computer Science, pages 184-206, 2006.
15. S. Dziembowski, K. Pietrzak, and D. Wichs. Non-malleable codes. In Innovations in Computer Science - ICS 2010, pages 434-452, 2010.
16. P. Gaži and U. Maurer. Cascade encryption revisited. In Advances in Cryptology - ASIACRYPT 2009, volume 5912 of Lecture Notes in Computer Science, pages 37-51, Dec. 2009.
17. T. Holenstein, R. Künzler, and S. Tessaro. The equivalence of the random oracle model and the ideal cipher model, revisited, 2010. arXiv:1011.1264.
18. J. Kahn, M. E. Saks, and C. D. Smyth. A dual version of reimer's inequality and a proof of rudich's conjecture. In IEEE Conference on Computational Complexity, pages 98-103, 2000.
19. E. Kiltz, A. O'Neill, and A. Smith. Instantiability of rsa-oaep under chosen-plaintext attack. In Advances in Cryptology - CRYPTO 2009, volume 6223 of Lecture Notes in Computer Science, pages 295-313, 2010.
20. Y. Lindell and H. Zarosim. Adaptive zero-knowledge proofs and adaptively secure oblivious transfer. In Theory of Cryptography Conference - TCC 2009, volume 5444 of Lecture Notes in Computer Science, pages 183-201, 2009.
21. M. Luby and C. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Comput., 17(2):373-386, 1988.
22. U. Maurer, R. Renner, and C. Holenstein. Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology. In Theory of Cryptography Conference - TCC 2004, volume 2951 of Lecture Notes in Computer Science, pages 21-39, Feb. 2004.
23. R. C. Merkle. A certified digital signature. In Advances in Cryptology - CRYPTO '89, volume 435 of Lecture Notes in Computer Science, pages 218-238, 1989.
24. S. Rudich. Limits on the Provable Consequences of One-way Functions. PhD thesis, 1989.
25. Y. Seurin. Primitives et protocoles cryptographiques à sécurité prouvée. PhD thesis, Université de Versailles Saint-Quentin-en-Yvelines, UFR de Sciences - École doctorale SoFt - Laboratoire PRiSM, 2009.