1. J. Alter. When photographs lie.Newsweek, pp. 44–45, July 30, 1990.

2. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits.SIAM J. Comput.,13(4): 850–864, Nov. 1984.

   Google Scholar 

3. G. Brassard and M. Yung. One-way group actions. InAdvances in Cryptology—Crypto '90. Lecture Notes in Computer Science, Springer-Verlag, Berlin, to appear.

4. I. Damgård. Collision-free hash functions and public-key signature schemes. InAdvances in Cryptology—Eurocrypt '87, pp. 203–217. Lecture Notes in Computer Science, vol. 304, Springer-Verlag, Berlin, 1988.

   Google Scholar 

5. I. Damgård. A design principle for hash functions. InAdvances in Cryptology—Crypto '89 (ed. G. Brassard), pp. 416–427. Lecture Notes in Computer Science, vol. 435, Springer-Verlag, Berlin, 1990.

   Google Scholar 

6. A. DeSantis and M. Yung. On the design of provably secure cryptographic hash functions. InAdvances in Cryptology—Eurocrypt '90. Lecture Notes in Computer Science, Springer-Verlag, Berlin, to appear.

7. W. Diffie and M. E. Hellman. New directions in cryptography.IEEE Trans. Inform. Theory,22: 644–654, Nov. 1976.

   Google Scholar 

8. Z. Galil, S. Haber, and M. Yung. Interactive public-key cryptosystems. Submitted for publication, 1990.

9. S. Goldwasser and S. Micali. Probabilistic encryption.J. Comput. System Sci.,28: 270–299, April 1984.

   Google Scholar 

10. S. Goldwasser, S. Micali, and R. Rivest. A secure digital signature scheme.SIAM J. Comput., 17(2): 281–308, 1988.

    Google Scholar 

11. A. Grundberg. Ask it no questions: The camera can lie.The New York Times, Section 2, pp. 1, 29, August 12,1990.

12. R. Impagliazzo, L. Levin, and M. Luby. Pseudorandom generation from one-way functions. InProc. 21stSTOC, pp. 12–24. ACM, New York, 1989.

    Google Scholar 

13. R. Impagliazzo and M. Luby. One-way functions are essential for complexity-based cryptography. InProc. 30thFOCS, pp. 230–235. IEEE, New York, 1989.

    Google Scholar 

14. H. M. Kanare.Writing the Laboratory Notebook, p. 117. American Chemical Society, Washington, D.C., 1985.

    Google Scholar 

15. R. C. Merkle. Secrecy, authentication, and public-key systems. Ph.D. thesis, Stanford University, 1979.

16. R. C. Merkle. One-way hash functions and DES. InAdvances in Cryptology-3-Crypto '89 (ed. G. Brassard), pp. 428–446. Lecture Notes in Computer Science, vol. 435, Springer-Verlag, Berlin, 1990.

    Google Scholar 

17. M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. InProc. 21stSTOC, pp. 33–43. ACM, New York, 1989.

    Google Scholar 

18. M. O. Rabin. Digitalized signatures. InFoundations of Secure Computation (ed.) R. A. DeMillo et al., pp. 155–168. Academic Press, New York, 1978.

    Google Scholar 

19. R. Rivest. The MD4 message digest algorithm. InAdvances in Cryptology—Crypto '90. Lecture Notes in Computer Science, Springer-Verlag, Berlin, to appear.

20. J. Rompel. One-way functions are necessary and sufficient for secure signatures. InProc. 22ndSTOC, pp. 387–394. ACM, New York, 1990.

    Google Scholar 

21. C. Shannon. Prediction and entropy of printed English.Bell System Tech. J.,30: 50–64, 1951.

    Google Scholar 

22. A. C. Yao. Theory and applications of trapdoor functions. InProc. 23rdFOCS, pp. 80–91. IEEE, New York, 1982.

    Google Scholar 

Download references