1. Lect Notes Comput Sci;W. Aiello,1996
2. Lect Notes Comput Sci;W. Aiello,1998
3. M. Ajtai, “Generating hard instances of lattice problems,” Proc. 28th ACM Symposium on the Theory of Computing, 1996, pp. 99–108.
4. Lect Notes Comput Sci;R. Anderson,1996
5. M. Bellare, R. Canetti, H. Krawczyk, “Pseudorandom functions revisited: The cascade construction and its concrete security,” Proc. 37th Annual Symposium on the Foundations of Computer Science, IEEE, 1996, pp. 514–523. Full version via http://www-cse.ucsd.edu/users/mihir .