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	Martín Abadi , Andrew D. Gordon, A calculus for cryptographic protocols: the spi calculus, Proceedings of the 4th ACM conference on Computer and communications security, p.36-47, April 01-04, 1997, Zurich, Switzerland  [doi>10.1145/266420.266432]
	2	Martín Abadi , Phillip Rogaway, Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption), Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, p.3-22, August 17-19, 2000
	3	D. Beaver, Secure Multiparty Protocols and Zero Knowledge Proof Systems Tolerating a Faulty Minority, J. of Cryptology 4/2 (1991) 75{122
	4	Mihir Bellare , Ran Canetti , Hugo Krawczyk, A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract), Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.419-428, May 24-26, 1998, Dallas, Texas, United States  [doi>10.1145/276698.276854]
	5	Mihir Bellare , Anand Desai , David Pointcheval , Phillip Rogaway, Relations Among Notions of Security for Public-Key Encryption Schemes, Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology, p.26-45, August 23-27, 1998
	6	R. Canetti, Security and Composition of Multiparty Cryptographic Protocols, J. of Cryptology 13/1 (2000) 143{202 (preliminary version in Theory of Cryptography Library 98-18, 1998)
	7	R. Canetti, S. Goldwasser, An E~cient Threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack, Eurocrypt '99, LNCS 1592, Springer-Verlag, 1999, 90{106
	8	Ronald Cramer , Victor Shoup, A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack, Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology, p.13-25, August 23-27, 1998
	9	D. Dolev, A. C. Yao, On the Security of Public Key Protocols, IEEETransactions on Information Theory 29/2 (1983) 198{208
	10	R. Gennaro, S. Micali, Veri~able Secret Sharing as Secure Computation, Eurocrypt '95, LNCS 921, Springer-Verlag, 1995, 168{182
	11	O. Goldreich, Secure Multi-Party Computation, Working Draft, Version 1.1, September 21, 1998, available from http: //www.wisdom.weizmann.ac.il/users/oded/pp.htm
	12	Shafi Goldwasser , Leonid A. Levin, Fair Computation of General Functions in Presence of Immoral Majority, Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology, p.77-93, August 11-15, 1990
	13	S. Goldwasser , S. Micali , C. Rackoff, The knowledge complexity of interactive proof systems, SIAM Journal on Computing, v.18 n.1, p.186-208, Feb. 1989  [doi>10.1137/0218012]
	14	O. Goldreich , S. Micali , A. Wigderson, How to play ANY mental game, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.218-229, January 1987, New York, New York, United States  [doi>10.1145/28395.28420]
	15	M. Hirt, U. Maurer, Player Simulation and General Adversary Structures in Perfect Multiparty Computation, J. of Cryptology 13/1 (2000) 31{60.
	16	P. Lincoln , J. Mitchell , M. Mitchell , A. Scedrov, A probabilistic poly-time framework for protocol analysis, Proceedings of the 5th ACM conference on Computer and communications security, p.112-121, November 02-05, 1998, San Francisco, California, United States  [doi>10.1145/288090.288117]
	17	Patrick Lincoln , John C. Mitchell , Mark Mitchell , Andre Scedrov, Probabilistic Polynomial-Time Equivalence and Security Analysis, Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I, p.776-793, September 20-24, 1999
	18	Gavin Lowe, Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR, Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems, p.147-166, March 27-29, 1996
	19	Nancy A. Lynch, Distributed Algorithms, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1996
	20	C. Meadows, Using Narrowing in the Analysis of Key Management Protocols, Symp. on Security and Privacy, IEEE, 1989, 138{147
	21	S. Micali, P. Rogaway, Secure Computation, Crypto '91, LNCS 576, Springer-Verlag, 1992, 392{404
	22	J. K. Millen, The Interrogator: A Tool for Cryptographic Protocol Security, Symp. on Security and Privacy, IEEE, 1984, 134{141
	23	Birgit Pfitzmann, Sorting out signature schemes, Proceedings of the 1st ACM conference on Computer and communications security, p.74-85, November 03-05, 1993, Fairfax, Virginia, United States  [doi>10.1145/168588.168597]
	24	B. P~tzmann, M. Schunter, M. Waidner, Secure Reactive Systems, IBM Research Report RZ 3206 (#93252), IBM Research Division, Z? urich, May 2000
	25	B. P~tzmann, M. Schunter, M. Waidner, Provably Secure Certi~ed Mail, IBM Research Report RZ 3207 (#93253), IBM Research Division, Z? urich, Aug. 2000
	26	B. P~tzmann, M. Schunter, M. Waidner, Cryptographic Security of Reactive Systems, Electronic Notes in Theoretical Computer Science (ENTCS) 32 (2000), available at http://www.elsevier.nl/cas/ tree/store/tcs/free/noncas/pc/menu.htm
	27	B. P~tzmann, M. Waidner, A General Framework for Formal Notions of \Secure" System, Hildesheimer Informatik-Berichte 11/94, Universit? at Hildesheim, April 1994, available at http://www.semper.org/ sirene/lit/abstr94.html#PfWa_94
	28	A. W. Roscoe, Modelling and verifying key-exchange protocols using CSP and FDR, Proceedings of the The Eighth IEEE Computer Security Foundations Workshop (CSFW '95), p.98, March 13-15, 1995
	29	A. C. Yao, Protocols for Secure Computations, 23rd Symp. on Foundations of Computer Science (FOCS), IEEE, 1982, 160{164
	30	A. C. Yao, Theory and Applications of Trapdoor Functions, 23rd Symp. on Foundations of Computer Science (FOCS), IEEE, 1982, 80{91

• 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
  
  
• An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE conference on Design automation
  Gwo-Dong Chen ,  Daniel D. Gajski
  
  
• 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