1. Bellare, M., Boldyreva, A., Palacio, A.: An uninstantiable random-oracle-model scheme for a hybrid-encryption problem. IACR ePrint Archive (August 2003), Online available at:
http://eprint.iacr.org/2003/077.ps
2. Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: 1st ACM Conference on Computer and Communications Security, Proceedings of CCS 1993, pp. 62–73. ACM Press, New York (1993), Full version online available at:
http://www.cs.ucsd.edu/users/mihir/papers/ro.ps
3. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2001, pp. 136–145. IEEE Computer Society, Los Alamitos (2001), Full version online available at:
http://eprint.iacr.org/2000/067.ps
4. Lecture Notes in Computer Science;R. Canetti,2001
5. Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. In: Thirtieth Annual ACM Symposium on Theory of Computing, Proceedings of STOC 1998, pp. 209–218. ACM Press, New York (1998), Preliminary version, extended version online available at:
http://eprint.iacr.org/1998/011.ps