[1]

M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. *SIAM Journal of Computing*, 13(4):850–864, November 1984.

[2]

I. Damgård. Collision free hash functions and public key signature schemes. *Proceedings of EUROCRYPT '87*, Lecture Notes in Computer Science, pages 203–216, volume 304, Springer-Verlag, Berlin, 1988.

[3]

A. De Santis and M. Yung. On the design of provably-secure cryptographic hash functions. *Proceedings of EUROCRYPT '90*, Lecture Notes in Computer Science, pages 412–431, volume 473, Springer-Verlag, Berlin, 1990.

[4]

O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. *Journal of the ACM*, 33(4):792–807, October 1986.

[5]

S. Goldwasser, S. Micali, and R. L. Rivest. A digital signature scheme secure against adaptive chosen-message attack. *SIAM Journal of Computing*, 17(2):281–308, April 1988.

[6]

J. Håstad. Pseudo-random generators under uniform assumptions. *Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing*, pages 395–404, 1990.

[7]

R. Impagliazzo, L. A. Levin, and M. Luby. Pseudo-random generation from one-way functions. *Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing*, pages 12–24, 1989.

[8]

T. Itoh. Personal communication, August 1992.

[9]

J. Kilian. A note on efficient zero-knowledge proofs and arguments. *Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing*, pages 723–732, 1992.

[10]

M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. *Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing*, pages 33–43, 1989.

[11]

W. Ogata and K. Kurosawa. On claw free families. *Proceedings of ASIACRYPT '91*, pages 111–123, 1991.

[12]

J. Rompel. One-way functions are necessary and sufficient for secure signatures. *Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing*, pages 387–394, 1990.

[13]

A. Yao. Theory and applications of trapdoor functions. *Proceedings of the Twenty-Third IEEE Symposium on Foundations of Computer Science*, pages 80–91, 1982.

[14]

Y. Zheng, T. Matsumoto, and H. Imai. Duality between two cryptographic primitives. *Proceedings of the Eighth International Conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes*, Lecture Notes in Computer Science, pages 379–390, volume 508, Springer-Verlag, Berlin, 1990.

[15]

Y. Zheng, T. Matsumoto, and H. Imai. Structural properties of one-way hash functions. *Proceedings of CRYPTO '90*, Lecture Notes in Computer Science, pages 285–302, volume 537, Springer-Verlag, Berlin, 1990.