Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Mihir Bellare , Phillip Rogaway, Random oracles are practical: a paradigm for designing efficient protocols, Proceedings of the 1st ACM conference on Computer and communications security, p.62-73, November 03-05, 1993, Fairfax, Virginia, United States  [doi>10.1145/168588.168596]
	2	Manuel Blum , Silvio Micali, How to generate cryptographically strong sequences of pseudo-random bits, SIAM Journal on Computing, v.13 n.4, p.850-864, Nov. 1984  [doi>10.1137/0213053]
	3	Ran Canetti, Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information, Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology, p.455-469, August 17-21, 1997
	4	J.L. Carter and M.N. Wegman, "Universal dasses of hash functions", JC$$ No. 18, 1979, 143-154.
	5	I.B. DamgSxd, "Collision free hash functions and public key signature schemes", EUROCRYPT 87 (LNCS 304), pp. 203-216, 1988.
	6	Ivan B. Damgård , Torben P. Pedersen , Birgit Pfitzmann, On the existence of statistically hiding bit commitment schemes and fail-stop signatures, Proceedings of the 13th annual international cryptology conference on Advances in cryptology, p.250-265, January 1994, Santa Barbara, California, United States
	7	Oded Goldreich, Foundations of Cryptography: Basic Tools, Cambridge University Press, New York, NY, 2000
	8	Oded Goldreich , Shafi Goldwasser , Silvio Micali, How to construct random functions, Journal of the ACM (JACM), v.33 n.4, p.792-807, Oct. 1986  [doi>10.1145/6490.6503]
	9	O. Goldreich , L. A. Levin, A hard-core predicate for all one-way functions, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.25-32, May 14-17, 1989, Seattle, Washington, United States  [doi>10.1145/73007.73010]
	10	S. Goldwasser and S. Micali, "Probabilistic encryption', JCSS, Vol. 28, No 2, 1984, 270-299.
	11	Shai Halevi , Silvio Micali, Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing, Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology, p.201-215, August 18-22, 1996
	12	R. Impagliazzo , L. A. Levin , M. Luby, Pseudo-random generation from one-way functions, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.12-24, May 14-17, 1989, Seattle, Washington, United States  [doi>10.1145/73007.73009]
	13	M. Naor , M. Yung, Universal one-way hash functions and their cryptographic applications, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.33-43, May 14-17, 1989, Seattle, Washington, United States  [doi>10.1145/73007.73011]
	14	R. Rivest, "The MD5 Message-Digest Algorithm," IETF RFC 1321, April 1992.
	15	A. Yao, "Theory and Applications of Trapdoor Functions'', FOCS, 1982, pp. 80-91.
	16	FIPS 180-1. "Secure Hash Standard," Federal Informarion Processing Standard (FIPS), Publication 180-1, National Institute of Standards and Technology, US Department of Commerce, Washington D.C., April 1995.

• Data structures for quadtree approximation and compression Communications of the ACM   28, 9
  Hanan Samet
  
  
• A hierarchical single-key-lock access control using the Chinese remainder theorem Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
  Kim S. Lee ,  Huizhu Lu ,  D. D. Fisher
  
  
• The GemStone object database management system Communications of the ACM   34, 10
  Paul Butterworth ,  Allen Otis ,  Jacob Stein
  
  
• Putting innovation to work: adoption strategies for multimedia communication systems Communications of the ACM   34, 12
  Ellen Francik ,  Susan Ehrlich Rudman ,  Donna Cooper ,  Stephen Levine
  
  
• An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE conference on Design automation
  Gwo-Dong Chen ,  Daniel D. Gajski