1. Bellare, M.: The Goldreich-Levin Theorem (manuscript), http://www-cse.ucsd.edu/users/mihir/papers/gl.pdf
2. Lecture Notes in Computer Science;M. Bellare,2000
3. Lecture Notes in Computer Science;M. Bellare,2007
4. Bellare, M., Fischlin, M., O’Neill, A., Ristenpart, T.: Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles. Full version of this paper. IACR ePrint archive (2008) http://eprint.iacr.org/
5. Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: Conference on Computer and Communications Security – CCS 1993, pp. 62–73. ACM, New York (1993)