Joan Feigenbaum and Michael Merritt, Open questions, talk abstracts, and summary discussions; Donald Beaver, Formal definitions for secure distributed protocols; Donald Beaver, Perfect privacy for two-party protocols; Mihir Bellare, Lenore Cowen, and Shafi Goldwasser, On the structure of secret key exchange protocols; Matt Bishop, Privacy-enhanced electronic mail; Manual Blum, Michael Luby, and Ronitt Rubinfield, Program result checking against adaptive programs and in cryptographic settings; Michael Burrows, Martin Abadi and Roger Needham, The scope of a logic of authentication; Deborah Estrin and Gene Tsudik, Secure policy enforcement in internetworks; Uriel Feige and Adi Shamir, On expected polynomial time simulation of zero knowledge protocols; Joan Feigenbaum, Mark Y Liberman, and Rebecca N Wright, Cryptographic protection of databases and software; Michael J Fischer, Michael S Paterson, and Charles Rackoff, Secret bit transmission using a random deal of cards; Zvi Galil, Stuart Haber, and Moti Yung, Security against replay chosen-ciphertext attack; Richard J Lipton, New directions in testing; Michael Merritt, Towards a theory of cryptographic systems: A critique of crypto-complexity; Alon Orlitsky, Feedback in discrete communication; Rafail Ostrovsky and Moti Young, On necessary conditions for secure distributed computation; Jim Reeds, Secure IX Network; Marie-Jeanne Toussaint and Pierre Wolper, Reasoning about cryptographic protocols.
