DIMACS: Series in Discrete Mathematics and Theoretical Computer Science 1991; 262 pp; hardcover Volume: 2 ISBN10: 0821865900 ISBN13: 9780821865903 List Price: US$65 Member Price: US$52 Order Code: DIMACS/2
 This book, the second volume in the DIMACS book series and published jointly with the Association for Computing Machinery, contains the proceedings of a workshop held in Princeton, New Jersey, in October 1989. The workshop, which drew seventyfour participants from five countries, addressed a wide range of practical and theoretical questions arising in the overlap of distributed computation and cryptography. In addition to fifteen papers based on formal talks presented at the workshop, this volume also contains two contributed papers on related topics, and an extensive summary of informal discussions that took place during the workshop, including some open questions raised. The book requires basic background in computer science and either a familiarity with the notation and terminology of distributed computing and cryptography, or a willingness to do some background reading. Students, researchers, and engineers interested in the theoretical and practical aspects of distributed computing and cryptography will appreciate the overview the book provides. Copublished with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 17 were copublished with the Association for Computer Machinery (ACM). Table of Contents  J. Feigenbaum and M. Merritt  Open questions, talk abstracts, and summary of discussions
 D. Beaver  Formal definitions for secure distributed protocols
 D. Beaver  Perfect privacy for twoparty protocols
 M. Bellare, L. Cowen, and S. Goldwasser  On the structure of secret key exchange protocols
 M. Bishop  Privacyenhanced electronic mail
 M. Blum, M. Luby, and R. Rubinfeld  Program result checking against adaptive programs and in cryptographic settings
 M. Burrows, M. Abadi, and R. Needham  The scope of a logic of authentication
 D. Estrin and G. Tsudik  Secure policy enforcement in internetworks
 U. Feige and A. Shmir  On expected polynomial time simulation of zero knowledge protocols
 J. Feigenbaum, M. Y. Liberman, and R. N. Wright  Cryptographic protection of databases and software
 , M. J. Fischer, M. S. Paterson, and C. Rackoff  Secret bit transmission using a random deal of cards
 Z. Galil, S. Haber, and M. Yung  Security against replay chosenciphertext attack
 R. J. Lipton  New directions in testing
 M. Merritt  Towards a theory of cryptographic systems: A critique of cryptocomplexity
 A. Orlitsky  Feedback in discrete communication
 R. Ostrovsky and M. Young  On necessary conditions for secure distributed computation
 J. Reeds  Secure IX network
 M.J. Toussaint and P. Wolper  Reasoning about cryptographic protocols
