1. Barak, B.: How to go beyond the black-box simulation barrier. In: Proceedings of the 42nd Symposium on Foundations of Computer Science, IEEE, Los Alamitos (2001)
2. Bellare, M.: A note on negligible functions. Journal of Cryptology 15(4), 271–284 (2002)
3. Lecture Notes in Computer Science;M. Bellare,1990
4. Bellare, M., Palacio, A.: The Knowledge-of-Exponent assumptions and 3-round zero-knowledge protocols. Full version of the current paper, available via,
http://www-cse.ucsd.edu/users/mihir
5. Blum, M.: How to prove a theorem so no one else can claim it. In: Proceedings of the International Congress of Mathematicians, pp. 1444–1451 (1986)